Walmart Software Developer Interview Questions, Process, and Tips for Freshers

Round duration - 120 minutes
Round difficulty - Medium

This was the online round held at Hackerearth. All students who met the eligibility criteria were shared link for the online test on hackerearth.

Q1. 
Remove Consecutive Duplicates Problem Statement
Given a string str of size N, your task is to recursively remove consecutive duplicates from this string.
Input:
T (number of test cases)
N (length of the ...read more
Ans. 
Recursively remove consecutive duplicates from a given string.
• Use recursion to check for consecutive duplicates in the string.

• If current character is same as next character, skip the next character.

• Repeat the process until no consecutive duplicates are found.
Answered by AI
Add your answer
Q2. 
Deepest Leaves Sum Problem Statement
Given a binary tree of integers, your task is to calculate the sum of all the leaf nodes present at the deepest level of this binary tree. If there are no such nodes, ...read more
Ans. 
Calculate the sum of leaf nodes at the deepest level of a binary tree.
• Traverse the binary tree to find the deepest level of leaf nodes.

• Sum the leaf nodes at the deepest level.

• Handle null nodes represented by -1.

• Ensure the sum fits within a 32-bit integer.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems.There were 2 interviewers. We first dicussed the approach the time complexity and proper code covering all cases.

Q1. 
Palindrome Permutation - Problem Statement
Determine if a permutation of a given string S can form a palindrome.
Example:
Input:
string S = "aab"
Output:
"True"
Explanation:
The permutation "aba" o...read more
Ans. 
Check if a permutation of a string can form a palindrome.
• Create a frequency map of characters in the string.

• Count the number of characters with odd frequencies.

• If there is at most one character with odd frequency, return true.

• Otherwise, return false.
Answered by AI
Add your answer
Q2. 
Word Presence in Sentence
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
Input:
The first line contains an in...read more
Ans. 
Check if a given word is present in a sentence as a complete word.
• Split the sentence into words using spaces as delimiter.

• Check if the given word matches any of the words in the sentence.

• Ensure that the word is not just a substring of another word in the sentence.
Answered by AI
Add your answer

Round duration - 30 mintues
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Round duration - 60 minutes
Round difficulty - Medium

The platform was HackerEarth time duration was 1 hour.
1.) 25 MCQs (Both Easy and Gate Level Based) 
2.) 1 Coding Question, that needs to be solved in O(logn) time. Program for Fibonacci numbers. The basic idea behind that question is we need to crack the pattern and then based on constraints we need to solve it.

Q1. 
Nth Fibonacci Number Problem Statement
Given an integer 'N', the task is to compute the N'th Fibonacci number using matrix exponentiation. Implement and return the Fibonacci value for the provided 'N'.
N...read more
Ans. 
Use matrix exponentiation to efficiently compute the Nth Fibonacci number modulo 10^9 + 7.
• Implement matrix exponentiation to calculate Fibonacci numbers efficiently.

• Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.

• Return the result modulo 10^9 + 7 to handle large Fibonacci numbers.

• Optimize the solution to achieve better than O(N) time complexity.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was a technical round. The platform was Zoom time duration was 40 mins. Started with Tell me something about yourself.
 

Q1. 
Similar Strings Problem Statement
Determine whether two given strings, A and B, both of length N, are similar by returning a 1 if they are, otherwise return a 0.
Explanation:
String A is similar to stri...read more
Ans. 
Determine if two strings are similar based on given conditions.
• Check if the strings are equal first.

• Then check if the strings can be divided into two halves with similar patterns.

• Return 1 if the strings are similar, 0 otherwise.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom time duration was 1 hour 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms, so she was like let’s start with trees then.

 

Round duration - 30 minutes
Round difficulty - Medium

This was a Hiring Manager Round. The platform was Zoom time duration was 30 mins. Started with Tell me something about yourself.


 

Round duration - 20 minutes
Round difficulty - Easy

The platform was Zoom time duration was 20 mins. Asked me to give my introduction.