P

Pinterest

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

Showing 49 of 49 questions

1
MediumCount and Sayβœ“ Our Solution
100
String
2
HardReconstruct Itineraryβœ“ Our Solution
95
Depth-First SearchGraphEulerian Circuit
3
HardShortest Path in a Grid with Obstacles Eliminationβœ“ Our Solution
93
ArrayBreadth-First SearchMatrix
4
HardOptimal Account Balancing
92
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
5
HardCount Subarrays With Score Less Than Kβœ“ Our Solution
91
ArrayBinary SearchSliding WindowPrefix Sum
6
HardMaximum Profit in Job Schedulingβœ“ Our Solution
90
ArrayBinary SearchDynamic ProgrammingSorting
7
HardBus Routesβœ“ Our Solution
86
ArrayHash TableBreadth-First Search
8
HardExpression Add Operatorsβœ“ Our Solution
85
MathStringBacktracking
9
HardFind Median from Data Streamβœ“ Our Solution
79
Two PointersDesignSortingHeap (Priority Queue)+1
10
MediumShortest Way to Form String
77
Two PointersStringBinary SearchGreedy
11
EasyIs Subsequenceβœ“ Our Solution
74
Two PointersStringDynamic Programming
12
MediumReorganize Stringβœ“ Our Solution
73
Hash TableStringGreedySorting+2
13
MediumLongest Word in Dictionaryβœ“ Our Solution
70
ArrayHash TableStringTrie+1
14
HardDesign Search Autocomplete System
70
StringDepth-First SearchDesignTrie+3
15
HardFind Median Given Frequency of Numbers
66
Database
16
MediumJump Game IIIβœ“ Our Solution
64
ArrayDepth-First SearchBreadth-First Search
17
HardFind K-th Smallest Pair Distanceβœ“ Our Solution
62
ArrayTwo PointersBinary SearchSorting
18
MediumCoin Changeβœ“ Our Solution
62
ArrayDynamic ProgrammingBreadth-First Search
19
MediumString Compressionβœ“ Our Solution
59
Two PointersString
20
MediumSparse Matrix Multiplication
59
ArrayHash TableMatrix
21
HardMeeting Rooms IIIβœ“ Our Solution
59
ArrayHash TableSortingHeap (Priority Queue)+1
22
MediumTarget Sumβœ“ Our Solution
56
ArrayDynamic ProgrammingBacktracking
23
MediumUnique Paths IIβœ“ Our Solution
56
ArrayDynamic ProgrammingMatrix
24
MediumMinimize Result by Adding Parentheses to Expressionβœ“ Our Solution
53
StringEnumeration
25
MediumThe Number of Weak Characters in the Gameβœ“ Our Solution
48
ArrayStackGreedySorting+1
26
MediumIs Graph Bipartite?βœ“ Our Solution
48
Depth-First SearchBreadth-First SearchUnion FindGraph
27
HardEmployee Free Time
48
ArrayLine SweepSortingHeap (Priority Queue)
28
HardUnique Paths IIIβœ“ Our Solution
48
ArrayBacktrackingBit ManipulationMatrix
29
MediumTop K Frequent Elementsβœ“ Our Solution
43
ArrayHash TableDivide and ConquerSorting+4
30
MediumAccounts Mergeβœ“ Our Solution
43
ArrayHash TableStringDepth-First Search+3
31
MediumCombination Sumβœ“ Our Solution
43
ArrayBacktracking
32
HardSplit Array Largest Sumβœ“ Our Solution
43
ArrayBinary SearchDynamic ProgrammingGreedy+1
33
MediumMultiply Stringsβœ“ Our Solution
43
MathStringSimulation
34
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
43
Hash TableStringBacktracking
35
MediumPossible Bipartitionβœ“ Our Solution
43
Depth-First SearchBreadth-First SearchUnion FindGraph
36
MediumSingle Element in a Sorted Arrayβœ“ Our Solution
43
ArrayBinary Search
37
MediumMeeting Rooms II
43
ArrayTwo PointersGreedySorting+2
38
MediumSnakes and Laddersβœ“ Our Solution
35
ArrayBreadth-First SearchMatrix
39
MediumThe Maze
35
ArrayDepth-First SearchBreadth-First SearchMatrix
40
MediumFind the Celebrity
35
Two PointersGraphInteractive
41
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
35
ArrayBinary Search
42
HardShortest Path to Get All Keysβœ“ Our Solution
35
ArrayBit ManipulationBreadth-First SearchMatrix
43
MediumNumber of Islandsβœ“ Our Solution
35
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
44
MediumCandy Crush
35
ArrayTwo PointersMatrixSimulation
45
MediumDot Product of Two Sparse Vectors
35
ArrayHash TableTwo PointersDesign
46
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
35
Hash TableStringDesignTrie
47
HardSudoku Solverβœ“ Our Solution
35
ArrayHash TableBacktrackingMatrix
48
HardFind Minimum Time to Finish All Jobsβœ“ Our Solution
35
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
49
HardSmallest Range Covering Elements from K Listsβœ“ Our Solution
35
ArrayHash TableGreedySliding Window+2