Walmart | SDE-III | Bangalore | April 2026
- Location
- Bangalore
- Posted
- 24 Apr 2026
Summary
I interviewed for a SDE-III role at Walmart in Bangalore in April 2026, completing an online assessment and a DSA round where I solved two LeetCode problems and implemented a linked‑list insertion method.
How it went
Online Assessment
- Platform: Hackerrank
- Time: 80 mins
- Questions:
- Leetcode Medium Question
- Leetcode Medium Question
- Java + Spring. (integrated vscode)
- To read the values from the property files and basic spring profile setup and complete some methods as mentioned like getting the values from the property file and returning them based on the profile running.
- Run the application and it should run without any errors and all the test cases should be passed.
Round 1
- Type: Complete DSA
- Time: 60 mins
- Platform: Zoom meeting & You can choose any ide with AI tools disabled.
- Questions:
- 155. Min Stack
- 242. Valid Anagram
- Asked to create a Linked List and a method to insert a node at the end of the Linked List.
Expectations: To solve the problems with working code & all test case to be passed. No discussion on TC and SC.
Questions asked (3)
- 01
Min Stack
Data Structures & Algorithms · Easy
Open the problemDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the following operations:
push(x): Push element x onto the stack.pop(): Remove the element on top of the stack.top(): Get the top element.getMin(): Retrieve the minimum element in the stack. All operations must run in O(1) time.
- 02
Valid Anagram
Data Structures & Algorithms · Easy
Open the problemGiven two strings
sandt, returntrueiftis an anagram ofs, andfalseotherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. - 03
Linked List Insert at End
Data Structures & Algorithms
Implement a singly linked list and provide a method to insert a node at the end of the list. The method should handle an empty list as well as a non‑empty list, ensuring the new node becomes the tail of the list.