hirecept

Walmart Global Tech: Software Development Engineer

Walmart Global Tech India's fresher process is described only loosely: an online assessment (MCQs and two coding questions in related reports), a DSA interview, a low-level design and Java round, and a hiring-manager or behavioural round. Most available reports are for experienced roles, the 2026 fresher assessment format is not confirmed, and older pay figures may be outdated. Check your campus notice and Walmart's careers page.

29 questions · 4 rounds · updated Nov 2026

How the interview works

  1. Online assessment: MCQs on OS, OOP, DBMS and DSA plus coding.
  2. DSA interview: One or two medium problems.
  3. Low-level design and Java: Parking lot or rate limiter, schema and Java depth.
  4. Hiring manager round: Projects, teamwork and motivation.

Sample questions

  • 01

    Design the classes for a parking lot system (low-level design).

    MediumLow-level design

    Model answer

    What the interviewer checks

    Clean object modelling, SOLID, extensibility and handling concurrency for spot allocation.

    How to answer

    Requirements: several floors; spot types (bike, compact, large, EV); vehicles park in a fitting spot; tickets at entry; payment at exit by duration and type; display free spots. Classes: • ParkingLot (singleton or injected): floors, entry and exit gates, `findSpot(vehicle)`. • Floor: a list of ParkingSpot, plus free counts per type. • ParkingSpot: id, type, isFree, `assign(vehicle)`, `release()`. • Vehicle (abstract) → Bike, Car, Truck, each with a required SpotType. • Ticket: id, vehicle, spot, entryTime. • SpotAllocationStrategy (interface) → NearestFirst, EVPriority: the strategy pattern, so the rule can change without editing ParkingLot. • PricingStrategy (interface) → HourlyPricing, WeekendPricing. • Payment → Cash, UPI, Card. Flow: the entry gate calls `lot.findSpot(vehicle)` → `spot.assign()` → issues a Ticket. The exit gate calculates the fee with PricingStrategy → takes payment → `spot.release()`. Concurrency: two gates may grab the same spot, so make assign atomic (synchronized, or a compare-and-set on isFree), or hand out spots from a per-type thread-safe queue. Extensions to mention: reservations, a display board updated through an observer, and monthly passes.

  • 02

    Find the length of the longest substring without repeating characters. Example: "abcabcbb" → 3 ("abc"), "pwwkew" → 3

    MediumSliding window

    Approach and solution

    Approach

    Sliding window with the last index of each character. When a character repeats inside the window, move the left edge to one past its previous index. Never move left backwards, hence the max().

    def longest_unique(s: str) -> int:
        last, left, best = {}, 0, 0
        for right, c in enumerate(s):
            if c in last and last[c] >= left:
                left = last[c] + 1
            last[c] = right
            best = max(best, right - left + 1)
        return best
    
    assert longest_unique("abcabcbb") == 3
    assert longest_unique("pwwkew") == 3
    assert longest_unique("abba") == 2

    Complexity: O(n) time, O(k) space for the alphabet.

    Likely follow-ups

    • Return the substring itself: keep the left index of the best window as well as its length.
  • 03

    Return the k most frequent elements. Example: [1,1,1,2,2,3], k = 2 → [1, 2]

    MediumHashing

    Approach and solution

    Approach

    Count with a hash map, then either use a heap of size k (O(n log k)) or bucket sort by frequency (O(n)), because a frequency can be at most n.

    from collections import Counter
    
    def top_k(a, k):
        buckets = [[] for _ in range(len(a) + 1)]
        for x, c in Counter(a).items():
            buckets[c].append(x)
        out = []
        for c in range(len(a), 0, -1):
            for x in buckets[c]:
                out.append(x)
                if len(out) == k:
                    return out
        return out
    
    assert top_k([1, 1, 1, 2, 2, 3], 2) == [1, 2]

    Complexity: O(n) time and space.

26 more questions, members only

  • Online assessment4
  • DSA interview9
  • Low-level design and Java10
  • Hiring manager and behavioural6

Members also get how to answer each question and a preparation plan for this company.

See plans from ₹399

Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.