B
Bloomberg
100 questions tracked100 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
4Hash TableStringSliding Window
7ArrayTwo PointersDynamic ProgrammingStack+1
9ArrayBinary SearchDivide and Conquer
10Two PointersStringDynamic Programming
11ArrayDivide and ConquerDynamic Programming
15ArrayStringBacktrackingDepth-First Search+1
20ArrayBacktrackingBit Manipulation
23TreeDepth-First SearchBinary Search TreeBinary Tree
24StringDynamic ProgrammingBacktracking
25ArrayHash TableStringSorting
28MathDynamic ProgrammingMemoization
30ArrayDynamic ProgrammingGreedy
32TreeBreadth-First SearchBinary Tree
33Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
34Two PointersStringString Matching
35MathDynamic ProgrammingCombinatorics
44TreeBreadth-First SearchBinary Tree
45ArrayDynamic ProgrammingGreedy
49ArrayHash TableDivide and ConquerTree+1
52MathStringBit ManipulationSimulation
53StringDynamic ProgrammingRecursion
54TreeDepth-First SearchBreadth-First SearchBinary Tree
55Hash TableStringBacktracking
56TreeDepth-First SearchBreadth-First SearchBinary Tree
58TreeDepth-First SearchBreadth-First SearchBinary Tree
62ArrayStackMonotonic Stack
66ArrayHash TableBacktrackingMatrix
71ArrayDynamic ProgrammingMatrix
73ArrayBacktrackingBit Manipulation
74StringDynamic ProgrammingGreedyRecursion
75StringDynamic Programming
79StringDynamic ProgrammingStack
85Hash TableStringSliding Window
86ArrayDynamic ProgrammingStackMatrix+1
87StackTreeDepth-First SearchBinary Tree
91ArrayDynamic ProgrammingMatrix
92TreeDepth-First SearchBinary Search TreeBinary Tree
94Hash TableStringSliding Window
95StringDynamic Programming
96Dynamic ProgrammingBacktrackingTreeBinary Search Tree+1
98MathDynamic ProgrammingTreeBinary Search Tree+1
99MathBacktrackingBit Manipulation