Here’s a curated list of 16 real LeetCode problems frequently asked in Amazon phone interviews, based on historical data, mock interviews, and online reports.
# | Problem | Difficulty | Topic Tags |
---|---|---|---|
1 | Two Sum | Easy | HashMap |
2 | Longest Substring Without Repeating Characters | Medium | Sliding Window |
3 | Merge Intervals | Medium | Intervals, Sorting |
4 | Group Anagrams | Medium | Hashing |
5 | Valid Parentheses | Easy | Stack |
6 | K Closest Points to Origin | Medium | Heap, Geometry |
7 | Maximum Subarray | Easy | Kadane’s Algorithm |
8 | Search in Rotated Sorted Array | Medium | Binary Search |
9 | Subarray Sum Equals K | Medium | HashMap, Prefix Sum |
10 | 3Sum | Medium | Two Pointers |
11 | Product of Array Except Self | Medium | Prefix Product |
12 | Number of Islands | Medium | DFS / BFS |
13 | LRU Cache | Medium | LinkedHashMap / Design |
14 | Clone Graph | Medium | Graph, BFS |
15 | Word Break | Medium | DP, Trie |
16 | Minimum Window Substring | Hard | Sliding Window, Hashing |
🎯 Prioritization Tips for Amazon:
âś… Practice hashmaps, arrays, strings, and sliding windows heavily.
âś… Be very comfortable with recursion and DFS/BFS (especially for graphs & matrices).
âś… Focus on medium-level problems, especially edge cases and optimization.
âś… Practice dry runs and explaining aloud (Amazon assesses communication during interviews).
Top comments (0)