walmart logo
Walmart· SDE II

Walmart | SDE2 | OFF CAMPUS

Result
Rejected
Posted
23 Feb 2025
346 reads

Summary

I applied for an SDE2 position at Walmart and successfully cleared three technical rounds involving MCQs and coding challenges, before ultimately being rejected after a hiring manager interview.

How it went

I applied for the SDE2 position at Walmart through Workday and received a call from the recruiter within 4-5 days.

1st Round: Cleared
This round consisted of two parts. First, I had 30 minutes to solve 25 MCQs covering Java, OOPs, DBMS, OS, and SQL concepts. Following that, I was given 40 minutes to solve two coding questions in Java.

2nd Round: Cleared
The interviewer was very friendly. After a brief introduction, we delved into two coding questions. The first was similar to Surrounded Regions, and the second was akin to Jump Game. I was provided a Google Doc link where I coded my solutions and explained my approach with various test cases.

3rd Round: Cleared
The interviewer in this round was less interactive and directly moved to the coding problems. The questions were similar to Product of Array Except Self and Binary Tree Level Order Traversal. For each problem, I was asked to discuss multiple approaches.

4th Round: Rejection
This was a hiring manager round where I was asked foundational questions, including some basic concepts related to HashMap. Although I felt I performed well and expected to clear this round, I was later informed of my rejection.

Questions asked (5)

  1. 01

    Surrounded Regions

    Data Structures & Algorithms · Medium

    The problem was similar to LeetCode's Surrounded Regions. This typically involves capturing regions of 'O's that are not connected to the boarder by changing them to 'X's.

    Open the problem
  2. 02

    Jump Game

    Data Structures & Algorithms · Medium

    The problem was similar to LeetCode's Jump Game. This problem usually asks to determine if you can reach the last index in an array, given a maximum jump length from each position.

    Open the problem
  3. 03

    Product of Array Except Self

    Data Structures & Algorithms · Medium

    The problem was similar to LeetCode's Product of Array Except Self. The goal is to return an array answer where answer[i] is the product of all elements of nums except nums[i]. I was asked to provide and discuss many different approaches for this problem.

    Open the problem
  4. 04

    Binary Tree Level Order Traversal

    Data Structures & Algorithms · Medium

    The problem was similar to LeetCode's Binary Tree Level Order Traversal. This involves traversing a binary tree level by level, collecting nodes at each depth. I was asked to provide and discuss many different approaches for this problem.

    Open the problem
  5. 05

    Basic HashMap Concepts

    Data Structures & Algorithms

    During the hiring manager round, I was asked basic conceptual questions related to HashMap. The specific questions were not detailed in the post, but covered fundamental aspects of the data structure.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Walmart recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!