walmart logo
Walmart· Software Engineer III

Walmart | SWE III | Banglore | Onsite

Location
Banglore
Posted
29 Mar 2025
356 reads

Summary

I was interviewed onsite at Walmart for a Software Engineer III position in Bangalore. The interview process comprised three rounds: Data Structures & Algorithms, Low-Level Design, and a Hiring Manager discussion. I successfully cleared all rounds and was selected for the role.

How it went

I have been interviewed onsite at Walmart for the position of Software Engineer III Banglore Location.

Round 1 : DS Algo Round. There were 3 questions in this Round (normally they ask 2 but in my case we had some extra time so interviewer asked me 3rd question as well)

Round 2: LLD Round

Design a Social networking site, with functionalities like adding posts, likes, comments, sending and accepting/rejecting friend request, giving 'people you may know' recommendations.

  • After design asked questions like how to handle concurrent friend requests.
  • how to tackle a situation when a single user is getting lots of friend requests.
  • How to handle concurrency for each cases, how to tackle dirty read and race conditions.
  • How to design a 'people you may know' feature, algo behind that and other details.
  • Where to keep connections data and which database to use for each storage.

Round 3: Hiring Manager Round.

In this round he focused on what type of work I am doing in my currect organization. and what type of work I love to do. and told about the work Walmart does. HM got happy to know my current work and asked some more questions related to same which I answered with ease.

Interviewers were really polite and helpful. and were very active during the interview,

Overall Interviews went well and also all interviews happened in same day as it was a hiring drive.


Verdict: Selected

Questions asked (4)

  1. 01

    3Sum

    Data Structures & Algorithms

    Refer to the provided LeetCode link for the full problem description.

    Open the problem
  2. 02

    Next Smaller Element to the Right

    Data Structures & Algorithms

    Given an array of numbers, return an array with zero based index on first smaller number to right of the curr number. If no smaller number exists, retrun -1 for that number. (Stack implementation) eg: input: 5 7 2 3 1 4 -> output: 2 2 4 4 -1 -1

  3. 03

    Largest Rectangle in Histogram

    Data Structures & Algorithms

    Refer to the provided LeetCode link for the full problem description.

    Open the problem
  4. 04

    Design a Social Networking Site

    System Design

    Design a Social networking site, with functionalities like adding posts, likes, comments, sending and accepting/rejecting friend request, giving 'people you may know' recommendations.

    Follow-up questions included:

    • How to handle concurrent friend requests.
    • How to tackle a situation when a single user is getting lots of friend requests.
    • How to handle concurrency for each cases, how to tackle dirty read and race conditions.
    • How to design a 'people you may know' feature, algo behind that and other details.
    • Where to keep connections data and which database to use for each storage.

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!