M

Microsoft

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