Yandex
120 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 200. Number of Islands | Medium | 62.9% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 977. Squares of a Sorted Array | Easy | 62.9% | TopicsArrayTwo PointersSorting |
| 2241. Design an ATM Machine | Medium | 61.2% | TopicsArrayGreedyDesign |
| 392. Is Subsequence | Easy | 61.2% | TopicsTwo PointersStringDynamic Programming |
| 20. Valid Parentheses | Easy | 59.3% | TopicsStringStackBracket Sequences |
| 101. Symmetric Tree | Easy | 59.3% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Find Duplicate Subtrees | Medium | 59.3% | TopicsHash TableTreeDepth-First SearchBinary Tree |
| 33. Search in Rotated Sorted Array | Medium | 57.3% | TopicsArrayBinary Search |
| 42. Trapping Rain Water | Hard | 57.3% | TopicsArrayTwo PointersDynamic ProgrammingStackMonotonic Stack |
| 1004. Max Consecutive Ones III | Medium | 57.3% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| 155. Min Stack | Medium | 57.3% | TopicsStackDesign |
| 199. Binary Tree Right Side View | Medium | 57.3% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 238. Product of Array Except Self | Medium | 57.3% | TopicsArrayPrefix Sum |
| 11. Container With Most Water | Medium | 55% | TopicsArrayTwo PointersGreedy |
| 146. LRU Cache | Medium | 55% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| Lowest Common Ancestor of a Binary Tree | Medium | 55% | TopicsTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| 332. Reconstruct Itinerary | Hard | 55% | TopicsArrayStringDepth-First SearchGraph TheorySortingHeap (Priority Queue)Eulerian CircuitEulerian PathSemi-Eulerian Graph |
| Count Substrings Without Repeating Character | Medium | 52.4% | TopicsHash TableStringSliding Window |
| 2. Add Two Numbers | Medium | 49.4% | TopicsLinked ListMathRecursion |
| 4. Median of Two Sorted Arrays | Hard | 49.4% | TopicsArrayBinary SearchDivide and Conquer |
| 23. Merge k Sorted Lists | Hard | 49.4% | TopicsLinked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort |
| 27. Remove Element | Easy | 49.4% | TopicsArrayTwo Pointers |
| 124. Binary Tree Maximum Path Sum | Hard | 49.4% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| 53. Maximum Subarray | Medium | 49.4% | TopicsArrayDivide and ConquerDynamic Programming |
| 22. Generate Parentheses | Medium | 45.9% | TopicsStringDynamic ProgrammingBacktrackingBracket Sequences |
