I
Infosys
100 questions tracked99 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
2ArrayBinary SearchStackBinary Indexed Tree+3
3ArrayBreadth-First SearchOrdered Set
4MathDynamic ProgrammingCombinatoricsNumber Theory
6ArrayDivide and ConquerDynamic ProgrammingSegment Tree
8Hash TableStringSliding Window
10ArrayHash TableStringSorting
12ArrayHash TableStackMonotonic Stack+1
13ArrayGreedyHeap (Priority Queue)
14ArrayUnion FindPrefix SumOrdered Set
15ArrayDynamic ProgrammingSorting
17MediumNumber of Nodes With Value One
TreeDepth-First SearchBreadth-First SearchBinary Tree
19ArrayHash TableMathDynamic Programming+3
20ArrayMathDynamic ProgrammingPrefix Sum+1
27ArrayMathDynamic ProgrammingNumber Theory
32ArrayDivide and ConquerDynamic Programming
36ArrayTwo PointersDynamic ProgrammingStack+1
40MathDynamic ProgrammingRecursionMemoization
42ArrayDynamic ProgrammingBreadth-First Search
44ArrayHash TableStringSorting
45StringDynamic ProgrammingBacktracking
49ArrayHash TableUnion Find
51ArrayDivide and ConquerSortingHeap (Priority Queue)+1
52ArrayDivide and ConquerSortingHeap (Priority Queue)+4
53ArrayTwo PointersBinary Search
55Two PointersStringString Matching
56ArrayTwo PointersSimulation
57Two PointersStringDynamic Programming
58ArrayDepth-First SearchBreadth-First SearchUnion Find+1
59StringDynamic ProgrammingBacktracking
63MathDynamic ProgrammingMemoization
66ArrayHash TableMathBinary Search+2
72Hash TableStringSliding Window
75ArrayDynamic ProgrammingGreedy
76ArrayBacktrackingBit Manipulation
84ArrayHash TablePrefix Sum
86TreeDepth-First SearchBreadth-First SearchBinary Tree
88ArrayDynamic ProgrammingGreedy
89ArrayStackSortingMonotonic Stack
90ArrayBinary SearchDivide and Conquer
91StringDynamic Programming
94ArrayTwo PointersBinary SearchBit Manipulation
95ArrayStringDynamic ProgrammingBacktracking+2