Y

Yandex

100 questions tracked94 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 100 of 100 questions

1
MediumLongest Subarray of 1's After Deleting One Elementβœ“ Our Solution
100
ArrayDynamic ProgrammingSliding Window
2
EasySummary Rangesβœ“ Our Solution
95
Array
3
MediumString Compressionβœ“ Our Solution
89
Two PointersString
4
MediumFind K Closest Elementsβœ“ Our Solution
88
ArrayTwo PointersBinary SearchSliding Window+2
5
EasyIsomorphic Stringsβœ“ Our Solution
84
Hash TableString
6
MediumSubarray Sum Equals Kβœ“ Our Solution
82
ArrayHash TablePrefix Sum
7
MediumPermutation in Stringβœ“ Our Solution
82
Hash TableTwo PointersStringSliding Window
8
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
81
ArrayHash TableMathDesign+1
9
EasyValid Palindromeβœ“ Our Solution
81
Two PointersString
10
EasyMove Zeroesβœ“ Our Solution
81
ArrayTwo Pointers
11
MediumLine Reflection
80
ArrayHash TableMath
12
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
80
Hash TableStringSliding Window
13
MediumMerge Intervalsβœ“ Our Solution
78
ArraySorting
14
MediumGroup Anagramsβœ“ Our Solution
77
ArrayHash TableStringSorting
15
75
ArrayHash Table
16
MediumNumber of Islandsβœ“ Our Solution
74
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
17
EasyValid Parenthesesβœ“ Our Solution
73
StringStack
18
MediumOne Edit Distance
73
Two PointersString
19
EasyValid Palindrome IIβœ“ Our Solution
72
Two PointersStringGreedy
20
MediumInterval List Intersectionsβœ“ Our Solution
70
ArrayTwo PointersLine Sweep
21
HardTrapping Rain Waterβœ“ Our Solution
67
ArrayTwo PointersDynamic ProgrammingStack+1
22
MediumFind All Anagrams in a Stringβœ“ Our Solution
65
Hash TableStringSliding Window
23
MediumMin Stackβœ“ Our Solution
65
StackDesign
24
MediumLongest Palindromic Substringβœ“ Our Solution
65
Two PointersStringDynamic Programming
25
EasyMerge Sorted Arrayβœ“ Our Solution
64
ArrayTwo PointersSorting
26
MediumDesign an ATM Machineβœ“ Our Solution
62
ArrayGreedyDesign
27
MediumGenerate Parenthesesβœ“ Our Solution
62
StringDynamic ProgrammingBacktracking
28
MediumDesign Hit Counter
60
ArrayBinary SearchDesignQueue+1
29
MediumLRU Cacheβœ“ Our Solution
58
Hash TableLinked ListDesignDoubly-Linked List
30
MediumEvaluate Reverse Polish Notationβœ“ Our Solution
58
ArrayMathStack
31
EasyIs Subsequenceβœ“ Our Solution
58
Two PointersStringDynamic Programming
32
MediumValidate Binary Search Treeβœ“ Our Solution
57
TreeDepth-First SearchBinary Search TreeBinary Tree
33
EasyMerge Two Sorted Listsβœ“ Our Solution
57
Linked ListRecursion
34
MediumLongest Substring with At Most K Distinct Characters
57
Hash TableStringSliding Window
35
HardMinimum Window Substringβœ“ Our Solution
55
Hash TableStringSliding Window
36
MediumBinary Tree Right Side Viewβœ“ Our Solution
55
TreeDepth-First SearchBreadth-First SearchBinary Tree
37
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
55
ArrayDynamic Programming
38
EasyDestination Cityβœ“ Our Solution
55
ArrayHash TableString
39
HardReconstruct Itineraryβœ“ Our Solution
53
Depth-First SearchGraphEulerian Circuit
40
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
53
TreeDepth-First SearchBinary Tree
41
MediumMax Consecutive Ones IIIβœ“ Our Solution
53
ArrayBinary SearchSliding WindowPrefix Sum
42
MediumSimplify Pathβœ“ Our Solution
53
StringStack
43
HardMerge k Sorted Listsβœ“ Our Solution
53
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
44
MediumFind Duplicate Subtreesβœ“ Our Solution
53
Hash TableTreeDepth-First SearchBinary Tree
45
HardMedian of Two Sorted Arraysβœ“ Our Solution
51
ArrayBinary SearchDivide and Conquer
46
EasyIntersection of Two Arrays IIβœ“ Our Solution
51
ArrayHash TableTwo PointersBinary Search+1
47
HardBinary Tree Maximum Path Sumβœ“ Our Solution
51
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
48
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
51
ArrayBinary Search
49
EasySymmetric Treeβœ“ Our Solution
51
TreeDepth-First SearchBreadth-First SearchBinary Tree
50
MediumContainer With Most Waterβœ“ Our Solution
46
ArrayTwo PointersGreedy
51
MediumMax Consecutive Ones II
44
ArrayDynamic ProgrammingSliding Window
52
EasyMax Consecutive Onesβœ“ Our Solution
44
Array
53
MediumProduct of Array Except Selfβœ“ Our Solution
44
ArrayPrefix Sum
54
MediumAdd Two Numbersβœ“ Our Solution
44
Linked ListMathRecursion
55
EasySingle Numberβœ“ Our Solution
44
ArrayBit Manipulation
56
44
ArrayGreedy
57
EasyRemove Elementβœ“ Our Solution
44
ArrayTwo Pointers
58
MediumLongest Increasing Subsequenceβœ“ Our Solution
40
ArrayBinary SearchDynamic Programming
59
MediumLongest Repeating Character Replacementβœ“ Our Solution
40
Hash TableStringSliding Window
60
MediumLongest Substring with At Least K Repeating Charactersβœ“ Our Solution
40
Hash TableStringDivide and ConquerSliding Window
61
EasyIntersection of Two Arraysβœ“ Our Solution
40
ArrayHash TableTwo PointersBinary Search+1
62
MediumPerfect Squaresβœ“ Our Solution
40
MathDynamic ProgrammingBreadth-First Search
63
MediumFind Minimum in Rotated Sorted Arrayβœ“ Our Solution
40
ArrayBinary Search
64
EasyValid Anagramβœ“ Our Solution
40
Hash TableStringSorting
65
MediumLowest Common Ancestor of a Binary Search Treeβœ“ Our Solution
40
TreeDepth-First SearchBinary Search TreeBinary Tree
66
MediumContinuous Subarray Sumβœ“ Our Solution
40
ArrayHash TableMathPrefix Sum
67
MediumMeeting Rooms II
36
ArrayTwo PointersGreedySorting+2
68
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
36
TreeBreadth-First SearchBinary Tree
69
MediumKth Largest Element in an Arrayβœ“ Our Solution
36
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
70
EasyBalanced Binary Treeβœ“ Our Solution
36
TreeDepth-First SearchBinary Tree
71
EasyPalindrome Numberβœ“ Our Solution
36
Math
72
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
36
ArrayDynamic ProgrammingGreedy
73
MediumReverse Integerβœ“ Our Solution
36
Math
74
MediumTwo Sum II - Input Array Is Sortedβœ“ Our Solution
36
ArrayTwo PointersBinary Search
75
EasyFirst Unique Character in a Stringβœ“ Our Solution
36
Hash TableStringQueueCounting
76
EasyCan Place Flowersβœ“ Our Solution
31
ArrayGreedy
77
EasyReverse Words in a String IIIβœ“ Our Solution
31
Two PointersString
78
MediumTop K Frequent Wordsβœ“ Our Solution
31
ArrayHash TableStringTrie+4
79
MediumFlatten Nested List Iteratorβœ“ Our Solution
31
StackTreeDepth-First SearchDesign+2
80
MediumSort the Matrix Diagonallyβœ“ Our Solution
31
ArraySortingMatrix
81
EasyContains Duplicateβœ“ Our Solution
31
ArrayHash TableSorting
82
EasyReverse Linked Listβœ“ Our Solution
31
Linked ListRecursion
83
MediumTop K Frequent Elementsβœ“ Our Solution
31
ArrayHash TableDivide and ConquerSorting+4
84
MediumRemove Duplicates from Sorted Array IIβœ“ Our Solution
31
ArrayTwo Pointers
85
EasyFind the Difference of Two Arraysβœ“ Our Solution
23
ArrayHash Table
86
MediumSearch a 2D Matrixβœ“ Our Solution
23
ArrayBinary SearchMatrix
87
23
ArrayTwo PointersSorting
88
EasyFind the Index of the First Occurrence in a Stringβœ“ Our Solution
23
Two PointersStringString Matching
89
EasyRobot Return to Originβœ“ Our Solution
23
StringSimulation
90
MediumRotate Imageβœ“ Our Solution
23
ArrayMathMatrix
91
EasyClimbing Stairsβœ“ Our Solution
23
MathDynamic ProgrammingMemoization
92
EasyPath Crossingβœ“ Our Solution
23
Hash TableString
93
MediumLongest Consecutive Sequenceβœ“ Our Solution
23
ArrayHash TableUnion Find
94
EasyMaximum Depth of Binary Treeβœ“ Our Solution
23
TreeDepth-First SearchBreadth-First SearchBinary Tree
95
EasyMajority Elementβœ“ Our Solution
23
ArrayHash TableDivide and ConquerSorting+1
96
HardContains Duplicate IIIβœ“ Our Solution
23
ArraySliding WindowSortingBucket Sort+1
97
EasyPalindrome Linked Listβœ“ Our Solution
23
Linked ListTwo PointersStackRecursion
98
MediumNon-overlapping Intervalsβœ“ Our Solution
23
ArrayDynamic ProgrammingGreedySorting
99
HardPalindrome Pairsβœ“ Our Solution
23
ArrayHash TableStringTrie
100
MediumMinimum Size Subarray Sumβœ“ Our Solution
23
ArrayBinary SearchSliding WindowPrefix Sum