A
Adobe
100 questions tracked100 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
4ArrayBinary SearchDivide and Conquer
5Hash TableStringSliding Window
7ArrayTwo PointersDynamic ProgrammingStack+1
10MathDynamic ProgrammingMemoization
11ArrayHash TableStringSorting
16Two PointersStringDynamic Programming
23ArrayDynamic ProgrammingGreedy
25StringDynamic ProgrammingBacktracking
26Hash TableStringBacktracking
33ArrayDynamic ProgrammingGreedy
37MathDynamic ProgrammingCombinatorics
39ArrayDivide and ConquerDynamic Programming
41Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
44Two PointersStringString Matching
45ArrayBacktrackingBit Manipulation
47ArrayHash TableDivide and ConquerTree+1
52TreeBreadth-First SearchBinary Tree
55Hash TableStringSliding Window
56ArrayStackMonotonic Stack
60StringDynamic ProgrammingGreedyRecursion
63StackTreeDepth-First SearchBinary Tree
65TreeDepth-First SearchBreadth-First SearchBinary Tree
66ArrayHash TableBacktrackingMatrix
68MathStringBit ManipulationSimulation
69StringDynamic Programming
70StringDynamic ProgrammingStack
71TreeDepth-First SearchBreadth-First SearchBinary Tree
72TreeDepth-First SearchBinary Tree
73ArrayStringBacktrackingDepth-First Search+1
76TreeDepth-First SearchBinary Search TreeBinary Tree
77TreeDepth-First SearchBreadth-First SearchBinary Tree
80StringDynamic Programming
81ArrayDynamic ProgrammingMatrix
85Hash TableStringSliding Window
92ArrayDivide and ConquerTreeBinary Search Tree+1
93MediumConstruct Binary Tree from Inorder and Postorder Traversalβ Our Solution ArrayHash TableDivide and ConquerTree+1
95TreeBreadth-First SearchBinary Tree
96MathDynamic ProgrammingTreeBinary Search Tree+1
97ArrayBacktrackingBit Manipulation
98ArrayDynamic ProgrammingStackMatrix+1
100TreeDepth-First SearchBreadth-First SearchBinary Tree