Walmart SSE Interview drive
Summary
I applied for a Senior Software Engineer role at Walmart via employee referral and went through several rounds, including a recruiter call, online assessment, system design, and coding rounds. Despite feeling confident, I received a rejection without detailed feedback.
Full Experience
Interview drive on 12th March, 2026.
Applied via employee referral.
YOE: 6.8
Current company: FAAMG
Recruiter call:
- discussion why you want to change?
- is banglore location good with you? open to relocate?
- Why did I leave microsoft
- when I am available for joining
- any other offers that I am currently holding?
Online Assessment:
- Coding problem - Leetcode standard DP question
- Frontend project has an issue and it needs to be fixed(react or angular)
- Spring boot application has a new requirement, needs to be implemented
.yml file has some configs, you need to load them into a class members, if that variable is not available, then load default string on to this.
Round1: System Design:
Deep discussion on my contributions on the previous projects
Design an inventory management system, where stock keeps getting added from different partners and orders will be keep placing from users to buy them. High rate of requests, no over selling, stock addition can be eventually consistent. Read heavy DBs.
Self Verdict: Strong Hire
Round 2: Coding round.
Question 1:
There are bars given, each time you can either eat one bar, two bars, or three, what are the minimum bytes to each n bar chocolate.
Question 2:
at each time you can either take 1 step or 2 steps or three steps, to reach nth steps how many ways are there,
for 3 steps.
1, 1, 1
1, 2
3
// 2,1 should not be considered.
Question 3:
There is a bee at the 0,0 location in a M*N grid, and there are some obstacles in the grids. calculate no of ways you can reach M-1,N-1 grid.
Interviewer seems very good with commuication.
Self Verdict: Strong Hore
Round 3:
Asked to design the BookMyShow, I wrote entire code and explained all.
what is volatile
difference between locks and synchronized keyword
When to use ReentrantLock and ReentrantReadWriteLock?
VERDICT:
I have explained everything well and interviewer seems good with answers, but got rejection mail soon after LLD round, no feedback is provided. Recruiter mentioned he will get back with detailed feedback when asked, but never.
Interview Questions (15)
Reasons for Changing Jobs
Discussion on why I want to change jobs.
Relocation Preference
Is Bangalore location good with me? Am I open to relocate?
Reason for Leaving Previous Company
Why did I leave Microsoft?
Availability for Joining
When am I available for joining?
Other Offers
Am I currently holding any other offers?
Fix Frontend Bug (React/Angular)
A frontend project has an issue and it needs to be fixed (React or Angular).
Implement Spring Boot Config Loader
A Spring Boot application has a new requirement: .yml file has some configs, I need to load them into class members. If that variable is not available, then load a default string.
Design Inventory Management System
Design an inventory management system where stock keeps getting added from different partners and orders will be keep placing from users to buy them. Requirements include a high rate of requests, no over-selling, stock addition can be eventually consistent, and read-heavy DBs.
Minimum Bites to Eat N Bars
There are 'n' bars given. Each time you can either eat one bar, two bars, or three bars. What are the minimum bites to eat all 'n' bar chocolates?
Number of Ways to Climb N Steps
At each time you can either take 1 step, 2 steps, or 3 steps. To reach the Nth step, how many ways are there? For example, to reach 3 steps, the ways are:
1, 1, 1
1, 2
3
// (Note: 2,1 should not be considered as a separate way if order doesn't matter, but typically in these problems order does matter and 1,2 and 2,1 are distinct. The comment '2,1 should not be considered' implies combinations not permutations for smaller steps within a path, but the overall problem is usually permutations.)
Number of Ways to Reach Destination in Grid with Obstacles
There is a bee at the 0,0 location in an M*N grid, and there are some obstacles in the grids. Calculate the number of ways you can reach the M-1,N-1 grid.
Design BookMyShow
Design the BookMyShow system.
Explain Volatile Keyword
What is the 'volatile' keyword?
Locks vs Synchronized Keyword
What is the difference between Locks and the synchronized keyword?
When to Use ReentrantLock and ReentrantReadWriteLock
When should one use ReentrantLock and ReentrantReadWriteLock?