X

X

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

Showing 52 of 52 questions

1
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
100
ArrayHash TableMathDesign+1
2
MediumFlatten Nested List Iteratorβœ“ Our Solution
96
StackTreeDepth-First SearchDesign+2
3
HardTrapping Rain Waterβœ“ Our Solution
96
ArrayTwo PointersDynamic ProgrammingStack+1
4
MediumDesign Twitterβœ“ Our Solution
94
Hash TableLinked ListDesignHeap (Priority Queue)
5
MediumTweet Counts Per Frequencyβœ“ Our Solution
94
Hash TableBinary SearchDesignSorting+1
6
MediumMerge Intervalsβœ“ Our Solution
94
ArraySorting
7
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
94
Hash TableStringDesignTrie
8
HardBest Meeting Point
92
ArrayMathSortingMatrix
9
MediumLRU Cacheβœ“ Our Solution
92
Hash TableLinked ListDesignDoubly-Linked List
10
MediumInvestments in 2016βœ“ Our Solution
92
Database
11
EasyCustomer Placing the Largest Number of Ordersβœ“ Our Solution
89
Database
12
MediumMinimum Genetic Mutationβœ“ Our Solution
89
Hash TableStringBreadth-First Search
13
MediumMinimum Number of Steps to Make Two Strings Anagramβœ“ Our Solution
89
Hash TableStringCounting
14
MediumValidate IP Addressβœ“ Our Solution
89
String
15
MediumCount Student Number in Departments
89
Database
16
MediumRectangles Area
89
Database
17
EasyInvalid Tweetsβœ“ Our Solution
89
Database
18
MediumTree Nodeβœ“ Our Solution
89
Database
19
MediumNumber of Black Blocksβœ“ Our Solution
89
ArrayHash TableEnumeration
20
MediumMasking Personal Informationβœ“ Our Solution
89
String
21
MediumDesign Authentication Managerβœ“ Our Solution
89
Hash TableLinked ListDesignDoubly-Linked List
22
MediumMinimum Elements to Add to Form a Given Sumβœ“ Our Solution
89
ArrayGreedy
23
EasyBinary Gapβœ“ Our Solution
89
Bit Manipulation
24
MediumFinding the Users Active Minutesβœ“ Our Solution
89
ArrayHash Table
25
MediumProcess Tasks Using Serversβœ“ Our Solution
89
ArrayHeap (Priority Queue)
26
MediumRemove All Occurrences of a Substringβœ“ Our Solution
89
StringStackSimulation
27
MediumCount Sub Islandsβœ“ Our Solution
89
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
28
HardTrapping Rain Water IIβœ“ Our Solution
89
ArrayBreadth-First SearchHeap (Priority Queue)Matrix
29
HardRegular Expression Matchingβœ“ Our Solution
89
StringDynamic ProgrammingRecursion
30
MediumKth Smallest Element in a Sorted Matrixβœ“ Our Solution
89
ArrayBinary SearchSortingHeap (Priority Queue)+1
31
MediumInteger to Romanβœ“ Our Solution
89
Hash TableMathString
32
EasyValid Parenthesesβœ“ Our Solution
89
StringStack
33
HardMerge k Sorted Listsβœ“ Our Solution
89
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
34
MediumMultiply Stringsβœ“ Our Solution
89
MathStringSimulation
35
HardWildcard Matchingβœ“ Our Solution
89
StringDynamic ProgrammingGreedyRecursion
36
HardPermutation Sequenceβœ“ Our Solution
89
MathRecursion
37
EasyPascal's Triangleβœ“ Our Solution
89
ArrayDynamic Programming
38
HardWord Break IIβœ“ Our Solution
89
ArrayHash TableStringDynamic Programming+3
39
EasyTime Needed to Buy Ticketsβœ“ Our Solution
89
ArrayQueueSimulation
40
HardMax Points on a Lineβœ“ Our Solution
89
ArrayHash TableMathGeometry
41
MediumOne Edit Distance
89
Two PointersString
42
EasyHappy Numberβœ“ Our Solution
89
Hash TableMathTwo Pointers
43
EasyReverse Linked Listβœ“ Our Solution
89
Linked ListRecursion
44
HardThe Skyline Problemβœ“ Our Solution
89
ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
45
MediumLowest Common Ancestor of a Binary Search Treeβœ“ Our Solution
89
TreeDepth-First SearchBinary Search TreeBinary Tree
46
MediumFlatten 2D Vector
89
ArrayTwo PointersDesignIterator
47
HardAlien Dictionary
89
ArrayStringDepth-First SearchBreadth-First Search+2
48
HardDesign Skiplistβœ“ Our Solution
89
Linked ListDesign
49
MediumNumber of Connected Components in an Undirected Graph
89
Depth-First SearchBreadth-First SearchUnion FindGraph
50
MediumRandom Pick with Weightβœ“ Our Solution
48
ArrayMathBinary SearchPrefix Sum+1
51
MediumNumber of Islandsβœ“ Our Solution
48
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
52
MediumRotting Orangesβœ“ Our Solution
48
ArrayBreadth-First SearchMatrix