A
Accenture
100 questions tracked100 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
2Hash TableMathTwo Pointers
4MathDynamic ProgrammingMemoization
9ArrayDivide and ConquerDynamic Programming
10ArrayHash TableDynamic Programming
12ArrayHash TableSortingHeap (Priority Queue)
14ArraySimulationPrefix Sum
19Two PointersStringDynamic Programming
24StringRolling HashString MatchingHash Function
25ArrayBit ManipulationSortingCounting
26ArrayHash TableDivide and ConquerSorting+1
27Hash TableStringSliding Window
31MathDynamic ProgrammingBreadth-First Search
38MathDynamic ProgrammingRecursionMemoization
41ArrayTwo PointersGreedySorting
45ArrayBinary SearchDynamic Programming
46ArrayDynamic ProgrammingBreadth-First Search
49ArrayMathEnumerationNumber Theory
56ArrayMathRecursionQueue+1
57ArrayHash TableStackMonotonic Stack
59StringDynamic Programming
64Two PointersStringDynamic Programming
65Two PointersStringString Matching
68MathDynamic ProgrammingCombinatorics
70ArrayHash TableSortingCounting
71ArrayDynamic ProgrammingBreadth-First SearchMatrix
75ArrayStackMonotonic Stack
77ArrayTwo PointersBinary SearchSorting
78ArrayDivide and ConquerSortingHeap (Priority Queue)+1
79Hash TableStringSliding WindowCounting
82TreeDepth-First SearchBreadth-First SearchBinary Tree
86ArrayHash TableGreedySorting
87MathDynamic ProgrammingMemoization
90Hash TableMathDynamic ProgrammingHeap (Priority Queue)
91Hash TableLinked ListTwo Pointers
92ArrayHash TableStringSorting
93ArrayHash TableSortingCounting Sort
94Two PointersStringDynamic Programming
97ArrayBinary SearchDivide and Conquer