I applied online. The process took 1 week. I interviewed at Walmart (Sunnyvale, CA) in Apr 2025
Interview
Gone through the entire interview process, coding challenge was fine but at the final round, as per the recruiter it was supposed to be a managerial/behavior round but got asked to do a system design. After completing all rounds of interviews, I was ghosted by the recruiter and he didn't respond back.
Interview questions [1]
Question 1
Complete two React code in hackerrank, they are not difficult (eventlistener) but will consume time.
Interview experience was good, the conversation was bi-directional and effective.
Discussed on the time and space complexity and the different ADTs.
Technical or behavioral rounds, and final interviews with leadership, assessing skills, experience, and cultural fit before extending an offer.
Interview questions [1]
Question 1
Reversal of a linked list
LRU Cache
Sliding window with buffer
They evaluated on all the edge cases, different scenario and different Abstract Data types
Questions on the time and space complexity for the same questions asked
Reversal of a linked list
LRU Cache
Sliding window with buffer
They evaluated on all the edge cases, different scenario and different Abstract Data types
Questions on the time and space complexity for the same questions asked
Reversal of a linked list
LRU Cache
Sliding window with buffer
They evaluated on all the edge cases, different scenario and different Abstract Data types
Questions on the time and space complexity for the same questions asked
Reversal of a linked list
LRU Cache
Sliding window with buffer
They evaluated on all the edge cases, different scenario and different Abstract Data types
Questions on the time and space complexity for the same questions asked
Reversal of linked list
Sliding window with buffer
LRU cache
I applied through a recruiter. The process took 1+ week. I interviewed at Walmart in Feb 2025
Interview
Prepare for Medium LeetCode problems, focusing on HashMap-based questions like Two Sum, Group Anagrams, Longest Substring Without Repeating Characters, Subarray Sum Equals K, and LRU Cache. Master efficient hashing techniques, collision handling, and optimization strategies to improve time and space complexity.