Y
Yandex
100 questions tracked94 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
1ArrayDynamic ProgrammingSliding Window
4ArrayTwo PointersBinary SearchSliding Window+2
6ArrayHash TablePrefix Sum
7Hash TableTwo PointersStringSliding Window
8ArrayHash TableMathDesign+1
11MediumLine Reflection
ArrayHash TableMath
12Hash TableStringSliding Window
14ArrayHash TableStringSorting
16ArrayDepth-First SearchBreadth-First SearchUnion Find+1
18MediumOne Edit Distance
Two PointersString
20ArrayTwo PointersLine Sweep
21ArrayTwo PointersDynamic ProgrammingStack+1
22Hash TableStringSliding Window
24Two PointersStringDynamic Programming
27StringDynamic ProgrammingBacktracking
28MediumDesign Hit Counter
ArrayBinary SearchDesignQueue+1
29Hash TableLinked ListDesignDoubly-Linked List
31Two PointersStringDynamic Programming
32TreeDepth-First SearchBinary Search TreeBinary Tree
34MediumLongest Substring with At Most K Distinct Characters
Hash TableStringSliding Window
35Hash TableStringSliding Window
36TreeDepth-First SearchBreadth-First SearchBinary Tree
39Depth-First SearchGraphEulerian Circuit
40TreeDepth-First SearchBinary Tree
41ArrayBinary SearchSliding WindowPrefix Sum
43Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
44Hash TableTreeDepth-First SearchBinary Tree
45ArrayBinary SearchDivide and Conquer
46ArrayHash TableTwo PointersBinary Search+1
47Dynamic ProgrammingTreeDepth-First SearchBinary Tree
49TreeDepth-First SearchBreadth-First SearchBinary Tree
51MediumMax Consecutive Ones II
ArrayDynamic ProgrammingSliding Window
58ArrayBinary SearchDynamic Programming
59Hash TableStringSliding Window
60Hash TableStringDivide and ConquerSliding Window
61ArrayHash TableTwo PointersBinary Search+1
62MathDynamic ProgrammingBreadth-First Search
65TreeDepth-First SearchBinary Search TreeBinary Tree
66ArrayHash TableMathPrefix Sum
67MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
68TreeBreadth-First SearchBinary Tree
69ArrayDivide and ConquerSortingHeap (Priority Queue)+1
70TreeDepth-First SearchBinary Tree
72ArrayDynamic ProgrammingGreedy
74ArrayTwo PointersBinary Search
75Hash TableStringQueueCounting
78ArrayHash TableStringTrie+4
79StackTreeDepth-First SearchDesign+2
83ArrayHash TableDivide and ConquerSorting+4
88Two PointersStringString Matching
91MathDynamic ProgrammingMemoization
93ArrayHash TableUnion Find
94TreeDepth-First SearchBreadth-First SearchBinary Tree
95ArrayHash TableDivide and ConquerSorting+1
96ArraySliding WindowSortingBucket Sort+1
97Linked ListTwo PointersStackRecursion
98ArrayDynamic ProgrammingGreedySorting
99ArrayHash TableStringTrie
100ArrayBinary SearchSliding WindowPrefix Sum