B

Bloomberg

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

Showing 100 of 100 questions

1
100
ArrayHash Table
2
MediumMerge Intervalsβœ“ Our Solution
86
ArraySorting
3
MediumAdd Two Numbersβœ“ Our Solution
86
Linked ListMathRecursion
4
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
84
Hash TableStringSliding Window
5
EasyValid Parenthesesβœ“ Our Solution
83
StringStack
6
EasyMerge Sorted Arrayβœ“ Our Solution
81
ArrayTwo PointersSorting
7
HardTrapping Rain Waterβœ“ Our Solution
79
ArrayTwo PointersDynamic ProgrammingStack+1
8
79
ArrayTwo PointersSorting
9
HardMedian of Two Sorted Arraysβœ“ Our Solution
77
ArrayBinary SearchDivide and Conquer
10
MediumLongest Palindromic Substringβœ“ Our Solution
77
Two PointersStringDynamic Programming
11
MediumMaximum Subarrayβœ“ Our Solution
75
ArrayDivide and ConquerDynamic Programming
12
EasyRemove Duplicates from Sorted Arrayβœ“ Our Solution
75
ArrayTwo Pointers
13
EasyLongest Common Prefixβœ“ Our Solution
75
StringTrie
14
EasyPalindrome Numberβœ“ Our Solution
75
Math
15
MediumWord Searchβœ“ Our Solution
74
ArrayStringBacktrackingDepth-First Search+1
16
EasyRoman to Integerβœ“ Our Solution
74
Hash TableMathString
17
MediumReverse Integerβœ“ Our Solution
73
Math
18
MediumContainer With Most Waterβœ“ Our Solution
72
ArrayTwo PointersGreedy
19
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
71
ArrayBinary Search
20
MediumSubsetsβœ“ Our Solution
70
ArrayBacktrackingBit Manipulation
21
EasyMerge Two Sorted Listsβœ“ Our Solution
70
Linked ListRecursion
22
MediumNext Permutationβœ“ Our Solution
68
ArrayTwo Pointers
23
MediumValidate Binary Search Treeβœ“ Our Solution
67
TreeDepth-First SearchBinary Search TreeBinary Tree
24
MediumGenerate Parenthesesβœ“ Our Solution
67
StringDynamic ProgrammingBacktracking
25
MediumGroup Anagramsβœ“ Our Solution
67
ArrayHash TableStringSorting
26
MediumRotate Imageβœ“ Our Solution
66
ArrayMathMatrix
27
MediumPow(x, n)βœ“ Our Solution
65
MathRecursion
28
EasyClimbing Stairsβœ“ Our Solution
64
MathDynamic ProgrammingMemoization
29
EasyRemove Elementβœ“ Our Solution
64
ArrayTwo Pointers
30
MediumJump Gameβœ“ Our Solution
62
ArrayDynamic ProgrammingGreedy
31
62
MathBinary Search
32
MediumBinary Tree Level Order Traversalβœ“ Our Solution
61
TreeBreadth-First SearchBinary Tree
33
HardMerge k Sorted Listsβœ“ Our Solution
60
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
34
EasyFind the Index of the First Occurrence in a Stringβœ“ Our Solution
60
Two PointersStringString Matching
35
MediumUnique Pathsβœ“ Our Solution
60
MathDynamic ProgrammingCombinatorics
36
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
60
ArrayBinary Search
37
MediumSpiral Matrixβœ“ Our Solution
58
ArrayMatrixSimulation
38
MediumSet Matrix Zeroesβœ“ Our Solution
57
ArrayHash TableMatrix
39
57
ArrayTwo PointersSorting
40
MediumString to Integer (atoi)βœ“ Our Solution
57
String
41
MediumSwap Nodes in Pairsβœ“ Our Solution
55
Linked ListRecursion
42
Medium3Sum Closestβœ“ Our Solution
55
ArrayTwo PointersSorting
43
EasySearch Insert Positionβœ“ Our Solution
54
ArrayBinary Search
44
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
53
TreeBreadth-First SearchBinary Tree
45
MediumJump Game IIβœ“ Our Solution
53
ArrayDynamic ProgrammingGreedy
46
MediumPermutationsβœ“ Our Solution
53
ArrayBacktracking
47
MediumSearch a 2D Matrixβœ“ Our Solution
53
ArrayBinary SearchMatrix
48
MediumSort Colorsβœ“ Our Solution
53
ArrayTwo PointersSorting
49
MediumConstruct Binary Tree from Preorder and Inorder Traversalβœ“ Our Solution
53
ArrayHash TableDivide and ConquerTree+1
50
MediumCombination Sumβœ“ Our Solution
53
ArrayBacktracking
51
HardReverse Nodes in k-Groupβœ“ Our Solution
52
Linked ListRecursion
52
EasyAdd Binaryβœ“ Our Solution
52
MathStringBit ManipulationSimulation
53
HardRegular Expression Matchingβœ“ Our Solution
52
StringDynamic ProgrammingRecursion
54
EasySame Treeβœ“ Our Solution
51
TreeDepth-First SearchBreadth-First SearchBinary Tree
55
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
51
Hash TableStringBacktracking
56
EasySymmetric Treeβœ“ Our Solution
51
TreeDepth-First SearchBreadth-First SearchBinary Tree
57
MediumZigzag Conversionβœ“ Our Solution
50
String
58
EasyMaximum Depth of Binary Treeβœ“ Our Solution
49
TreeDepth-First SearchBreadth-First SearchBinary Tree
59
MediumValid Sudokuβœ“ Our Solution
49
ArrayHash TableMatrix
60
49
ArrayMath
61
MediumRemove Nth Node From End of Listβœ“ Our Solution
48
Linked ListTwo Pointers
62
HardLargest Rectangle in Histogramβœ“ Our Solution
48
ArrayStackMonotonic Stack
63
EasyRemove Duplicates from Sorted Listβœ“ Our Solution
48
Linked List
64
MediumRotate Listβœ“ Our Solution
48
Linked ListTwo Pointers
65
MediumCombination Sum IIβœ“ Our Solution
46
ArrayBacktracking
66
HardSudoku Solverβœ“ Our Solution
46
ArrayHash TableBacktrackingMatrix
67
HardFirst Missing Positiveβœ“ Our Solution
46
ArrayHash Table
68
MediumRemove Duplicates from Sorted Array IIβœ“ Our Solution
45
ArrayTwo Pointers
69
MediumDivide Two Integersβœ“ Our Solution
45
MathBit Manipulation
70
MediumInteger to Romanβœ“ Our Solution
45
Hash TableMathString
71
MediumUnique Paths IIβœ“ Our Solution
45
ArrayDynamic ProgrammingMatrix
72
EasyLength of Last Wordβœ“ Our Solution
45
String
73
MediumSubsets IIβœ“ Our Solution
44
ArrayBacktrackingBit Manipulation
74
HardWildcard Matchingβœ“ Our Solution
44
StringDynamic ProgrammingGreedyRecursion
75
MediumEdit Distanceβœ“ Our Solution
42
StringDynamic Programming
76
42
ArrayBacktracking
77
MediumReverse Linked List IIβœ“ Our Solution
41
Linked List
78
MediumRemove Duplicates from Sorted List IIβœ“ Our Solution
41
Linked ListTwo Pointers
79
HardLongest Valid Parenthesesβœ“ Our Solution
39
StringDynamic ProgrammingStack
80
MediumSimplify Pathβœ“ Our Solution
39
StringStack
81
MediumInsert Intervalβœ“ Our Solution
39
Array
82
MediumPartition Listβœ“ Our Solution
35
Linked ListTwo Pointers
83
MediumPermutations IIβœ“ Our Solution
35
ArrayBacktrackingSorting
84
MediumMultiply Stringsβœ“ Our Solution
35
MathStringSimulation
85
HardMinimum Window Substringβœ“ Our Solution
35
Hash TableStringSliding Window
86
HardMaximal Rectangleβœ“ Our Solution
33
ArrayDynamic ProgrammingStackMatrix+1
87
EasyBinary Tree Inorder Traversalβœ“ Our Solution
33
StackTreeDepth-First SearchBinary Tree
88
HardText Justificationβœ“ Our Solution
31
ArrayStringSimulation
89
MediumSearch in Rotated Sorted Array IIβœ“ Our Solution
31
ArrayBinary Search
90
MediumCount and Sayβœ“ Our Solution
28
String
91
MediumMinimum Path Sumβœ“ Our Solution
28
ArrayDynamic ProgrammingMatrix
92
MediumRecover Binary Search Treeβœ“ Our Solution
28
TreeDepth-First SearchBinary Search TreeBinary Tree
93
MediumCombinationsβœ“ Our Solution
28
Backtracking
94
HardSubstring with Concatenation of All Wordsβœ“ Our Solution
25
Hash TableStringSliding Window
95
MediumDecode Waysβœ“ Our Solution
25
StringDynamic Programming
96
MediumUnique Binary Search Trees IIβœ“ Our Solution
21
Dynamic ProgrammingBacktrackingTreeBinary Search Tree+1
97
HardN-Queens IIβœ“ Our Solution
21
Backtracking
98
MediumUnique Binary Search Treesβœ“ Our Solution
21
MathDynamic ProgrammingTreeBinary Search Tree+1
99
MediumGray Codeβœ“ Our Solution
16
MathBacktrackingBit Manipulation
100
MediumSpiral Matrix IIβœ“ Our Solution
10
ArrayMatrixSimulation