Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 818. Race Car | Hard | 5% | TopicsDynamic ProgrammingHeuristic SearchA* Search |
| 925. Long Pressed Name | Easy | 5% | TopicsTwo PointersString |
| 1537. Get the Maximum Score | Hard | 5% | TopicsArrayTwo PointersDynamic ProgrammingGreedy |
| 2828. Check if a String Is an Acronym of Words | Easy | 5% | TopicsArrayString |
| 3534. Path Existence Queries in a Graph II | Hard | 5% | TopicsArrayTwo PointersBinary SearchDynamic ProgrammingGreedyBit ManipulationGraph TheorySorting |
| 2739. Total Distance Traveled | Easy | 5% | TopicsMathSimulation |
| 2045. Second Minimum Time to Reach Destination | Hard | 5% | TopicsBreadth-First SearchGraph TheoryShortest PathDijkstra's AlgorithmK Shortest Path |
| 3336. Find the Number of Subsequences With Equal GCD | Hard | 5% | TopicsArrayMathDynamic ProgrammingNumber TheoryEuclidean AlgorithmGreatest Common Divisor |
| Market Analysis II | Hard | 5% | TopicsDatabase |
| 1-bit and 2-bit Characters | Easy | 5% | TopicsArray |
| 1675. Minimize Deviation in Array | Hard | 5% | TopicsArrayGreedyHeap (Priority Queue)Ordered Set |
| 765. Couples Holding Hands | Hard | 5% | TopicsGreedyDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 659. Split Array into Consecutive Subsequences | Medium | 5% | TopicsArrayHash TableGreedyHeap (Priority Queue) |
| 3501. Maximize Active Section with Trade II | Hard | 5% | TopicsArrayStringBinary SearchSegment Tree |
| Second Minimum Node In a Binary Tree | Easy | 5% | TopicsTreeDepth-First SearchBinary Tree |
| 3513. Number of Unique XOR Triplets I | Medium | 5% | TopicsArrayMathBit Manipulation |
| 2451. Odd String Difference | Easy | 5% | TopicsArrayHash TableString |
| 3254. Find the Power of K-Size Subarrays I | Medium | 5% | TopicsArraySliding Window |
| 2399. Check Distances Between Same Letters | Easy | 5% | TopicsArrayHash TableString |
| 2407. Longest Increasing Subsequence II | Hard | 5% | TopicsArrayDivide and ConquerDynamic ProgrammingBinary Indexed TreeSegment TreeQueueMonotonic Queue |
| 3584. Maximum Product of First and Last Elements of a Subsequence | Medium | 5% | TopicsArrayTwo Pointers |
| 3995. Minimum Cost to Convert String III | Hard | 5% | TopicsArrayStringDynamic Programming |
| 1247. Minimum Swaps to Make Strings Equal | Medium | 5% | TopicsMathStringGreedy |
| 2697. Lexicographically Smallest Palindrome | Easy | 5% | TopicsTwo PointersStringGreedy |
| 1202. Smallest String With Swaps | Medium | 5% | TopicsArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-FindSorting |
