Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1134. Armstrong Number | Easy | 20.1% | TopicsMath |
| 1120. Maximum Average Subtree | Medium | 20.1% | TopicsTreeDepth-First SearchBinary Tree |
| 1133. Largest Unique Number | Easy | 20.1% | TopicsArrayHash TableSorting |
| 1135. Connecting Cities With Minimum Cost | Medium | 20.1% | TopicsUnion-FindGraph TheoryHeap (Priority Queue)Minimum Spanning Tree |
| 1167. Minimum Cost to Connect Sticks | Medium | 20.1% | TopicsArrayGreedyHeap (Priority Queue) |
| 1074. Number of Submatrices That Sum to Target | Hard | 20.1% | TopicsArrayHash TableMatrixPrefix Sum |
| Product Sales Analysis II | Easy | 20.1% | TopicsDatabase |
| Sales Analysis I | Easy | 20.1% | TopicsDatabase |
| Sales Analysis II | Easy | 20.1% | TopicsDatabase |
| 1137. N-th Tribonacci Number | Easy | 20.1% | TopicsMathDynamic ProgrammingMemoization |
| 1363. Largest Multiple of Three | Hard | 20.1% | TopicsArrayMathDynamic ProgrammingGreedySorting |
| 1175. Prime Arrangements | Easy | 20.1% | TopicsMathPrimality TestSieve TheoryPrime Number Sieve |
| 1176. Diet Plan Performance | Easy | 20.1% | TopicsArraySliding Window |
| 1954. Minimum Garden Perimeter to Collect Enough Apples | Medium | 20.1% | TopicsMathBinary Search |
| 1944. Number of Visible People in a Queue | Hard | 20.1% | TopicsArrayStackMonotonic Stack |
| 1233. Remove Sub-Folders from the Filesystem | Medium | 20.1% | TopicsArrayStringDepth-First SearchTrie |
| Find the Team Size | Easy | 20.1% | TopicsDatabase |
| 1345. Jump Game IV | Hard | 20.1% | TopicsArrayHash TableBreadth-First Search |
| Students With Invalid Departments | Easy | 20.1% | TopicsDatabase |
| 1395. Count Number of Teams | Medium | 20.1% | TopicsArrayDynamic ProgrammingBinary Indexed TreeSegment Tree |
| 1409. Queries on a Permutation With Key | Medium | 20.1% | TopicsArrayBinary Indexed TreeSimulationSqrt Decomposition |
| 1457. Pseudo-Palindromic Paths in a Binary Tree | Medium | 20.1% | TopicsBit ManipulationTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 1458. Max Dot Product of Two Subsequences | Hard | 20.1% | TopicsArrayDynamic ProgrammingLongest Common Subsequence |
| 1466. Reorder Routes to Make All Paths Lead to the City Zero | Medium | 20.1% | TopicsDepth-First SearchBreadth-First SearchGraph Theory |
| 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 20.1% | TopicsUnion-FindGraph TheorySortingMinimum Spanning TreeStrongly Connected ComponentPrim's AlgorithmKruskal's AlgorithmBorůvka's Algorithm |
