M
Microsoft
100 questions tracked100 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
3Hash TableStringSliding Window
5Two PointersStringDynamic Programming
6ArrayTwo PointersDynamic ProgrammingStack+1
9ArrayBinary SearchDivide and Conquer
10ArrayDivide and ConquerDynamic Programming
12ArrayHash TableStringSorting
18MathDynamic ProgrammingMemoization
21Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
27Hash TableStringBacktracking
29ArrayStringBacktrackingDepth-First Search+1
30StringDynamic ProgrammingBacktracking
31ArrayDynamic ProgrammingGreedy
34ArrayDynamic ProgrammingMatrix
35TreeBreadth-First SearchBinary Tree
37TreeDepth-First SearchBinary Search TreeBinary Tree
39Two PointersStringString Matching
42ArrayStackMonotonic Stack
43ArrayDynamic ProgrammingGreedy
45MathDynamic ProgrammingCombinatorics
51ArrayBacktrackingBit Manipulation
52StringDynamic ProgrammingRecursion
54TreeBreadth-First SearchBinary Tree
57StackTreeDepth-First SearchBinary Tree
60StringDynamic Programming
63ArrayHash TableBacktrackingMatrix
64StringDynamic ProgrammingStack
65StringDynamic Programming
66ArrayDynamic ProgrammingStackMatrix+1
72TreeDepth-First SearchBreadth-First SearchBinary Tree
73MathStringBit ManipulationSimulation
74Hash TableStringSliding Window
76StringDynamic ProgrammingGreedyRecursion
85TreeDepth-First SearchBinary Search TreeBinary Tree
86StringDynamic Programming
87TreeDepth-First SearchBreadth-First SearchBinary Tree
88TreeDepth-First SearchBreadth-First SearchBinary Tree
89ArrayBacktrackingBit Manipulation
95Hash TableStringSliding Window
97ArrayDynamic ProgrammingMatrix
98MathDynamic ProgrammingTreeBinary Search Tree+1
100Dynamic ProgrammingBacktrackingTreeBinary Search Tree+1