Walmart visited our campus in August 2020. The complete interview process was virtual. It was a 5 round process.
Round 1 (duration 90 minutes): The first round was unsupervised round on HackerEarth. It had 25 MCQ’s (25 marks) and 1 Coding question(25 marks).
- MCQ’s: MCQ’s included Computer Network (CN), Operating System (OS), DBMS, and aptitude questions. MCQ’s were easy and medium level.
- Coding Question: The coding question was a medium-difficult level question. This question was the decider for shortlisting (since MCQs were easy).
- Question: Fake Palindrome: Return the number of Fake Palindrome substring in a string, where Fake Palindrome is a string whose anagram is a palindrome.
Test Case 1:
Input: ABAB Output:7 Explanation: (“A”,”B”,”A”,”B”,”ABA”,”BAB”,”ABAB”)
Test Case 2:
Input: AAA Output: 6 Explanation: (“A”,”A”,”A”,”AA”,”AA”,”AAA”)
Many students got partial marks for this question using a map for every substring. I had used bit masking concept for solving this question (Maybe overkill for this question, but it cleared all test cases)
23 students were selected for the next round.
Round 2 (duration 45-60 minutes): Second round was a technical round over Zoom Meetings. The interviewer asked about CN, OS, and DS/Algo.
- Virtual Memory
- Process and Threads
- Protocols (HTTP, TELNET, FTP)
- Types of Binary Trees
- JAVA (OOPS concept, Exceptions, etc.)
- Coding Question (Greedy and Dynamic Programming question)
These were some questions he asked.
The coding question was very easy compared to the first round. He wanted to know the approach and intuition for every solution. There were some trick questions in the interview like given post-order, design a tree.
15 students were selected for the next round.
Round 3 (Duration 60 minutes): Third Round was a technical round over a Zoom Meeting. This was DS/Algo round. I was asked to code and execute questions on IDE.
- Longest Increasing Subsequence.
- Find a continuous subarray whose sum is equal to target sum. I solved the question with iterative approach(O(n^2)) and map approach(O(n)).
- Iteratively find the postorder of a tree (stack approach).
12 students were shortlisted.
Round 4(Duration 30-45 minutes): Fourth Round was a Managerial round.
- I was asked about my internship, what did I learn there, and what obstacles I faced during the internship.
- Interviewer asked about the project. Also, asked some software engineering question like the Waterfall Model.
- What is your approach to learning new technology?
- Why do you want to join Walmart and how are you fit for the job?
These were some of the questions asked during my interview.
Round 5(Duration 20-30 minutes): Fifth Round was HR round.
- Tell me about yourself.
- What do you know about Walmart?
- Are you interested in Higher Studies?
- How do you adapt and overcome a difficult situation?
- Your CGPA is relatively less, why so?
- The Toughest Decision
These were some questions asked in the HR round.
10 students have shortlisted 5 students for Full -Time + Internship and 5 students for Internship(performance-based conversion to FTE).
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the “Improve Article” button below.