Articles

Blogs

MCQ

SQL

Q&A

Tools

Tags

Jobs

News

Community

LogIn

Email

Password

Show Password

Forget Password

I don't have account.Sign Up!

Login

‹ ›

‹ ›

‹ ›

‹ ›

Sponsored -53%

Zebronics #1 Best Seller

ZEBRONICS Blanc Slim Wireless Mouse — Rechargeable, BT + 2.4GHz (Black)

Up to 1600 DPI · Silent clicks · 63g · Multicolor LED

★★★★★★★★★★ 4.0 (9,512) 5K+ bought last month

₹376 M.R.P. ₹799Save ₹423

Buy Now →

Adℹ

✕

Amazon Interview Drilldown: Reddit Questions

Harshit Kumar

Last Updated : 30 August 2026

45 Views

#coding-problems

#interview

#amazon

#dsa

#interview-experience

Adℹ

Based on real posts from Reddit users who underwent Amazon interviews and common problem lists on there, this guide presents authentic problems, structured explanations and sample walkthroughs to help you connect the dots for preparation.

1. Online Assessment: Attractive Number (Reddit OA Report)

Problem:
Given a number num as a string and integer k, define num as attractive if every digit is equal to the digit k positions ahead (num[i] == num[i+k]). Return the smallest attractive number ≥ num.

Topic Hint:
Constructive string manipulation + iteration.

Explanation:
Build a candidate by repeating the first k digits:
e.g., num = "25352", k = 2 → candidate "25252".
If it’s less than num, increment the first k-digit chunk and repeat (→ "26262").

Example:
Input: num = "25352", k = 2
Base chunk: "25" → candidate = "25252" (less than num)
Increment chunk: "26" → "26262" (≥ num)
Output: "26262"

Source: Reddit

2. Range-Minimax Expense Partition (Reddit)

Problem:
Given an array expense[] and integer p, partition the array into p contiguous segments. The cost of each segment is the sum of its endpoints. Compute the minimum and maximum total segment cost.

Topic Hint:
Prefix sums + sorting.

Explanation:
Compute base cost: expense[0] + expense[n-1].
Build all possible “cut costs” by summing adjacent pairs.
Sort cut-cost candidates.

• Minimum total = base + sum of smallest (p−1).
• Maximum total = base + sum of largest (p−1).

Example:
Input: expense = [1,2,3,4], p = 2
Base = 1 + 4 = 5
Cut costs = [3,5,7]
Minimum = 5 + 3 = 8,
Maximum = 5 + 7 = 12
Output: [8,12]

Source: Reddit

3. Topic Patterns from Reddit Whisper

Reported Themes:
Arrays, BFS, Topological Sorting, Union-Find, Trees appear frequently in Amazon interviews.

I recently interviewed with Amazon and the questions covered topics like Arrays,
  BFS, Topological Sorting, Union Find and Trees.

Actionable Patterns:

• Arrays: Sliding window, two pointers.
• Graphs / Trees: BFS/DFS, LCA, connectivity, topological order.
• Union-Find: Cycle detection, grouping.

Example Amazon-Style Problem:
Course Schedule (Topological Sort):
Given courses and dependencies, decide if you can complete all.
→ Build graph → in-degree → Kahn’s algorithm → check for cycle.

4. Top Amazon Coding Problems (Reddit Analysis)

A data-backed Reddit post analyzed ~300+ Amazon interviews and ranked the most frequently asked DSA problems.

Key Tier 1 OA Problems (40%+ frequency):

1. Number of Islands (43%)
2. LRU Cache (41%)
3. Merge Two Sorted Lists (39%)
4. Maximum Subarray (38%)
5. Best Time to Buy and Sell Stock (37%)
6. Product of Array Except Self (35%)
7. Reverse Linked List (34%)
8. Two Sum (33%)
9. Longest Palindrome (32%)
10. Linked List Cycle (31%)
11. Palindrome Linked List (30%)
12. Intersection of Two Linked Lists (29%)
13. Invert Binary Tree (28%)
14. Binary Tree Inorder Traversal (27%)
15. Set Matrix Zeroes (26%)

Phone Screen Favorites:

Longest Substring Without Repeating Characters, Longest Palindromic Substring, 3Sum, Group Anagrams, Merge Intervals, Valid Parentheses,
Valid Anagram, Word Search, Top K Frequent Elements, etc.

Onsite Differentiators:

Merge K Sorted Lists, Trapping Rain Water, Sliding Window Maximum, Serialize/Deserialize Tree, Course Schedule, Trie, Kth Largest Element,
Longest Increasing Subsequence, etc.

Trending Developer Reads

Google L4 Software Engineer III interview experience | Selected

Top 50 SQL Interview Questions and Answers (Beginner to Intermediate)

JioHotstar Staff Software Engineer Interview Experience (Bangalore)

Uber SDE-2 Interview Experience : LLD, HLD, DSA & Hiring Manager Round

Spinny SDE-1 Interview Experience (Selected)

Uber SDE 2 Interview Experience (5 Rounds, Selected) - Complete DSA Questions with solution, System Design & Managerial Round

Amazon SDE II Interview Experience (Bangalore, Selected) ~ Aug 2026

Amazon SDE-2 Interview Experience (3 Years Experience)

Meesho SDE-1 Backend Interview Experience (Remote | 3 Round) - Rejected

Top 50+ SQL Interview Questions and Answers for Intermediate to Advanced

Responses (0)

Write a response

Hide Comments

No Comments yet.

‹ ›

‹ ›

‹ ›

‹ ›

Sponsored -53%

Zebronics #1 Best Seller

ZEBRONICS Blanc Slim Wireless Mouse — Rechargeable, BT + 2.4GHz (Black)

Up to 1600 DPI · Silent clicks · 63g · Multicolor LED

★★★★★★★★★★ 4.0 (9,512) 5K+ bought last month

₹376 M.R.P. ₹799Save ₹423

Buy Now →

‹ ›

‹ ›

‹ ›

‹ ›

Sponsored -34%

iQOO Amazon's Choice

iQOO Z10 Lite 5G — Cyber Green, 4GB RAM, 128GB Storage

Dimensity 6300 · 50MP Sony AI Camera · 6000 mAh · IP64

★★★★★★★★★★ 4.0 (2,052) 500+ bought last month

₹18,997 M.R.P. ₹28,999Save ₹10,002

Buy Now →

\n \n \n \n \n

Based on real posts from Reddit users who underwent Amazon interviews and common problem lists on there, this guide presents authentic problems, structured explanations and sample walkthroughs to help you connect the dots for preparation.

1. Online Assessment: Attractive Number (Reddit OA Report)

Problem:
\nGiven a number num as a string and integer k, define num as attractive if every digit is equal to the digit k positions ahead (num[i] == num[i+k]). Return the smallest attractive number ≥ num.

Topic Hint:
\nConstructive string manipulation + iteration.

Explanation:
\nBuild a candidate by repeating the first k digits:
\ne.g., num = \"25352\", k = 2 → candidate \"25252\".
\nIf it’s less than num, increment the first k-digit chunk and repeat (→ \"26262\").

Example:
\nInput: num = \"25352\", k = 2
\nBase chunk: \"25\" → candidate = \"25252\" (less than num)
\nIncrement chunk: \"26\" → \"26262\" (≥ num)
\nOutput: \"26262\"

Source: Reddit

2. Range-Minimax Expense Partition (Reddit)

Problem:
\nGiven an array expense[] and integer p, partition the array into p contiguous segments. The cost of each segment is the sum of its endpoints. Compute the minimum and maximum total segment cost.

Topic Hint:
\nPrefix sums + sorting.

Explanation:
\nCompute base cost: expense[0] + expense[n-1].
\nBuild all possible “cut costs” by summing adjacent pairs.
\nSort cut-cost candidates.

\n
• Minimum total = base + sum of smallest (p−1).
\n
• Maximum total = base + sum of largest (p−1).
\n

Example:
\nInput: expense = [1,2,3,4], p = 2
\nBase = 1 + 4 = 5
\nCut costs = [3,5,7]
\nMinimum = 5 + 3 = 8,
\nMaximum = 5 + 7 = 12
\nOutput: [8,12]

Source: Reddit

3. Topic Patterns from Reddit Whisper

Reported Themes:
\nArrays, BFS, Topological Sorting, Union-Find, Trees appear frequently in Amazon interviews.

I recently interviewed with Amazon and the questions covered topics like Arrays,\n  BFS, Topological Sorting, Union Find and Trees.\n

Actionable Patterns:

\n
• Arrays: Sliding window, two pointers.
\n
• Graphs / Trees: BFS/DFS, LCA, connectivity, topological order.
\n
• Union-Find: Cycle detection, grouping.
\n

Example Amazon-Style Problem:
\nCourse Schedule (Topological Sort):
\nGiven courses and dependencies, decide if you can complete all.
\n→ Build graph → in-degree → Kahn’s algorithm → check for cycle.

4. Top Amazon Coding Problems (Reddit Analysis)

A data-backed Reddit post analyzed ~300+ Amazon interviews and ranked the most frequently asked DSA problems.

Key Tier 1 OA Problems (40%+ frequency):

\n
1. Number of Islands (43%)
\n
2. LRU Cache (41%)
\n
3. Merge Two Sorted Lists (39%)
\n
4. Maximum Subarray (38%)
\n
5. Best Time to Buy and Sell Stock (37%)
\n
6. Product of Array Except Self (35%)
\n
7. Reverse Linked List (34%)
\n
8. Two Sum (33%)
\n
9. Longest Palindrome (32%)
\n
10. Linked List Cycle (31%)
\n
11. Palindrome Linked List (30%)
\n
12. Intersection of Two Linked Lists (29%)
\n
13. Invert Binary Tree (28%)
\n
14. Binary Tree Inorder Traversal (27%)
\n
15. Set Matrix Zeroes (26%)
\n

Phone Screen Favorites:

Longest Substring Without Repeating Characters, Longest Palindromic Substring, 3Sum, Group Anagrams, Merge Intervals, Valid Parentheses,\nValid Anagram, Word Search, Top K Frequent Elements, etc.\n

Onsite Differentiators:

Merge K Sorted Lists, Trapping Rain Water, Sliding Window Maximum, Serialize/Deserialize Tree, Course Schedule, Trie, Kth Largest Element,\nLongest Increasing Subsequence, etc.\n