Walmart Software Developer Intern Interview Questions, Process, and Tips

Q1. Java questions with code snippets
Add your answer
Q2. DSA questions based on heapsort etc
Add your answer

Questions asked were DP, maps, sorting etc. There were two questions and duration of the test was 1 hour 30 minutes. Platform used for the test was unstop

The duration of the test was 90 minutes. Questions were hard in this round. The test was conducted on unstop.

Round duration - 45 minutes
Round difficulty - Hard

There were 2 coding questions to be solved in 45 minutes. Questions were a bit difficult and topics covered in my set were DP and Graphs.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
The problem is to color a graph with two colors such that no two connected vertices have the same color.
• Use a graph coloring algorithm such as Depth First Search (DFS) or Breadth First Search (BFS).

• Start with an arbitrary vertex and color it with one color (e.g., blue).

• Color all its adjacent vertices with the other color (e.g., red).

• Continue this process for all connected components of the graph.

• If at any point, you en...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

I was asked questions on data structures, OOPs, OS and he grilled me on Machine Learning and Microsoft Azure (as is was mentioned in my resume).

Q1. 
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...read more
Ans. 
The program finds the number that occurs the maximum times in an array of integers.
• Iterate through the array and count the frequency of each number using a dictionary.

• Keep track of the number with the maximum frequency and its index.

• Return the number with the maximum frequency and the lowest index.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It involved a few technical questions based on my resume followed by leadership questions.

Round duration - 60 minutes
Round difficulty - Hard

Round was held in the morning probably 10 or 11 am, the test window was open for 90 minutes and one can give the test anytime in that 1.5 hour.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of ways to make change for each value using different denominations.

• Initialize the base cases and then iterate through the denominations to fill up the array.

• The final answer will be in the last cell of the array corre
Answered by AI
Add your answer
Q2. 
Duplicate Integer in Array
Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.
Input:
The first line contains an integer...read more
Ans. 
Identify the duplicate integer in an array of size N containing numbers between 1 and N-1.
• Iterate through the array and keep track of the frequency of each element using a hashmap.

• Return the element with a frequency greater than 1 as the duplicate integer.

• Ensure the constraints are met and a duplicate number is guaranteed to be present in the array.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled on 12th Nov, almost after 30 days of the previous technical round. I got the confirmation of passing the previous round on 10th Nov and was asked to appear in this final round which was scheduled on 15th Nov at 11:00 am in the morning and it was going to be an HR round which probably was my favourite among all the other rounds. I prepared for the same by reading interview experiences available at coding ninjas.

Q1. 
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tr...read more
Ans. 
Validate if a given binary tree is a Binary Search Tree (BST) or not.
• Check if the left subtree of a node contains only nodes with data less than the node's data.

• Check if the right subtree of a node contains only nodes with data greater than the node's data.

• Recursively check if both the left and right subtrees are also binary search trees.

• Example: For each node, ensure all nodes in its left subtree are less and all node
Answered by AI
Add your answer

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