Walmart SDE-2 Interview Questions, Process, and Tips

Round duration - 30 Minutes
Round difficulty - Easy

MCQ Challenge was to test basic computer fundamentals. The quiz had 30 questions to be attempted in 25 minutes consisting questions related to Data structures and algorithm, OOPS, OS, DBMS and some questions to find the output of Java Program.
Platform was fast and responsive, and we were not allowed to switch through tabs during the test.

Q1. 
Maximum Depth of a Binary Tree Problem Statement
Given the root node of a binary tree with N nodes, where each node contains integer values, determine the maximum depth of the tree. The depth is defined a...read more
Ans. 
Find the maximum depth of a binary tree given its level order traversal.
• Traverse the tree level by level and keep track of the depth using a queue data structure.

• For each level, increment the depth by 1 until all nodes are processed.

• Return the maximum depth encountered during traversal as the final result.

• Example: For input [5, 10, 15, 20, -1, 25, 30, -1, 40, -1, -1, -1, -1, 45], the maximum depth is 7.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

90 minutes is what we get to present a logical coding solution to the challenge presented to us. There were 2 coding questions and we can submit the answer as many times we want. There were hidden test cases and after submitting we could only see the score.

Q1. 
Sliding Window Maximum Problem Statement
You are given an array/list of integers with length 'N'. A sliding window of size 'K' moves from the start to the end of the array. For each of the 'N'-'K'+1 possi...read more
Ans. 
Sliding window maximum problem where we find maximum element in each window of size K.
• Use a deque to store indices of elements in decreasing order within the window.

• Pop elements from the deque that are out of the current window.

• Add the maximum element to the result for each window.
Answered by AI
Add your answer
Q2. 
String Transformation Problem
Given a string (STR) of length N, you are tasked to create a new string through the following method:
Select the smallest character from the first K characters of STR, remov...read more
Ans. 
Given a string, select smallest character from first K characters, remove it, and append to new string until original string is empty.
• Iterate through the string, selecting the smallest character from the first K characters each time.

• Remove the selected character from the original string and append it to the new string.

• Repeat the process until the original string is empty.

• Return the final new string formed after the ope
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

It was the first technical round conducted on Zoom held for about 40 min. The video was enabled for this round. Computer fundamentals and problem solving was checked in this round.

Q1. 
Maximum Number With Single Swap
You are given an array of N elements that represent the digits of a number. You can perform one swap operation to exchange the values at any two indices. Your task is to de...read more
Ans. 
Given an array of digits, find the maximum number that can be achieved by performing at most one swap.
• Iterate through the array to find the maximum digit.

• If the maximum digit is already at the beginning, find the next maximum digit and swap them.

• If the maximum digit is not at the beginning, swap it with the digit at the beginning.
Answered by AI
Add your answer
Q2. 
Equilibrium Index Problem Statement
Given an array Arr consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...read more
Ans. 
Find the equilibrium index of an array where sum of elements on left equals sum on right.
• Iterate through the array and calculate prefix sum and suffix sum at each index.

• Compare prefix sum and suffix sum to find equilibrium index.

• Return the left-most equilibrium index found.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was the first technical round conducted on Zoom held for about 40 min. The video was enabled for this round.

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. 
Find the number with the maximum frequency in an array of integers.
• Create a hashmap to store the frequency of each element in the array.

• Iterate through the array to update the frequency count.

• Find the element with the maximum frequency and return it.

• If multiple elements have the same maximum frequency, return the one with the lowest index.
Answered by AI
View 5 more answers

Round duration - 30 Minutes
Round difficulty - Easy

This was the final round held for about 30 min on Zoom. My video was enabled all the time and basic HR questions were being asked.

Round duration - 50 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to pass this round with ease.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

• If the complement exists, add the pair to the result list.

• Sort the result list based on the criteria mentioned in the question.

• Return the sorted list of pairs.
Answered by AI
Add your answer
Q2. 
Convert Sorted Array to BST Problem Statement
Given a sorted array of length N, your task is to construct a balanced binary search tree (BST) from the array. If multiple balanced BSTs are possible, you ca...read more
Ans. 
Construct a balanced binary search tree from a sorted array.
• Create a recursive function to construct the BST by selecting the middle element as the root.

• Recursively construct the left subtree with elements to the left of the middle element and the right subtree with elements to the right.

• Ensure that the constructed tree is balanced by maintaining the height difference of left and right subtrees at most 1.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Again a DSA specific round , where I was given two problems to solve ranging from Medium to Hard. Major topics discussed were Binary Trees and Dynamic Programming.

Q1. 
Top View of a Binary Tree Problem Statement
You are given a Binary Tree of integers. Your task is to determine and return the top view of this binary tree.
The top view of a binary tree consists of all th...read more
Ans. 
The task is to determine and return the top view of a given Binary Tree of integers.
• The top view of a binary tree consists of all the nodes visible when the tree is viewed from the top.

• Identify the nodes that appear on the top when looking from above the tree.

• Output the top view as a space-separated list of node values from left to right.
Answered by AI
Add your answer
Q2. 
Minimum Jumps Problem Statement
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...read more
Ans. 
Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.
• Use a greedy approach to keep track of the farthest reachable shop from the current shop.

• If at any point the current shop is not reachable, return -1.

• Update the current farthest reachable shop as you iterate through the array.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round majorly focused on past projects and experiences from my Resume and some standard System Design + LLD questions + some basic OS questions which a SDE-2 is expected to know .

Q1. Design a URL shortener.
Ans. 
Design a URL shortener system to generate short URLs for long URLs.
• Use a unique identifier for each long URL to generate a short URL.

• Store the mapping of short URL to long URL in a database.

• Implement a redirection mechanism to redirect short URLs to their corresponding long URLs.
Answered by AI
Add your answer
Q2. How can you print numbers from 1 to 100 using more than two threads in an optimized approach?
Ans. 
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
• Divide the range of numbers (1-100) among the threads to avoid overlap.

• Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.

• Implement a logic where each thread prints its assigned numbers in sequence.

• Consider using a thread pool to manage and optimize thread creation and execution.

• Example: Thread 1 prints n...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to pass this round with ease.

Q1. 
Minimum Cost to Connect Sticks
You are provided with an array, ARR, of N positive integers. Each integer represents the length of a stick. The task is to connect all sticks into one by paying a cost to jo...read more
Ans. 
Find the minimum cost to connect all sticks into one by joining two sticks at a time.
• Sort the array of stick lengths in non-decreasing order.

• Keep adding the two smallest sticks at a time to minimize cost.

• Repeat until all sticks are connected into one.
Answered by AI
Add your answer
Q2. 
Minimum Jumps Problem Statement
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...read more
Ans. 
Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.
• Use BFS to traverse through the shops and keep track of the minimum jumps needed to reach each shop.

• If at any point the current shop has Arr[i] = 0, return -1 as it is impossible to reach the final shop.

• Return the minimum number of jumps needed to reach the last shop.

• Example: For the input [5, 3, 2, 1, 0, ...read more
Answered by AI
Add your answer

Round duration - 70 Minutes
Round difficulty - Hard

This round was preety intense and went for over 1 hour . I was asked 2 preety good coding questions (one was from Graphs and the other one was from DP) . After that I was grilled on my Computer Networks concepts but luckily I was able to answer all the questions and the interviewer was also quite impressed .

Q1. 
Bipartite Graph Problem Statement
Determine if a given graph is bipartite. A graph is bipartite if its vertices can be divided into two independent sets, 'U' and 'V', such that every edge ('u', 'v') conne...read more
Ans. 
Check if a given graph is bipartite by dividing its vertices into two independent sets.
• Create two sets 'U' and 'V' to store vertices based on their connections

• Use BFS or DFS to traverse the graph and assign vertices to sets

• Check if any edge connects vertices within the same set, if yes, the graph is not bipartite
Answered by AI
Add your answer
Q2. 
Maximum Length Pair Chain Problem Statement
You are provided with 'N' pairs of integers such that in any given pair (a, b), the first number is always smaller than the second number, i.e., a < b. A pai...read more
Ans. 
Given pairs of integers, find the length of the longest pair chain where each pair follows the given condition.
• Sort the pairs based on the second element in ascending order.

• Iterate through the sorted pairs and keep track of the maximum chain length.

• Update the chain length if the current pair can be added to the chain.

• Return the maximum chain length as the result.
Answered by AI
Add your answer
Q3. Can you explain the TCP/IP protocol?
Ans. 
TCP/IP is a set of protocols that governs the transmission of data over the internet.
• TCP/IP stands for Transmission Control Protocol/Internet Protocol.

• It is a suite of communication protocols used to interconnect network devices on the internet.

• TCP ensures that data packets are delivered reliably and in order.

• IP is responsible for addressing and routing packets to their destination.

• Examples of TCP/IP applications inclu...read more
Answered by AI
Add your answer
Q4. Can you explain the DHCP Protocol?
Ans. 
DHCP is a network protocol that automatically assigns IP addresses to devices on a network.
• DHCP stands for Dynamic Host Configuration Protocol

• It allows devices to obtain IP addresses and other network configuration information dynamically

• DHCP servers assign IP addresses to devices within a network

• DHCP uses a lease mechanism to control the amount of time a device can use an IP address

• DHCP reduces the administrative burd
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round majorly focused on past projects and experiences from my Resume and some standard System Design +
LLD questions + some basic OS questions which a SDE-2 is expected to know .

Q1. How would you design a system like Pastebin?
Ans. 
A system like Pastebin allows users to store and share text snippets online.
• Allow users to paste text content into a form

• Generate a unique URL for each paste

• Set expiration time for pastes to be automatically deleted

• Implement syntax highlighting for various programming languages

• Provide options for users to set visibility (public/private) of their pastes
Answered by AI
Add your answer
Q2. What is data abstraction and how can it be achieved?
Ans. 
Data abstraction is the process of hiding implementation details and showing only the necessary features of an object.
• Data abstraction can be achieved through abstract classes and interfaces in object-oriented programming.

• It helps in reducing complexity by providing a simplified view of the data.

• By using access specifiers like private, protected, and public, we can control the visibility of data members and methods.

• Exa...read more
Answered by AI
Add your answer