S

Salesforce

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

Showing 100 of 100 questions

1
MediumWord Breakβœ“ Our Solution
94
ArrayHash TableStringDynamic Programming+2
2
MediumSubarray Product Less Than Kβœ“ Our Solution
87
ArrayBinary SearchSliding WindowPrefix Sum
3
MediumString Compressionβœ“ Our Solution
85
Two PointersString
4
HardLFU Cacheβœ“ Our Solution
80
Hash TableLinked ListDesignDoubly-Linked List
5
HardDistinct Subsequencesβœ“ Our Solution
80
StringDynamic Programming
6
MediumMerge Intervalsβœ“ Our Solution
80
ArraySorting
7
MediumLRU Cacheβœ“ Our Solution
79
Hash TableLinked ListDesignDoubly-Linked List
8
MediumGroup Anagramsβœ“ Our Solution
75
ArrayHash TableStringSorting
9
MediumNumber of Islandsβœ“ Our Solution
75
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
10
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
73
Hash TableStringSliding Window
11
HardMaximum Frequency Stackβœ“ Our Solution
73
Hash TableStackDesignOrdered Set
12
MediumCount the Number of Fair Pairsβœ“ Our Solution
73
ArrayTwo PointersBinary SearchSorting
13
MediumPalindromic Substringsβœ“ Our Solution
73
Two PointersStringDynamic Programming
14
HardDesign a Text Editorβœ“ Our Solution
73
Linked ListStringStackDesign+2
15
EasyHeight Checkerβœ“ Our Solution
73
ArraySortingCounting Sort
16
EasyCheck If a Number Is Majority Element in a Sorted Array
71
ArrayBinary Search
17
MediumBeautiful Towers Iβœ“ Our Solution
71
ArrayStackMonotonic Stack
18
MediumBeautiful Towers IIβœ“ Our Solution
71
ArrayStackMonotonic Stack
19
MediumCourse Schedule IIβœ“ Our Solution
71
Depth-First SearchBreadth-First SearchGraphTopological Sort
20
EasyCheck Whether Two Strings are Almost Equivalentβœ“ Our Solution
71
Hash TableStringCounting
21
HardSplit Array Largest Sumβœ“ Our Solution
68
ArrayBinary SearchDynamic ProgrammingGreedy+1
22
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
68
ArrayDynamic Programming
23
EasyValid Parenthesesβœ“ Our Solution
68
StringStack
24
HardTrapping Rain Waterβœ“ Our Solution
68
ArrayTwo PointersDynamic ProgrammingStack+1
25
MediumKth Largest Element in an Arrayβœ“ Our Solution
66
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
26
MediumBeautiful Arrangementβœ“ Our Solution
66
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
27
HardBinary Tree Maximum Path Sumβœ“ Our Solution
66
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
28
EasyMaximum Product of Three Numbersβœ“ Our Solution
62
ArrayMathSorting
29
MediumInteger to Romanβœ“ Our Solution
62
Hash TableMathString
30
MediumAsteroid Collisionβœ“ Our Solution
62
ArrayStackSimulation
31
MediumLargest Numberβœ“ Our Solution
62
ArrayStringGreedySorting
32
59
ArrayTwo PointersSorting
33
MediumCoin Changeβœ“ Our Solution
59
ArrayDynamic ProgrammingBreadth-First Search
34
MediumMeeting Rooms II
59
ArrayTwo PointersGreedySorting+2
35
MediumTask Schedulerβœ“ Our Solution
59
ArrayHash TableGreedySorting+2
36
MediumLongest Palindromic Substringβœ“ Our Solution
59
Two PointersStringDynamic Programming
37
HardMinimum Window Substringβœ“ Our Solution
59
Hash TableStringSliding Window
38
HardCount Palindromic Subsequencesβœ“ Our Solution
59
StringDynamic Programming
39
MediumValidate Binary Search Treeβœ“ Our Solution
54
TreeDepth-First SearchBinary Search TreeBinary Tree
40
MediumTop K Frequent Elementsβœ“ Our Solution
54
ArrayHash TableDivide and ConquerSorting+4
41
MediumDecode Waysβœ“ Our Solution
54
StringDynamic Programming
42
MediumMin Stackβœ“ Our Solution
54
StackDesign
43
MediumMaximal Squareβœ“ Our Solution
54
ArrayDynamic ProgrammingMatrix
44
49
ArrayGreedySortingHeap (Priority Queue)
45
MediumMaximize Greatness of an Arrayβœ“ Our Solution
49
ArrayTwo PointersGreedySorting
46
MediumProduct of Array Except Selfβœ“ Our Solution
49
ArrayPrefix Sum
47
MediumReconstruct Original Digits from Englishβœ“ Our Solution
49
Hash TableMathString
48
EasyIs Subsequenceβœ“ Our Solution
49
Two PointersStringDynamic Programming
49
HardPartition Array Into Two Arrays to Minimize Sum Differenceβœ“ Our Solution
49
ArrayTwo PointersBinary SearchDynamic Programming+3
50
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
49
ArrayBinary Search
51
EasyCount Binary Substringsβœ“ Our Solution
49
Two PointersString
52
MediumDecode Stringβœ“ Our Solution
49
StringStackRecursion
53
EasyDegree of an Arrayβœ“ Our Solution
49
ArrayHash Table
54
MediumCombination Sumβœ“ Our Solution
49
ArrayBacktracking
55
MediumJump Gameβœ“ Our Solution
49
ArrayDynamic ProgrammingGreedy
56
MediumDaily Temperaturesβœ“ Our Solution
49
ArrayStackMonotonic Stack
57
MediumMax Area of Islandβœ“ Our Solution
49
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
58
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
49
Linked ListTreeDepth-First SearchBreadth-First Search+1
59
MediumCapacity To Ship Packages Within D Daysβœ“ Our Solution
49
ArrayBinary Search
60
MediumContainer With Most Waterβœ“ Our Solution
49
ArrayTwo PointersGreedy
61
HardMerge k Sorted Listsβœ“ Our Solution
42
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
62
EasyRoman to Integerβœ“ Our Solution
42
Hash TableMathString
63
MediumRotting Orangesβœ“ Our Solution
42
ArrayBreadth-First SearchMatrix
64
MediumSmallest Subtree with all the Deepest Nodesβœ“ Our Solution
42
Hash TableTreeDepth-First SearchBreadth-First Search+1
65
HardDesign In-Memory File System
42
Hash TableStringDesignTrie+1
66
MediumPow(x, n)βœ“ Our Solution
42
MathRecursion
67
HardFind Median from Data Streamβœ“ Our Solution
42
Two PointersDesignSortingHeap (Priority Queue)+1
68
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
42
TreeDepth-First SearchBinary Tree
69
EasyMove Zeroesβœ“ Our Solution
42
ArrayTwo Pointers
70
MediumHouse Robberβœ“ Our Solution
42
ArrayDynamic Programming
71
MediumKth Smallest Element in a Sorted Matrixβœ“ Our Solution
42
ArrayBinary SearchSortingHeap (Priority Queue)+1
72
MediumConstruct Binary Tree from Preorder and Inorder Traversalβœ“ Our Solution
42
ArrayHash TableDivide and ConquerTree+1
73
EasyMaximum Difference Between Increasing Elementsβœ“ Our Solution
42
Array
74
MediumGraph Valid Tree
42
Depth-First SearchBreadth-First SearchUnion FindGraph
75
HardSerialize and Deserialize Binary Treeβœ“ Our Solution
42
StringTreeDepth-First SearchBreadth-First Search+2
76
HardWildcard Matchingβœ“ Our Solution
42
StringDynamic ProgrammingGreedyRecursion
77
MediumRange Addition
42
ArrayPrefix Sum
78
HardFirst Missing Positiveβœ“ Our Solution
42
ArrayHash Table
79
MediumSort Colorsβœ“ Our Solution
33
ArrayTwo PointersSorting
80
MediumSubsetsβœ“ Our Solution
33
ArrayBacktrackingBit Manipulation
81
MediumMinimum Path Sumβœ“ Our Solution
33
ArrayDynamic ProgrammingMatrix
82
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
33
ArrayDynamic ProgrammingGreedy
83
MediumPairs of Songs With Total Durations Divisible by 60βœ“ Our Solution
33
ArrayHash TableCounting
84
HardStream of Charactersβœ“ Our Solution
33
ArrayStringDesignTrie+1
85
MediumFlatten Binary Tree to Linked Listβœ“ Our Solution
33
Linked ListStackTreeDepth-First Search+1
86
MediumNumber of Matching Subsequencesβœ“ Our Solution
33
ArrayHash TableStringBinary Search+3
87
MediumTriangleβœ“ Our Solution
33
ArrayDynamic Programming
88
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
33
ArrayHash TableMathDesign+1
89
EasyMajority Elementβœ“ Our Solution
33
ArrayHash TableDivide and ConquerSorting+1
90
EasyIsomorphic Stringsβœ“ Our Solution
33
Hash TableString
91
Medium2 Keys Keyboardβœ“ Our Solution
33
MathDynamic Programming
92
HardThe Skyline Problemβœ“ Our Solution
33
ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
93
MediumMajority Element IIβœ“ Our Solution
33
ArrayHash TableSortingCounting
94
MediumDifferent Ways to Add Parenthesesβœ“ Our Solution
33
MathStringDynamic ProgrammingRecursion+1
95
EasyReverse Words in a String IIIβœ“ Our Solution
33
Two PointersString
96
MediumWalls and Gates
33
ArrayBreadth-First SearchMatrix
97
33
ArrayBacktracking
98
MediumPredict the Winnerβœ“ Our Solution
33
ArrayMathDynamic ProgrammingRecursion+1
99
HardLongest Valid Parenthesesβœ“ Our Solution
33
StringDynamic ProgrammingStack
100
MediumCount Primesβœ“ Our Solution
33
ArrayMathEnumerationNumber Theory