S
Snowflake
90 questions tracked78 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 90 of 90 questions
1HardDesign In-Memory File System
Hash TableStringDesignTrie+1
2Hash TableMathTwo Pointers
3Hash TableStringSliding Window
4Depth-First SearchBreadth-First SearchGraphTopological Sort
5Hash TableStringSliding Window
6ArrayStringBacktrackingTrie+1
7MathStringDynamic ProgrammingString Matching
8MediumStep-By-Step Directions From a Binary Tree Node to Anotherβ Our Solution StringTreeDepth-First SearchBinary Tree
10MediumMaximum Number of Upgradable Servers
ArrayMathBinary Search
11ArrayTwo PointersDynamic ProgrammingStack+1
12ArrayBinary SearchDynamic ProgrammingSorting
14ArrayHash TableTwo PointersBinary Search+2
15ArrayStringDynamic Programming
16ArrayHash TableDynamic Programming
17ArrayDynamic ProgrammingGraphTopological Sort
18ArrayHash TableDynamic Programming
20StringDynamic ProgrammingRecursion
21Hash TableTreeDepth-First SearchDesign
23MediumBoundary of Binary Tree
TreeDepth-First SearchBinary Tree
24MediumDesign Hit Counter
ArrayBinary SearchDesignQueue+1
26Hash TableStringBinary SearchDesign
28Linked ListTreeDepth-First SearchBreadth-First Search+1
30ArrayDepth-First SearchBreadth-First SearchUnion Find+1
31Linked ListTreeDepth-First SearchBreadth-First Search+1
33MediumEncode and Decode Strings
ArrayStringDesign
34ArrayHash TableGreedySorting+2
35Depth-First SearchBreadth-First SearchGraphTopological Sort
36ArrayHash TableLinked ListDesign+1
37ArrayHash TableSliding WindowHeap (Priority Queue)
38Hash TableLinked ListDesignDoubly-Linked List
39Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
45MediumGraph Valid Tree
Depth-First SearchBreadth-First SearchUnion FindGraph
46ArrayQueueSliding WindowMonotonic Queue
47ArrayMathBinary SearchPrefix Sum+1
48Hash TableStringDesignTrie
49TreeDepth-First SearchBinary Tree
53MediumMaximum Profit From Trading Stocks
ArrayDynamic Programming
54Two PointersDesignSortingHeap (Priority Queue)+1
55ArrayStringDepth-First SearchTrie
56ArrayHash TableMathDesign+1
57HardMinimum Operations to Make Numbers Non-positive
ArrayBinary Search
59Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraph+2
60StringStackGreedyMonotonic Stack
61TreeDepth-First SearchBinary Tree
62MediumWalls and Gates
ArrayBreadth-First SearchMatrix
65MediumParallel Courses
GraphTopological Sort
69ArrayHash TableDivide and ConquerSorting+4
70ArrayGreedySortingHeap (Priority Queue)
71ArrayBinary SearchDepth-First SearchBreadth-First Search+3
72StringDepth-First SearchDesignTrie
73ArrayDepth-First SearchBreadth-First SearchUnion Find+1
74ArrayDynamic ProgrammingGreedySorting
75ArrayTwo PointersStringBinary Search
76EasyValid Word Abbreviation
Two PointersString
77ArrayHash TableBinary SearchDesign
78ArrayTreeDepth-First SearchBreadth-First Search+1
79Hash TableStringSliding Window
80ArrayHash TableDivide and ConquerTree+1
81ArrayHash TableStringDynamic Programming+2
82TreeDepth-First SearchBinary Tree
83StringBacktrackingBreadth-First Search
84ArrayStringDepth-First SearchBreadth-First Search+3
85ArrayDesignMatrixPrefix Sum
86MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
87ArrayDynamic ProgrammingMatrix
88ArrayDepth-First SearchBreadth-First SearchUnion Find+1