Walmart Software Engineer Interview Questions & Rounds
How the Walmart software engineer interview works: online assessment, DSA, Java and LLD, and hiring manager rounds, from real candidate experiences.
On this page
How to Crack Walmart: The Software Engineer Interview, From Real Experiences
Last updated November 20, 2026 · 26 min read · For interns (Sparkplug, CodeHers, campus), new grads and SDE 2, and SDE 3 candidates at Walmart Global Tech
Built by the Codinzhub team. This guide is built from Walmart software engineer interview experiences that candidates shared, including experiences and an assessment question on Codinzhub. Most come from Walmart Global Tech in India. The process changes by year, level, route and team, so treat this as a map, not a promise.
The 30-second version. The Walmart software engineer interview depends on your route. Students come through campus drives or the Sparkplug and CodeHers challenges and take an online assessment: an MCQ section, usually 25 questions, plus 2 coding questions in about 90 minutes. Then come usually two technical interviews mixing DSA with Java, OOP, OS, DBMS and SQL, and a hiring manager or HR round. SDE 3 reports had no test: a recruiter call, a DSA round of about 60 minutes, a Java and low-level design round of 60 to 90 minutes, and a hiring manager round that can include design. Decisions came from the same night to about a week later. The habit that matters most: explain your approach and its complexity, then optimise out loud.
What this guide is, and what it is not
This guide is built from 25 candidate experiences of Walmart software engineer interviews, mostly from 2023 to 2025, covering interns, new grads and SDE 2, and SDE 3 engineers. Almost all are from Walmart Global Tech in India. Senior and staff loops are not covered: no readable first-hand report exists in the data.
It is:
- A map of the process, stage by stage, as candidates described it
- The question patterns that keep coming back, and the follow-ups to expect
- A six-week plan and practice problems matched to those patterns
It is not:
- A list of leaked questions or a promise of what you will be asked
- An official description of Walmart's process
- An offer rate. Outcomes in candidate posts are self-reported and are not a statistical sample.
Important things to know before you start
These Walmart-specific facts change how you should prepare.
Java is the house language. Java-specific questions came up in most reports with a fundamentals section (11 of 17), from HashMap internals to Spring Boot. One SDE 2 candidate who preferred C++ found the role Java-heavy. Learn Java's collections, memory model and threads even if you code in another language.
Code runs online; campus rounds may be on paper. In 4 reports candidates coded in an IDE or ran code against tests. One 2024 campus loop was in person, with SQL joins on paper and a hand dry run. Practise both.
Tests are proctored and timed per question. Hiring-challenge MCQs gave about a minute each (4 reports), and two candidates warned that looking away from the screen can cancel your attempt.
Round-by-round breakdown
Candidates described five stages: application, shortlisting, an online assessment (campus and challenge routes only), the interview loop, and a decision. Almost every record is from Walmart Global Tech in India.
Stage 1: Application, where candidates applied
Students came through hiring challenges or campus drives; experienced engineers through recruiters, referrals or a direct application.
| Channel | What candidates said |
|---|---|
| Hiring challenges (CodeHers, Sparkplug) | The most common route in the data (7 of 18 reports), run online on Unstop. One candidate wrote that Sparkplug is for third-year students at select colleges, and CodeHers for women in third and fourth year (fourth-years interview, third-years get an internship). |
| On-campus drives | 4 reports. One 2024 drive started with a CGPA cut, then an OA and interviews. |
| Recruiter outreach | 3 reports, all SDE 3 level, via LinkedIn, Naukri or a direct call. |
| Referral | 2 reports. One tier-3 graduate got a referral through LinkedIn connections. |
| Direct application and PPO | One 2025 SDE 3 applied through LinkedIn. One Sparkplug intern converted to an SDE 2 pre-placement offer (PPO). |
What helped. Candidates credited projects they could explain in depth, a strong challenge score, and for one tier-3 graduate, a referral.
Stage 2: Shortlisting, how candidates moved forward
What happens between applying and the first interview depends on the route.
- Score cut-offs (campus and challenges). One 2024 campus drive shortlisted on CGPA; about 98 students took the OA and 30 reached interviews. In hiring challenges the shortlist used the combined MCQ and coding score (2 reports). Two Sparkplug candidates described about 20,000 registrations, about 2,400 to 2,500 after the MCQ round, about 1,500 after the first coding round, and a final top 100.
- Profile verification (CodeHers). One 2024 candidate submitted college, CGPA and a Bangalore or Chennai preference, and showed an ID card on camera. Interviews then ran in descending score order until positions were filled.
- Recruiter call (experienced hires). Three SDE 3 and IN3 candidates were contacted by a recruiter; one was told the plan on the call: DSA, then system design, then a managerial round.
What candidates advised. Treat the MCQ round as scored: its score carries into the shortlist.
Stage 3: Online assessment
Campus candidates, interns and hiring-challenge applicants took an online assessment (OA), a timed online test. No SDE 3 record had one, and no phone screen was reported at any level.
Online assessment and hiring challenges
How it works. Nearly every report describes an MCQ section followed by 2 coding questions (11 of 11). The coding part ran 90 minutes in most reports that gave a length (6 of 7); one 2024 campus test on HirePro was 75 minutes in total. The MCQs cover OOP, OS, DBMS, networks, SQL and code output in C, C++ or Java. 25 MCQs was the most common count (5 of 8), at about a minute each in hiring challenges; other counts were 22 and 10 (2024 campus tests) and 30 (a CodeHers internship test).
Sparkplug, the internship challenge, has three rounds: MCQs, then two coding rounds of 2 problems each (3 reports). A 2024-season candidate called the problems basic; two 2025-season candidates (tests held in October 2024) described harder, graph-heavy sets. Four candidates stressed speed, because the score or shortlist depended on tests passed and time taken. Two warned that proctoring is strict: looking away from the screen can cancel your attempt. AI-tool policy was not reported.
At a glance
- Length: 90 minutes for the coding part in most reports (6 of 7)
- Questions: an MCQ section (usually 25) plus 2 coding questions
- What was asked: CS-fundamentals MCQs; coding on graphs and union-find, strings, and number theory
- Most common: No single repeated question
| Question | What it tests | Level |
|---|---|---|
| Count the factors of every number in an array | Divisor counting up to the square root | New grad |
| Clean a string, then swap each vowel that is followed by a consonant | String simulation | New grad |
| Can two strings be made equal with swaps within and between them | Character counting | Intern |
| Count unreachable node pairs as edges are removed one by one | Offline reverse union-find | Intern |
| Minimum cost to deliver packages when connected houses share a delivery | Connected components with union-find | Intern |
| Find all articulation points of an undirected connected graph | Tarjan low-link values | Intern |
| Count occurrences of the pattern EFWA in a letter grid | Grid DFS with backtracking | Intern |
| Answer divisor queries on M: common, divisible by R, not divisible | Divisor precomputation and GCD | Intern |
OA questions shared on Codinzhub.
| Question | Drive | Topic |
|---|---|---|
| Walmart+ Travel discount scheme | ASU | Not reported |
See all Walmart OA questions in the question bank.
Stage 4: The interview loop
The loop has two shapes. Campus, intern and SDE 2 loops usually had two technical interviews that mixed DSA problems with OOP, OS, DBMS and SQL questions (9 of 10), then a hiring manager or HR round. SDE 3 loops opened with a DSA round (7 of 7), moved to a Java and low-level design (LLD) or design round (6 of 7; a UI role had a JavaScript and React round instead), and ended with a hiring manager round. Rounds ran on Zoom in 5 reports; one 2024 campus loop was in person. Some loops finished in one day, and one CodeHers loop stretched from August to October 2024.
How a technical round usually runs
| Part | What usually happens | What to do |
|---|---|---|
| Opening | Introductions, then your resume, projects or internship | Have a two-minute summary per project |
| Main problems | One to four problems: explain, code, discuss complexity | Say the brute force first, then optimise |
| Follow-ups | Variants (unsorted input, brackets) or test cases to run | Re-check edge cases before saying done |
| Theory | Java, OOP, OS or DBMS questions, often tied to your resume | Revise the stack you list on your resume |
| Close | Your questions about the team and stack | Ask one or two specific questions |
In 4 of 18 reports the interviewer asked for complexity or an optimised version; three candidates got hints when stuck.
DSA coding rounds
At a glance
- Length: about 60 minutes in most reports that gave a length (8 of 13); 45 to 50 minutes in some SDE 2 loops
- Questions: 2 problems was the most common count (8 of 17); the range was 1 to 4
- What was asked: arrays and strings, linked lists, trees and BSTs, stacks, graphs; SQL queries in some SDE 2 rounds
- Most common: none above two reports; spiral matrix traversal and longest substring without repeating characters came up twice each
One 2025 SDE 3 described this round as LeetCode 150 style, medium to hard; another SDE 3 had 2 medium problems and 1 hard in an hour. Two candidates had a coding question even in the round labelled managerial or HR.
| Question | Follow-up | Level |
|---|---|---|
| Spiral order traversal of a matrix | Not reported | New grad, SDE 3 |
| Longest substring without repeating characters | Not reported | SDE 2, IN3 |
| First missing positive | Not reported | SDE 3 |
| Binary tree game: root player moves down, other player moves up | Not reported | SDE 3 |
| Simplify a letter expression with + and -, then handle brackets | Brackets, including a minus before a bracket | SDE 2 (PPO) |
| Remove duplicates from a sorted array, then unsorted variants | Unsorted input; non-contiguous duplicates with no extra space | SDE 2 (PPO) |
| Route between stations across trains with departure and arrival times | Not reported | New grad |
| Order in which a binary tree burns from a target node | Not reported | SDE 2 |
CS fundamentals and Java questions
At a glance
- Length: usually part of a technical round; SDE 3 loops had a 60- to 90-minute Java and LLD round
- Questions: Java-specific questions in most reports (11 of 17); OS, DBMS and networks mainly in campus and SDE 2 loops (8 of 17)
- What was asked: HashMap internals, OOP, garbage collection, Spring Boot dependency injection, threads; OS memory and deadlocks; normalization and SQL
- Most common: HashMap internals and OOP pillars, 3 reports each
Questions follow your resume. One 2025 SDE 3 called the Java and LLD round the most grilling: it ended with 10 rapid questions on which data structure fits a scenario.
| Question | What it tests | Level |
|---|---|---|
| How does a HashMap work internally | Hashing, buckets, collisions | SDE 2, SDE 3 |
| Explain the OOP pillars with examples, then overloading vs overriding | OOP concepts | SDE 2, SDE 2 (PPO) |
| How does Java garbage collection and memory management work | JVM memory | SDE 2, SDE 3 |
| Spring Boot annotations and dependency injection | Spring Boot | SDE 3 |
| Implement producer-consumer, then create a deadlock | Threads, wait and notify, locks | SDE 3 |
| Explain normalization up to BCNF (and beyond) | Database normalization | Intern, New grad |
| Deadlocks: conditions and handling techniques | OS concurrency | SDE 2 (PPO), New grad |
| What happens when you message a friend on WhatsApp (OSI layers) | Network layers | New grad |
Design round (LLD and HLD)
At a glance
- Length: 60 to 90 minutes (4 reports)
- Rounds: one design round, usually LLD paired with Java; one IN3 loop had a separate high-level design (HLD) round, and two put design inside the hiring manager round
- What was asked: class design, database schema and indexing, REST APIs with pagination, design patterns, capacity estimates
- Most common: design a WhatsApp-like chat system (2 reports)
No campus or intern loop had a design round. A 2025 SDE 3 with an offer said pagination was explicitly expected and naming SOLID principles helped.
Reported designs.
- Design a WhatsApp-like chat system: chat search, schema and indexing, paginated APIs, then when not to use microservices (2025 SDE 3; another got it as an HLD)
- Design a Jukebox, after Java 17 questions, with high-availability questions at the end (2025 SDE 3)
- Design an event planner that books rooms around people's availability: database, basic APIs and a SQL query (SDE 3)
- Design a URL shortener from given functional and non-functional requirements: estimates, base-62 codes, cache with expiry (IN3)
- Design a chess game, including move validation behind APIs (IN3, in the managerial round)
- Design a vending machine (SDE 2, 2023)
- API design for a library (SDE 2, 2023)
- Apply the strategy pattern to a real-world application (2025 SDE 3)
Hiring manager and HR rounds
At a glance
- Length: 30 to 60 minutes (6 reports)
- Questions: a project deep dive plus a few behavioral or hypothetical prompts
- Themes: your projects and role, why Walmart, conflict and escalation, disagreeing with a manager, hypotheticals on ethics and weekend work
This last round is more than a chat. The most common prompt was a deep dive into a past project (7 of 14 reports); for experienced hires it leaned toward architecture (async flows, Kafka and rule engines in one 2025 report). Several hiring manager rounds included technical work (5 of 14): a chess LLD, a WhatsApp HLD, an architecture deep dive, a coding question, and SQL plus a tree problem. Two SDE 3 candidates met the hiring manager in person, and in one 2025 pool drive it was an elimination round.
Reported questions.
- Walk through a past project in depth: architecture, your role, decisions
- Why do you want to join Walmart, and what do you know about it
- Which extracurricular activities did you do, and what was your role, then whether there was any controversy in it
- Your manager does something wrong that must reach the director: what do you do
- Would you work 4 to 5 hours on a weekend for a project
- No Spring Boot on your resume, but teams use it: how will you learn it
- How do you resolve a conflict, then how do you handle escalations
- Disagreeing with your manager: would you push back if code quality suffers
- Your manager keeps asking you to change the project design: how do you handle it
See all behavioral questions in the question bank.
Stage 5: Debrief and offer
Decision. No hiring committee or team-matching step was reported. Decisions came from the same night to about a week after the last round. One 2024 campus drive announced 6 offers the same night, from 10 final-round candidates; one SDE 3 heard after a week. Two SDE 3 candidates got no response after their last round; one received a feedback survey a month later.
Team fit. One 2026 SDE 3 full-stack candidate got "Strong Hire" feedback, but the team wanted more backend experience; the recruiter offered a referral to frontend SDE 3 openings in Bangalore.
Offer. Where an offer location was stated, it was Bangalore (a 2025 SDE 3) or Chennai (a 2024 CodeHers SDE 2). A Sparkplug intern converted to an SDE 2 pre-placement offer after two 1-hour technical rounds and managerial feedback.
The Codinzhub Next-Round Playbook
Candidates who moved forward were quick in the tests, clear in the coding rounds, and deep on their own projects.
To get past the shortlist
- Treat the MCQ round as scored: in hiring challenges the shortlist used the combined MCQ and coding score (2 reports).
- For CodeHers, keep interviewing elsewhere: one candidate waited about six months for her first interview.
To get past the OA
- Practise MCQs at a minute each, including code-output questions in C, C++ and Java.
- Bank partial credit: one 2024 campus test let students with one full and one partial solution through.
To get past the DSA coding rounds
- Expect 2 problems in about 60 minutes, sometimes up to 4 short ones. Budget your time per problem.
- Run your code against your own cases when the editor allows it. One IN3 candidate missed a single case out of about 15 and still cleared the round.
To get past the fundamentals and Java questions
- Prepare each Java topic at two levels: what it is, then how it works inside.
- Expect questions on whatever your resume lists: two candidates were asked about Spring Boot or Django because their projects used it.
To get past the design round
- Fix entities, then schema and indexes, then APIs, with pagination on lists: one 2025 SDE 3 said it was explicitly expected.
- If the interviewer changes direction, restate your design and ask where to go deeper: one rejected candidate felt the round drifted.
To get past the hiring manager round
- Know one project well enough to discuss it for 30 minutes, including its architecture.
- Treat it as scored: it was an elimination round in one 2025 pool drive.
To get through the debrief and offer
- Expect an answer within about a week. If you hear nothing after that, follow up with the recruiter: two candidates were never contacted again.
How the loop differs by level
The building blocks stay the same, but the entry route, the OA and the design expectation change by level.
| Level | What candidates describe |
|---|---|
| Intern (Sparkplug, CodeHers, campus intern) | 6 reports. Sparkplug and CodeHers internships were decided online with no interview: MCQs, then coding rounds of 2 problems each. A 2024 campus intern loop had an OA, two same-day Zoom technical interviews, then HR. One Sparkplug intern converted to an SDE 2 offer after two 1-hour technical rounds. No design. |
| New grad and SDE 2 (Software Engineer II) | 8 reports. OA (MCQs plus 2 coding questions), usually two technical interviews mixing DSA with OOP, OS, DBMS and SQL, then a hiring manager or HR round. Only one SDE 2 loop, from 2023, had design. |
| SDE 3 (Software Engineer III, IN3) | 9 reports. No OA: a recruiter call, a DSA round of about 60 minutes, a Java and LLD round of 60 to 90 minutes, and a hiring manager round that can include HLD. Two of these candidates had 2 to 3 years of experience. Both SDE 3 rejections with a known round came after the Java or design round. |
| Senior Software Engineer and above | No readable first-hand report in the data, so this guide cannot describe the senior loop. |
Most-asked topics
Across 23 reports with technical rounds, Java and OOP theory came up almost as widely as array and string coding (11 against 13 reports).
| Topic | What it means | Seen in | Reported examples |
|---|---|---|---|
| Arrays, strings and hashing | Scans, two pointers, sliding windows, prefix sums and hash maps | 13 of 23 reports | Spiral order traversal of a matrix; Longest substring without repeating characters |
| Java internals, OOP and concurrency | How Java works under the hood, OOP design, threads | 11 of 23 reports | How does a HashMap work internally; Explain the OOP pillars with examples, then overloading vs overriding |
| SQL and DBMS | Writing queries and explaining database theory | 8 of 23 reports | SQL: Nth highest salary; Explain normalization up to BCNF (and beyond) |
| Linked lists, stacks and queues | Pointer manipulation and LIFO or FIFO structures | 8 of 23 reports | Valid parentheses, then a bonus Two Sum; Merge two sorted linked lists |
| Graphs and union-find | Nodes and edges: traversal, components, shortest paths | 6 of 23 reports | Count unreachable node pairs as edges are removed one by one; Find all articulation points of an undirected connected graph |
| Low-level and system design | Classes, schemas and APIs for a product feature | 6 of 23 reports | Design a WhatsApp-like chat system; Design a Jukebox |
| OS and networks | Processes, memory, deadlocks, and how a request travels | 5 of 23 reports | Deadlocks: conditions and handling techniques; What happens when you type www.google.com |
| Trees and BSTs | Hierarchies: traversals, validation, distances | 5 of 23 reports | Check whether a binary tree is a BST; Order in which a binary tree burns from a target node |
The question patterns that keep coming back
Most Walmart questions in the data are familiar problems with little story around them, so spot the pattern fast and explain it cleanly.
1. Arrays, strings and hashing
The widest pattern (13 of 23 reports), common at every level. Choose by the ask: a contiguous range with a condition is a sliding window; "count subarrays with sum k" or "longest subarray with sum 0" is prefix sums plus a hash map; sorted input or pairs is two pointers; a grid walk is boundary simulation. Spiral matrix traversal was one of only two coding questions that repeated.
Reported examples. Spiral order traversal of a matrix; Longest substring without repeating characters; Count subarrays of a binary array with sum equal to target; Longest subarray with sum divisible by K; Trapping rain water.
2. Java internals, OOP and concurrency
Asked in 11 of 23 reports, from campus rounds to SDE 3 Java and LLD rounds. Expect a "why" or "how" after each definition: one SDE 3 said every answer drew another. For "how does X work", explain the structure first (a HashMap is an array of buckets, with collisions handled inside a bucket), then the trade-off. For thread problems, name the tool before coding: wait and notify or a blocking queue for producer-consumer, two locks taken in opposite order for a deadlock. HashMap internals and the OOP pillars were the most asked, with 3 reports each.
Reported examples. How does a HashMap work internally; Explain the OOP pillars with examples, then overloading vs overriding; Implement producer-consumer, then create a deadlock; Sort a HashMap by value, descending, without extra data structures (the interviewer wanted Java Streams).
3. SQL and DBMS
Seen in 8 of 23 reports, mostly campus and SDE 2, and you write queries live. "Top N" or "Nth" means ORDER BY with LIMIT and OFFSET (DISTINCT for ties); "every pair" is a self-join; "most of something" is GROUP BY with a count. Theory goes deep: one candidate was taken through normal forms up to 5NF.
Reported examples. SQL: Nth highest salary; SQL: generate every match pairing between cricket teams; Explain normalization up to BCNF (and beyond); Transaction management and the three anomalies.
4. Linked lists, stacks and queues
Seen in 8 of 23 reports, usually alongside other problems in the same round. Use fast and slow pointers for a middle node or a cycle, a dummy head for merging, and a stack whenever the input nests.
Reported examples. Valid parentheses, then a bonus Two Sum; Simplify a letter expression with + and -, then handle brackets; Merge two sorted linked lists; Implement a stack using queues.
5. Graphs and union-find
Seen in 6 of 23 reports, and the hardest hiring-challenge questions in the data were graph problems. Use union-find when groups merge or when deletions can be replayed in reverse as additions; BFS for the fewest steps; Tarjan's low-link values for articulation points; topological sort for prerequisites; Dijkstra when edges carry times or costs.
Reported examples. Count unreachable node pairs as edges are removed one by one; Find all articulation points of an undirected connected graph; Course scheduling problem; Route between stations across trains with departure and arrival times.
6. Low-level and system design
Seen in 6 of 23 reports, all SDE 3 or IN3 except one 2023 SDE 2 loop. Model the classes, then the schema and indexes, then the API, with pagination on any list or search. If the prompt gives traffic numbers, estimate storage and throughput first. The WhatsApp-like chat system was the only design asked twice.
Reported examples. Design a WhatsApp-like chat system; Design a Jukebox; Design an event planner that books rooms around people's availability; Design a URL shortener from given functional and non-functional requirements.
7. Trees and BSTs
Seen in 5 of 23 reports. Recursion is the default; switch to BFS for levels, distances or spreading from a node, and use in-order traversal for anything ordered in a BST.
Reported examples. Check whether a binary tree is a BST; Order in which a binary tree burns from a target node; K-th smallest element in a BST; Binary tree game: root player moves down, other player moves up.
Preparing for the hiring manager round
The hiring manager round can decide the offer: in one 2025 pool drive it was an elimination round. Walmart's own hiring guide tells candidates to read up on its values, mission and latest investments, and to practise answers in the STAR format. Its four stated values are Respect the Individual, Act with Integrity, Serve Our Customers and Members, and Strive for Excellence.
Build your story bank. Prepare six to eight real stories, each under two minutes, and one project you can discuss for 30 minutes. Cover the themes candidates were asked about:
| Theme | Reported prompt (paraphrased) | Follow-up to expect |
|---|---|---|
| Your project | Walk through a past project in depth: architecture, your role, decisions | Design choices, async flows or queues if you used them |
| Motivation | Why do you want to join Walmart | What do you know about Walmart |
| Conflict | How do you resolve a conflict | How do you handle escalations |
| Disagreement | Would you push back if code quality suffers | Your manager keeps asking you to change the design |
| Integrity | Your manager does something wrong that must reach the director | Checked against your earlier answer about hierarchy |
| Learning | No Spring Boot on your resume, but teams use it | Approaching a project when you lack its prerequisites |
| Initiative | Extracurricular activities and your role in them | Any controversy in that role |
Structure each story. Situation in one line, what you did (say "I"), the result with a number, and what you would change.
Expect depth. The project deep dive was the most common prompt (7 of 14 reports); one IN3 candidate spent about 30 minutes on it before a design question. One hypothetical was checked against an earlier answer, so stay consistent.
A six-week plan
The plan follows the patterns above, most common first, and ends with timed mocks that feel like the real rounds. Plan on two to three focused hours a day.
- Week 1: Arrays, strings and hashing. Sliding window, prefix sums with a hash map, two pointers, matrix traversal. Habit: write the time and space complexity for every solution.
- Week 2: Java internals, OOP and concurrency. HashMap internals, garbage collection, exceptions, Spring Boot annotations, producer-consumer. Habit: answer each topic in two levels, what it is and how it works inside.
- Week 3: Linked lists, stacks, queues and trees. Fast and slow pointers, merging, expression stacks, BST validation, BFS from a target node. Habit: dry-run pointer code on a three-node example.
- Week 4: SQL and DBMS, plus OS and networks. Nth highest, self-joins, GROUP BY; normalization, keys, transactions; deadlocks and memory. Habit: write every query by hand before running it.
- Week 5: Graphs and design. Union-find, BFS, topological sort, articulation points; for SDE 3, two LLDs (a chat app, a booking calendar) with schema and paginated APIs. Habit: draw the graph or class diagram before writing code.
- Week 6: Mocks. Four timed 60-minute mocks on a video call with an editor: 2 problems each, then 10 minutes of Java or DBMS questions. Rehearse your project deep dive and stories out loud.
Sparkplug and CodeHers candidates should move graphs and number theory up to week 2 and practise under a timer, because selection depended on speed. SDE 3 candidates should start LLD in week 2 and trim the OS and networks block.
Only two weeks? Spend three days on arrays and strings, two on Java and OOP internals, two on linked lists and trees, two on SQL and DBMS, two on graphs (students) or LLD (SDE 3), and three on timed mocks and hiring manager stories.
Practice problems that match these experiences
These are well-known practice problems that match the patterns above. They are not claims about Walmart's question bank unless a row says the problem was asked as-is.
| # | Practice problem | Pattern | Seen in these experiences as |
|---|---|---|---|
| 1 | Spiral Matrix | Matrix boundary simulation | Asked as-is in two reports |
| 2 | Longest Substring Without Repeating Characters | Sliding window | Asked as-is in two reports |
| 3 | Binary Subarrays With Sum | Sliding window, at-most trick | Asked as-is in one report |
| 4 | Trapping Rain Water | Two pointers | Asked as-is in one report |
| 5 | Print Zero Even Odd | Thread coordination | Print odd and even numbers using two Java threads |
| 6 | Nth Highest Salary | SQL ordering and offsets | Asked as-is in one report |
| 7 | Basic Calculator | Stack for nested signs | Simplify a letter expression with + and -, then handle brackets |
| 8 | Merge Two Sorted Lists | Linked-list merge | Asked as-is in one report |
| 9 | Count Unreachable Pairs of Nodes in an Undirected Graph | Union-find components | Count unreachable node pairs as edges are removed one by one |
| 10 | Articulation Points (or Cut Vertices) in a Graph | Tarjan low-link values | Asked as-is in one hiring-challenge report |
| 11 | Course Schedule | Topological sort | Course scheduling problem |
| 12 | Validate Binary Search Tree | Bounded recursion | Asked as-is in one report |
No practice page matches the design questions; use the reported designs in Stage 4.
How to handle a question you have never seen
Most Walmart rounds give you 2 or more problems in an hour, so a repeatable method matters more than memorised solutions.
- Repeat the problem and one example. Several prompts were story-wrapped (packages and houses, trains and stations), so restate the core contract in one line.
- Say the brute force and its complexity. In 4 reports the interviewer asked for complexity or pushed for a better version.
- Name the bottleneck. Repeated lookups suggest a hash map; repeated range sums suggest prefix sums; merging groups suggest union-find; nesting suggests a stack.
- Say when you are stuck. Three candidates got hints, and two of them reached the optimised answer and passed the round.
- Code in small pieces while talking. Where an IDE or test runs were available (4 reports), run each helper on a small case; on paper, name helpers clearly.
- Dry-run one case and fix the wrong line. One campus candidate dry-ran a spiral matrix for the interviewer and was selected.
Why candidates were rejected
Seven reports ended without an offer, but only three give a reason, and only one of those reasons came from a recruiter. Read these as signals, not rules.
- Team fit on experience, not performance. Recruiter feedback to one 2026 SDE 3 full-stack candidate was "Strong Hire", but the team wanted more backend experience. The recruiter offered a referral to frontend openings instead of an offer.
- Losing the thread in a mixed design round. A 2025 SDE III candidate, rejected after an LLD and HLD round, felt the interviewer kept switching between HLD, DSA and OOP, so they never settled on a design direction.
- Gaps in database theory. A campus M.Tech candidate answered most DBMS questions but felt weak on 4NF and 5NF; the HR round that should have followed was never held.
- No reason given. One SDE III was rejected after a Java and LLD round heavy on Spring Boot and HashMap internals. One Sparkplug finalist was rejected despite solving the final round quickly.
- Silence after the last round. Two SDE 3 candidates heard nothing after their final round and read the silence as a rejection.
Selected vs. rejected: do this, not that
No selected candidate described a perfect loop. What repeated were a few habits, and the rejected reports show where skipping them hurt.
| Do this | Not that | What the reports show |
|---|---|---|
| Talk through the approach: explain it, then code and dry-run it | Silent coding: typing before the interviewer knows your plan | Four selected candidates said they explained their approach or dry-ran the code. |
| Climb from brute force: say it, give its complexity, then optimise | Stopping at the first answer | Two candidates reached an optimised answer from brute force after a hint, and both passed that round. |
| Own every resume line: know each project's design and stack in depth | Listing tools you cannot defend | Three selected candidates credited deep project knowledge; one interviewer liked a GitHub demo video. |
| Anchor the design: fix entities, schema and APIs first, then add pagination and patterns | Drifting with the interviewer's tangents | One 2025 SDE 3 with an offer said pagination and design-pattern vocabulary mattered; one rejected SDE III never settled on a direction. |
| Close with questions: ask about the team, stack and problems | Ending on "no questions" | Three candidates asked about the team or work, and one called it a good impression. |
If you remember only five things
- Two routes, two loops. Students take an OA (MCQs plus 2 coding questions), then usually two technical interviews and a hiring manager or HR round. SDE 3 reports had no OA: DSA, then Java and LLD, then a hiring manager round.
- About 60 minutes, most often 2 problems. Theory questions on Java, OOP, OS or DBMS are mixed into the technical rounds.
- Explain, then optimise. State the approach and complexity, then improve it; two candidates who reached the optimised answer after a hint passed the round.
- Arrays, strings and Java internals first. Then SQL and DBMS, linked lists and trees, graphs, and LLD for SDE 3.
- Own one project end to end. The project deep dive was the most common hiring manager prompt, and that round can include design and decide the offer.
FAQ
Does everyone take an online assessment?
No. Nearly every campus, intern and hiring-challenge report had one (11 of 11), but no SDE 3 record did.
Which language should I use?
Java is the safest choice: Java-specific questions appeared in 11 of 17 reports with a fundamentals section. One CodeHers coding challenge allowed any language.
Is system design asked?
At SDE 3 and IN3, yes: an LLD round of 60 to 90 minutes, sometimes with HLD. No campus or intern loop had design, and only one SDE 2 loop did.
How long does it take?
Experienced loops took one to three days in 3 reports, and decisions came from the same night to about a week later. CodeHers was slowest: one first interview came about six months after the coding challenge.
Will the interviewer help me?
Sometimes. Three candidates got hints when stuck, and two of them reached the optimised answer and passed the round.
Is it virtual or in person?
Both. Rounds ran on Zoom in 5 reports; one 2024 campus loop was in person, and two SDE 3 candidates met the hiring manager in person.
About this guide
The Codinzhub team researched and wrote this guide from 25 Walmart software engineer interview experiences, mostly from 2023 to 2025, including experiences and an assessment question shared on Codinzhub. We kept only what candidates described. The questions are our own short summaries, and the practice links are similar problems unless marked exact. If you interviewed recently, share your experience on Codinzhub and we will update this Walmart software engineer interview guide.
Disclaimer. Walmart's process changes by role, year, team and office. Use this guide to build a foundation, and confirm the current format with your recruiter.
Search the question bank
The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.
Showing 20 of 100 questions
Walmart+ Travel discount scheme
A Walmart online assessment question shared on Codinzhub (ASU).
Count the factors of every number in an array
Level: New grad.
Clean a string, then swap each vowel that is followed by a consonant
Level: New grad.
Can two strings be made equal with swaps within and between them
Level: Intern.
Count unreachable node pairs as edges are removed one by one
Level: Intern.
Minimum cost to deliver packages when connected houses share a delivery
Level: Intern.
Find all articulation points of an undirected connected graph
Level: Intern.
Count occurrences of the pattern EFWA in a letter grid
Level: Intern.
Answer divisor queries on M: common, divisible by R, not divisible
Level: Intern.
Spiral order traversal of a matrix
Level: New grad, SDE 3.
Longest substring without repeating characters
Level: SDE 2, IN3.
First missing positive
Level: SDE 3.
Binary tree game: root player moves down, other player moves up
Level: SDE 3.
Simplify a letter expression with + and -, then handle brackets
Level: SDE 2 (PPO).
Remove duplicates from a sorted array, then unsorted variants
Level: SDE 2 (PPO).
Route between stations across trains with departure and arrival times
Level: New grad.
Order in which a binary tree burns from a target node
Level: SDE 2.
How does a HashMap work internally
Level: SDE 2, SDE 3.
Explain the OOP pillars with examples, then overloading vs overriding
Level: SDE 2, SDE 2 (PPO).
How does Java garbage collection and memory management work
Level: SDE 2, SDE 3.
Keep preparing on Codinzhub
- Walmart interview questions and experiences — OA questions and interview experiences candidates shared for Walmart.
- Browse Walmart online assessment questions — filter the Codinzhub question bank by company.
- Amazon Software Engineer interview guide — the Amazon process, rounds and question patterns.
- Google Software Engineer interview guide — the Google process, rounds and question patterns.
- Adobe Software Engineer interview guide — the Adobe process, rounds and question patterns.
- All company interview guides — every guide on the Codinzhub blog.
Keep track of what you’ve learned.