S
Salesforce
100 questions tracked94 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
1ArrayHash TableStringDynamic Programming+2
2ArrayBinary SearchSliding WindowPrefix Sum
4Hash TableLinked ListDesignDoubly-Linked List
5StringDynamic Programming
7Hash TableLinked ListDesignDoubly-Linked List
8ArrayHash TableStringSorting
9ArrayDepth-First SearchBreadth-First SearchUnion Find+1
10Hash TableStringSliding Window
11Hash TableStackDesignOrdered Set
12ArrayTwo PointersBinary SearchSorting
13Two PointersStringDynamic Programming
14Linked ListStringStackDesign+2
15ArraySortingCounting Sort
16EasyCheck If a Number Is Majority Element in a Sorted Array
ArrayBinary Search
17ArrayStackMonotonic Stack
18ArrayStackMonotonic Stack
19Depth-First SearchBreadth-First SearchGraphTopological Sort
21ArrayBinary SearchDynamic ProgrammingGreedy+1
24ArrayTwo PointersDynamic ProgrammingStack+1
25ArrayDivide and ConquerSortingHeap (Priority Queue)+1
26ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
27Dynamic ProgrammingTreeDepth-First SearchBinary Tree
33ArrayDynamic ProgrammingBreadth-First Search
34MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
35ArrayHash TableGreedySorting+2
36Two PointersStringDynamic Programming
37Hash TableStringSliding Window
38StringDynamic Programming
39TreeDepth-First SearchBinary Search TreeBinary Tree
40ArrayHash TableDivide and ConquerSorting+4
41StringDynamic Programming
43ArrayDynamic ProgrammingMatrix
44ArrayGreedySortingHeap (Priority Queue)
45ArrayTwo PointersGreedySorting
48Two PointersStringDynamic Programming
49ArrayTwo PointersBinary SearchDynamic Programming+3
55ArrayDynamic ProgrammingGreedy
56ArrayStackMonotonic Stack
57ArrayDepth-First SearchBreadth-First SearchUnion Find+1
58Linked ListTreeDepth-First SearchBreadth-First Search+1
61Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
63ArrayBreadth-First SearchMatrix
64Hash TableTreeDepth-First SearchBreadth-First Search+1
65HardDesign In-Memory File System
Hash TableStringDesignTrie+1
67Two PointersDesignSortingHeap (Priority Queue)+1
68TreeDepth-First SearchBinary Tree
71ArrayBinary SearchSortingHeap (Priority Queue)+1
72ArrayHash TableDivide and ConquerTree+1
74MediumGraph Valid Tree
Depth-First SearchBreadth-First SearchUnion FindGraph
75StringTreeDepth-First SearchBreadth-First Search+2
76StringDynamic ProgrammingGreedyRecursion
77MediumRange Addition
ArrayPrefix Sum
80ArrayBacktrackingBit Manipulation
81ArrayDynamic ProgrammingMatrix
82ArrayDynamic ProgrammingGreedy
85Linked ListStackTreeDepth-First Search+1
86ArrayHash TableStringBinary Search+3
88ArrayHash TableMathDesign+1
89ArrayHash TableDivide and ConquerSorting+1
92ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
93ArrayHash TableSortingCounting
94MathStringDynamic ProgrammingRecursion+1
96MediumWalls and Gates
ArrayBreadth-First SearchMatrix
98ArrayMathDynamic ProgrammingRecursion+1
99StringDynamic ProgrammingStack
100ArrayMathEnumerationNumber Theory