Amazon Placement Papers 2024

Overview

This page collects Amazon 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 Amazon patterns and the latest shifts.

2024 Pattern

The 2024 Amazon placement process emphasized DSA mastery, system design fundamentals, and Leadership Principles. Online assessment included 2 coding problems focusing on graphs, sliding window, bit manipulation, and dynamic programming.

Amazon Online Assessment 2024 pattern

Section	Questions	Time	Difficulty	Focus Areas
Coding Problem 1	1	45 min	Medium	Arrays, strings, sliding window
Coding Problem 2	1	45 min	Hard	Graphs, trees, dynamic programming
Work Simulation	Multiple scenarios	30 min	Medium	Decision-making, debugging
Behavioral MCQs	10-15	15 min	Medium	Leadership Principles

Total: 2 coding + simulation + MCQs, 90-120 minutes

Platform: HackerRank or Amazon platform
Languages Allowed: Java, C++, Python
Success Rate: ~15-20% cleared OA and advanced to interviews

Amazon Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Amazon 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: 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 3: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

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

Question 4: 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 5: 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 6: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

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

Question 7: reverse a string

Show solution

Problem Statement: Given a string, return it reversed.

Example:

Input: "placement"
Output: "tnemecalp"

Solution (Java):

public String reverse(String s) {
    return new StringBuilder(s).reverse().toString();
}

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

Question 8

Q8: Which SQL clause filters grouped rows after GROUP BY?

Solution:

HAVING filters aggregates; WHERE filters rows before grouping.

Answer: HAVING

Question 9

Q9: Worst-case time complexity of quicksort is?

Solution:

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

Answer: O(n²)

Question 10

Q10: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Question 11

Q11: Which data structure uses FIFO order?

Solution:

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

Answer: Queue

2024 hiring trends

Hiring volume

• Total Hires: 2,500+ freshers in India
• SDE-1: 2,000+ selections
• SDE-2: 500+ selections

Salary packages

• SDE-1: ₹25-32 LPA total compensation
• SDE-2: ₹40-50 LPA total compensation

Question difficulty

• Medium: 50% of questions
• Hard: 50% of questions
• Focus: Graphs, sliding window, DP

Key insights from 2024 Amazon Online Assessment

1. Coding Section is Critical: Must solve at least 1 coding problem correctly to advance
2. DSA Focus: Strong emphasis on graph algorithms, sliding window, bit manipulation, and dynamic programming
3. Leadership Principles: Behavioral questions based on Amazon’s 16 Leadership Principles - prepare STAR stories
4. System Design: Basic system design for SDE-1, advanced for SDE-2+ roles
5. Time Management: 90-120 minutes for complete OA requires good speed and accuracy
6. Work Simulation: New section tests decision-making and debugging skills
7. Difficulty Level: Amazon interviews rated 3.1/5 difficulty
8. Success Rate: Only 15-20% cleared OA and advanced to interviews

Amazon 2024 interview experiences

Based on candidate experiences from 2024 Amazon interviews:

2024 Interview Process:

1. Online Assessment (90-120 minutes): 2 coding problems + Work Simulation + Behavioral MCQs
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions
3. Onsite Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design round: For SDE-2+ roles
• Behavioral round: Heavy focus on Leadership Principles

Common 2024 Interview Topics:

• Coding: Graphs, trees, dynamic programming, sliding window, bit manipulation
• System Design: E-commerce systems, logistics, scalable architectures
• Behavioral: All 16 Leadership Principles with STAR method stories
• Work Simulation: Decision-making scenarios, debugging exercises

2024 Interview Questions Examples:

• “Tell me about a time you made a mistake” (Behavioral - Ownership)
• “Tell me about a time you had to work with ambiguous requirements” (Behavioral - Bias for Action)
• “Two Sum” (Coding)
• “Longest Substring Without Repeating Characters” (Coding)
• “Implement LRU Cache” (Coding)

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Prepare multiple STAR stories for each of the 16 Leadership Principles
• Practice work simulation scenarios - decision-making and debugging
• Focus on e-commerce and logistics problem-solving
• Be ready to discuss ambiguous requirements and customer obsession
• Practice explaining your thought process clearly

Difficulty Rating: 3.1/5

For detailed interview experiences, visit Amazon Interview Experience page.

Preparation tips for Amazon 2024 pattern

1. Master Coding Fundamentals: Focus on solving 2 coding problems correctly - graphs, DP, sliding window
2. Leadership Principles: Prepare 2-3 STAR stories for each of the 16 Leadership Principles
3. Practice Previous Year Papers: Solve Amazon OA papers from 2020-2024 to understand patterns
4. Time Management: Practice completing 2 coding problems in 90 minutes, simulation in 30 minutes
5. Work Simulation Practice: Practice decision-making scenarios and debugging exercises
6. System Design Basics: Learn e-commerce and logistics system design for SDE-1+
7. LeetCode Practice: Solve 200+ LeetCode problems focusing on Amazon tag (medium-hard difficulty)
8. STAR Method: Master STAR method for behavioral questions
9. Mock Tests: Take timed practice tests to improve speed and accuracy
10. E-commerce Focus: Practice problems related to e-commerce, logistics, and customer experience

Related resources

Amazon 2025 papers→

Latest Amazon placement papers with current year OA questions

Amazon coding questions→

Complete collection of Amazon coding problems

Amazon interview experience→

Real interview experiences from successful candidates

Amazon Leadership Principles→

Complete guide to Amazon’s 16 Leadership Principles

Amazon main page→

Complete Amazon placement guide

Similar companies

Google · Microsoft · Meta · Apple · Netflix · Flipkart

---

Practice 2024 papers to understand Amazon OA pattern!