Walmart Interview Questions, Process, and Tips

Q1. Write a for loop in cpp to print n natural numbers without using semicolon (;)
Ans. 
Use recursion to print n natural numbers in C++ without semicolon.
• Define a function to print natural numbers recursively.

• Call the function inside main function with n as argument.

• Base case: if n is less than 1, return.

• Print n and call the function with n-1 as argument.
Answered by AI
Add your answer
Q2. A complex SQL query.
Add your answer

Asked basic java questions. Find duplicate values in two array list, find the second largest number in a list.

Q1. Selenium concept based questions. Dynamic xpaths, syntax for testng, time complexity
Add your answer
Q2. Detailed questions about testng and selenium based framework.
Add your answer

Leetcode 3234 question

Q1. Java question about oops concept
Add your answer
Q2. Dsa problem k connected airports
Add your answer

Q1. Why u want to join walmart
Ans. 
I want to join Walmart because of its reputation as a leading retail company with a strong focus on technology and innovation.
• Opportunity to work on cutting-edge technology projects

• Chance to contribute to a well-known and respected company

• Desire to be part of a team that values innovation and growth
Answered by AI
Add your answer

Q1. What is your profile
Add your answer
Q2. What is your str strength
Add your answer

General topic and current affairs and company topic

Q1. Sales experience
Add your answer
Q2. Salary for month
Add your answer

Basic DSA and spring boot questions

Q1. Coco eating banana (Leetcode)
Add your answer
Q2. Remove duplicate numbers from an array
Ans. 
Remove duplicate numbers from an array of strings
• Iterate through the array and use a Set to store unique values

• Convert the Set back to an array to get the final result
Answered by AI
Add your answer
Q3. Implement key-value structure
Ans. 
Implement a key-value structure
• Use a hashmap or dictionary data structure to store key-value pairs

• Implement methods to add, retrieve, update, and delete key-value pairs

• Consider handling collisions and implementing a hashing function

• Example: HashMap keyValueMap = new HashMap<>()
Answered by AI
Add your answer

First Round DSA : 1 Find cycle in the graph and distance of each node to the cyclee