S

Snowflake

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

Showing 90 of 90 questions

1
HardDesign In-Memory File System
100
Hash TableStringDesignTrie+1
2
EasyHappy Numberβœ“ Our Solution
94
Hash TableMathTwo Pointers
3
HardMinimum Window Substringβœ“ Our Solution
92
Hash TableStringSliding Window
4
MediumCourse Schedule IIβœ“ Our Solution
92
Depth-First SearchBreadth-First SearchGraphTopological Sort
5
MediumFind All Anagrams in a Stringβœ“ Our Solution
90
Hash TableStringSliding Window
6
HardWord Search IIβœ“ Our Solution
90
ArrayStringBacktrackingTrie+1
7
HardString Transformationβœ“ Our Solution
89
MathStringDynamic ProgrammingString Matching
8
MediumStep-By-Step Directions From a Binary Tree Node to Anotherβœ“ Our Solution
83
StringTreeDepth-First SearchBinary Tree
9
EasyCalculate Amount Paid in Taxesβœ“ Our Solution
83
ArraySimulation
10
MediumMaximum Number of Upgradable Servers
82
ArrayMathBinary Search
11
HardTrapping Rain Waterβœ“ Our Solution
80
ArrayTwo PointersDynamic ProgrammingStack+1
12
HardMaximum Profit in Job Schedulingβœ“ Our Solution
80
ArrayBinary SearchDynamic ProgrammingSorting
13
HardPainting the Wallsβœ“ Our Solution
80
ArrayDynamic Programming
14
MediumMinimum Array Length After Pair Removalsβœ“ Our Solution
78
ArrayHash TableTwo PointersBinary Search+2
15
HardNumber of Ways to Form a Target String Given a Dictionaryβœ“ Our Solution
78
ArrayStringDynamic Programming
16
MediumFind the Maximum Length of a Good Subsequence Iβœ“ Our Solution
78
ArrayHash TableDynamic Programming
17
HardParallel Courses IIIβœ“ Our Solution
78
ArrayDynamic ProgrammingGraphTopological Sort
18
HardFind the Maximum Length of a Good Subsequence IIβœ“ Our Solution
76
ArrayHash TableDynamic Programming
19
HardBasic Calculatorβœ“ Our Solution
73
MathStringStackRecursion
20
HardRegular Expression Matchingβœ“ Our Solution
68
StringDynamic ProgrammingRecursion
21
MediumThrone Inheritanceβœ“ Our Solution
68
Hash TableTreeDepth-First SearchDesign
22
EasyCount Vowel Substrings of a Stringβœ“ Our Solution
68
Hash TableString
23
MediumBoundary of Binary Tree
68
TreeDepth-First SearchBinary Tree
24
MediumDesign Hit Counter
64
ArrayBinary SearchDesignQueue+1
25
HardReverse Nodes in k-Groupβœ“ Our Solution
64
Linked ListRecursion
26
MediumTime Based Key-Value Storeβœ“ Our Solution
64
Hash TableStringBinary SearchDesign
27
64
ArrayHash Table
28
MediumPopulating Next Right Pointers in Each Node IIβœ“ Our Solution
64
Linked ListTreeDepth-First SearchBreadth-First Search+1
29
EasyMerge Two Sorted Listsβœ“ Our Solution
60
Linked ListRecursion
30
MediumMax Area of Islandβœ“ Our Solution
60
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
31
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
60
Linked ListTreeDepth-First SearchBreadth-First Search+1
32
MediumCopy List with Random Pointerβœ“ Our Solution
60
Hash TableLinked List
33
MediumEncode and Decode Strings
60
ArrayStringDesign
34
MediumTask Schedulerβœ“ Our Solution
60
ArrayHash TableGreedySorting+2
35
MediumCourse Scheduleβœ“ Our Solution
60
Depth-First SearchBreadth-First SearchGraphTopological Sort
36
EasyDesign HashMapβœ“ Our Solution
60
ArrayHash TableLinked ListDesign+1
37
HardSliding Window Medianβœ“ Our Solution
55
ArrayHash TableSliding WindowHeap (Priority Queue)
38
MediumLRU Cacheβœ“ Our Solution
55
Hash TableLinked ListDesignDoubly-Linked List
39
HardMerge k Sorted Listsβœ“ Our Solution
55
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
40
MediumMin Stackβœ“ Our Solution
55
StackDesign
41
MediumBasic Calculator IIβœ“ Our Solution
55
MathStringStack
42
MediumSwap Nodes in Pairsβœ“ Our Solution
55
Linked ListRecursion
43
HardInteger to English Wordsβœ“ Our Solution
55
MathStringRecursion
44
HardPatching Arrayβœ“ Our Solution
55
ArrayGreedy
45
MediumGraph Valid Tree
55
Depth-First SearchBreadth-First SearchUnion FindGraph
46
HardCount Subarrays With Fixed Boundsβœ“ Our Solution
49
ArrayQueueSliding WindowMonotonic Queue
47
MediumRandom Pick with Weightβœ“ Our Solution
49
ArrayMathBinary SearchPrefix Sum+1
48
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
49
Hash TableStringDesignTrie
49
MediumLongest Univalue Pathβœ“ Our Solution
49
TreeDepth-First SearchBinary Tree
50
MediumMaximize Distance to Closest Personβœ“ Our Solution
49
Array
51
HardN-Queens IIβœ“ Our Solution
49
Backtracking
52
MediumMerge Intervalsβœ“ Our Solution
49
ArraySorting
53
MediumMaximum Profit From Trading Stocks
49
ArrayDynamic Programming
54
HardFind Median from Data Streamβœ“ Our Solution
49
Two PointersDesignSortingHeap (Priority Queue)+1
55
MediumRemove Sub-Folders from the Filesystemβœ“ Our Solution
49
ArrayStringDepth-First SearchTrie
56
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
49
ArrayHash TableMathDesign+1
57
HardMinimum Operations to Make Numbers Non-positive
49
ArrayBinary Search
58
MediumContainer With Most Waterβœ“ Our Solution
49
ArrayTwo PointersGreedy
59
MediumCheapest Flights Within K Stopsβœ“ Our Solution
49
Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraph+2
60
MediumRemove K Digitsβœ“ Our Solution
49
StringStackGreedyMonotonic Stack
61
MediumCount Nodes Equal to Average of Subtreeβœ“ Our Solution
49
TreeDepth-First SearchBinary Tree
62
MediumWalls and Gates
40
ArrayBreadth-First SearchMatrix
63
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
40
ArrayDynamic Programming
64
MediumSimplify Pathβœ“ Our Solution
40
StringStack
65
MediumParallel Courses
40
GraphTopological Sort
66
40
ArrayBacktracking
67
MediumSingle Element in a Sorted Arrayβœ“ Our Solution
40
ArrayBinary Search
68
EasyRoman to Integerβœ“ Our Solution
40
Hash TableMathString
69
MediumTop K Frequent Elementsβœ“ Our Solution
40
ArrayHash TableDivide and ConquerSorting+4
70
MediumMaximum Number of Events That Can Be Attendedβœ“ Our Solution
40
ArrayGreedySortingHeap (Priority Queue)
71
MediumPath With Minimum Effortβœ“ Our Solution
40
ArrayBinary SearchDepth-First SearchBreadth-First Search+3
72
MediumDesign Add and Search Words Data Structureβœ“ Our Solution
40
StringDepth-First SearchDesignTrie
73
HardMaking A Large Islandβœ“ Our Solution
40
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
74
MediumNon-overlapping Intervalsβœ“ Our Solution
40
ArrayDynamic ProgrammingGreedySorting
75
MediumMaximum Number of Removable Charactersβœ“ Our Solution
40
ArrayTwo PointersStringBinary Search
76
EasyValid Word Abbreviation
40
Two PointersString
77
MediumSnapshot Arrayβœ“ Our Solution
40
ArrayHash TableBinary SearchDesign
78
MediumMost Profitable Path in a Treeβœ“ Our Solution
40
ArrayTreeDepth-First SearchBreadth-First Search+1
79
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
40
Hash TableStringSliding Window
80
MediumConstruct Binary Tree from Preorder and Inorder Traversalβœ“ Our Solution
40
ArrayHash TableDivide and ConquerTree+1
81
MediumWord Breakβœ“ Our Solution
40
ArrayHash TableStringDynamic Programming+2
82
EasyLeaf-Similar Treesβœ“ Our Solution
40
TreeDepth-First SearchBinary Tree
83
HardRemove Invalid Parenthesesβœ“ Our Solution
40
StringBacktrackingBreadth-First Search
84
MediumEvaluate Divisionβœ“ Our Solution
40
ArrayStringDepth-First SearchBreadth-First Search+3
85
MediumRange Sum Query 2D - Immutableβœ“ Our Solution
40
ArrayDesignMatrixPrefix Sum
86
MediumMeeting Rooms II
40
ArrayTwo PointersGreedySorting+2
87
HardCherry Pickupβœ“ Our Solution
40
ArrayDynamic ProgrammingMatrix
88
MediumNumber of Islandsβœ“ Our Solution
40
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
89
MediumSwapping Nodes in a Linked Listβœ“ Our Solution
40
Linked ListTwo Pointers
90
EasyReverse Only Lettersβœ“ Our Solution
40
Two PointersString