EPAM Systems
52 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| First Missing Positive | Hard | 60.2% | TopicsArrayHash Table |
| 146. LRU Cache | Medium | 60.2% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 2343. Query Kth Smallest Trimmed Number | Medium | 60.2% | TopicsArrayStringDivide and ConquerSortingHeap (Priority Queue)Radix SortQuickselect |
| 2. Add Two Numbers | Medium | 50.7% | TopicsLinked ListMathRecursion |
| 9. Palindrome Number | Easy | 50.7% | TopicsMath |
| 198. House Robber | Medium | 50.7% | TopicsArrayDynamic Programming |
| Longest Consecutive Sequence | Medium | 50.7% | TopicsArrayHash TableUnion-Find |
| Two Sum II - Input Array Is Sorted | Medium | 50.7% | TopicsArrayTwo PointersBinary Search |
| Pow(x, n) | Medium | 50.7% | TopicsMathRecursion |
| 182. Duplicate Emails | Easy | 50.7% | TopicsDatabase |
| Count Salary Categories | Medium | 50.7% | TopicsDatabase |
| Multiply Strings | Medium | 50.7% | TopicsMathStringSimulation |
| 53. Maximum Subarray | Medium | 50.7% | TopicsArrayDivide and ConquerDynamic Programming |
| Reverse Words in a String | Medium | 50.7% | TopicsTwo PointersString |
| 62. Unique Paths | Medium | 50.7% | TopicsMathDynamic ProgrammingCombinatorics |
| 72. Edit Distance | Medium | 50.7% | TopicsStringDynamic Programming |
| Counter | Easy | 50.7% | Topics— |
| 206. Reverse Linked List | Easy | 50.7% | TopicsLinked ListRecursion |
| 451. Sort Characters By Frequency | Medium | 50.7% | TopicsHash TableStringSortingHeap (Priority Queue)Bucket SortCounting |
| 21. Merge Two Sorted Lists | Easy | 50.7% | TopicsLinked ListRecursion |
| 329. Longest Increasing Path in a Matrix | Hard | 50.7% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
| 402. Remove K Digits | Medium | 50.7% | TopicsStringStackGreedyMonotonic Stack |
| 34. Find First and Last Position of Element in Sorted Array | Medium | 50.7% | TopicsArrayBinary Search |
| 101. Symmetric Tree | Easy | 50.7% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 560. Subarray Sum Equals K | Medium | 50.7% | TopicsArrayHash TablePrefix Sum |
