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

Amazon Placement Papers 2025

Overview

This page is a working set of Amazon placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Amazon actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Amazon drive.

Amazon Online Assessment 2025 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 2025 - actual questions & solutions

This section contains practice questions styled on Amazon placement papers 2025 (recent-cycle 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: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

Time Complexity: O(n + m)
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: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

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

Question 5: 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 6: 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 7: 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 8

Q8: Which normal form removes transitive dependency?

Solution:

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

Answer: 3NF

Question 9

Q9: Virtual memory is typically implemented using?

Solution:

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

Answer: Demand paging

Question 10

Q10: In OOP, hiding internal details and showing only essential features is called?

Solution:

This is the definition of Encapsulation (often paired with abstraction in interviews).

Answer: Encapsulation

Question 11

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

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Key insights from 2025 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: Enhanced focus on all 16 Leadership Principles - prepare multiple 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: Critical section testing 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
  9. Optimal Solutions: 2025 emphasizes optimal solutions with better time/space complexity

Amazon 2025 interview experiences

Based on recent candidate experiences from 2025 Amazon interviews:

2025 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 with detailed STAR stories

2025 Interview Trends:

  • Increased emphasis on optimal solutions with better complexity analysis
  • More detailed Leadership Principles questions requiring multiple examples
  • Enhanced work simulation scenarios testing real-world decision-making
  • Questions about ambiguous requirements and customer obsession

Common 2025 Interview Topics:

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

2025 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)
  • “Merge Intervals” (Coding)
  • “Word Ladder” (Coding)

Success Tips:

  • Strong coding performance is essential - solve problems optimally with better complexity
  • Prepare 2-3 detailed STAR stories for each of the 16 Leadership Principles
  • Practice work simulation scenarios - complex decision-making and debugging
  • Focus on e-commerce and logistics problem-solving
  • Be ready to discuss ambiguous requirements and customer obsession in detail
  • Practice explaining optimal solutions with complexity analysis

Difficulty Rating: 3.1/5

For detailed interview experiences from 2025, visit Amazon Interview Experience page.

Preparation tips for Amazon 2025 pattern

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

Comments & Suggestions

2024 papers

Coding questions

Interview experience

Amazon Leadership Principles

Preparation guide

Amazon hub

Similar companies

Google · Microsoft · Meta · Apple · Netflix · Flipkart