Walmart Interview Questions, Process, and Tips for Freshers

Round duration - 60 minutes
Round difficulty - Medium

The test had one coding question of 60 marks and rest were MCQs on OS, OOPS, DBMS concepts. The MCQs did not have negative marking. 

The test was in the evening and passing all the test cases of the question was necessary to move to the next round. The question could also be solved using brute force approach. The test was proctored and was conducted on Hackerrank.

Q1. 
Next Smaller Element Problem Statement
You are provided with an array of integers ARR of length N. Your task is to determine the next smaller element for each array element.
Explanation:
The Next Smalle...read more
Ans. 
Find the next smaller element for each element in an array.
• Iterate through the array from right to left and use a stack to keep track of elements.

• Pop elements from the stack until a smaller element is found or the stack is empty.

• If a smaller element is found, that is the next smaller element. If the stack is empty, there is no smaller element.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was 1 hour long. It was conducted in the afternoon. The interviewer was an SDE3 working at Walmart. The interview was conducted on zoom and I was asked to share my screen and turn on my camera. I used eclipse IDE to solve the question and I was also asked to run it for some test cases.

Q1. 
Josephus Problem Statement
Consider 'N' individuals standing in a circle, numbered consecutively from 1 to N, in a clockwise direction. Initially, the person at position 1 starts counting and will skip K-...read more
Ans. 
The Josephus Problem involves eliminating every Kth person in a circle of N individuals until only one person remains. Determine the position of the last person standing.
• Use a circular linked list to simulate the elimination process efficiently

• Implement a function to find the position of the last person standing based on the given N and K values

• Consider edge cases such as when N=1 or K=1

• Optimize the solution to handle
Answered by AI
Add your answer