Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Walmart Placement Papers 2024

Overview

This page collects Walmart placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Walmart patterns and the latest shifts.

Download 2024 Placement Papers

Walmart 2024 paper 1

Complete Walmart placement paper with aptitude questions and solutions

Walmart 2024 paper 2

Additional 2024 Walmart paper with detailed solutions

Walmart 2024 paper 3

Another 2024 Walmart paper with comprehensive solutions

Walmart exam pattern 2024

Section Questions Time Difficulty Focus Areas
Aptitude 20-25 30-40 min Medium Quantitative, logical reasoning
Technical 15-20 25-30 min Medium Domain knowledge, basics
Verbal Ability 10-15 15-20 min Easy-Medium Comprehension, grammar

Total: 50-60 questions, 60-90 minutes

Key Changes in 2024:

  • Updated question patterns
  • Increased focus on practical skills
  • New evaluation criteria

Walmart Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Walmart placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 2: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 3: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 5: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 6: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 7: longest common prefix

Show solution

Problem Statement: Find the longest common prefix string amongst an array of strings.

Example:

Input: ["flower","flow","flight"]
Output: "fl"

Solution (Java):

public String longestCommonPrefix(String[] strs) {
    if (strs.length == 0) return "";
    String pref = strs[0];
    for (int i = 1; i < strs.length; i++) {
        while (!strs[i].startsWith(pref)) {
            pref = pref.substring(0, pref.length() - 1);
            if (pref.isEmpty()) return "";
        }
    }
    return pref;
}

Time Complexity: O(S)
Space Complexity: O(1)

Question 8

Q8: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 9

Q9: Which protocol is connection-oriented at the transport layer?

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Question 10

Q10: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 11

Q11: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Hiring volume

2024 Data: Walmart hired 200-500 candidates from top engineering colleges in 2024. The company conducted placement drives at 30+ colleges across India.

Salary packages

2024 Packages: ₹15-25 LPA for freshers

Process changes

2024 Updates: Updated online assessment platform, new interview formats

Key insights from 2024 Walmart Online Assessment

  1. Aptitude Section is Critical: Must perform well in quantitative and logical reasoning
  2. Technical MCQs: Strong emphasis on domain knowledge, retail/e-commerce basics
  3. Verbal Ability: Important for communication-focused roles
  4. Time Management: 20-25 aptitude in 30-40 min + 15-20 technical in 25-30 min + 10-15 verbal in 15-20 min
  5. Success Rate: Only 20-25% cleared assessment and advanced to interviews
  6. Platform: Walmart assessment platform
  7. Focus Areas: Quantitative aptitude, logical reasoning, domain knowledge, verbal ability

Walmart 2024 interview experiences

Based on candidate experiences from 2024 Walmart interviews:

2024 Interview Process:

  1. Online Assessment (60-90 minutes): Aptitude (20-25) + Technical (15-20) + Verbal (10-15)
  2. Technical Interview (45-60 minutes): Domain knowledge, retail/e-commerce concepts, problem-solving
  3. HR Interview (30-45 minutes): Behavioral questions, company fit, motivation, retail industry interest

Common 2024 Interview Topics:

  • Aptitude: Quantitative reasoning, logical reasoning, time and work
  • Technical: Domain knowledge, retail/e-commerce concepts, problem-solving
  • Verbal: Comprehension, grammar, communication skills
  • Behavioral: Problem-solving approach, teamwork, motivation, retail industry interest

Success Tips:

  • Strong aptitude performance is essential - practice quantitative and logical reasoning
  • Understand retail/e-commerce basics and Walmart’s business model
  • Prepare behavioral examples using STAR format
  • Understand Walmart’s business model and retail services
  • Practice verbal ability - comprehension and grammar

For detailed interview experiences, visit Walmart Interview Experience page.

Preparation tips for Walmart 2024 pattern

  1. Master Aptitude: Focus on quantitative, logical reasoning - practice regularly
  2. Domain Knowledge: Basic understanding of retail/e-commerce and Walmart’s business model
  3. Practice Previous Year Papers: Solve Walmart assessment papers from 2020-2024 to understand patterns
  4. Time Management: Practice completing 20-25 aptitude questions in 30-40 minutes
  5. Verbal Ability: Practice comprehension and grammar
  6. Behavioral Preparation: Prepare examples using STAR format - leadership, teamwork, retail interest
  7. Mock Tests: Take timed practice tests to improve speed and accuracy
  8. Retail Focus: Understand retail industry trends and Walmart’s services
  9. Communication Skills: Practice articulating thoughts clearly
  10. Business Awareness: Stay updated with Walmart’s business initiatives and industry trends

Comments & Suggestions

2025 papers

Aptitude questions

Interview experience

Preparation guide

Walmart hub

Similar companies

Amazon · Target · Flipkart · Meesho · Google · Microsoft