F
Flipkart
100 questions tracked99 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
1ArrayHash TableGreedySliding Window+2
2ArrayDepth-First SearchBreadth-First SearchMatrix
3ArrayTwo PointersDynamic ProgrammingStack+1
4ArraySliding WindowPrefix Sum
5ArrayHash TableDesignHeap (Priority Queue)+1
8MediumMinimum Cost to Reach City With Discounts
GraphHeap (Priority Queue)Shortest Path
10ArrayMathStringDynamic Programming+2
11BacktrackingBreadth-First Search
12ArrayHash TableBit Manipulation
13ArrayHash TableGreedyCounting
15Dynamic ProgrammingTreeDepth-First SearchBinary Tree
17Hash TableStringSliding Window
19ArrayDynamic ProgrammingMatrix
20ArrayGreedySliding WindowPrefix Sum
22StringGreedyHeap (Priority Queue)
23ArrayTwo PointersStackGreedy+1
25ArrayDepth-First SearchBreadth-First SearchUnion Find+1
26ArrayBreadth-First SearchMatrix
28Depth-First SearchBreadth-First SearchGraphTopological Sort
29ArrayBinary SearchDynamic ProgrammingSorting
30ArrayStackMonotonic Stack
31ArrayDynamic ProgrammingMatrix
32ArrayHash TablePrefix Sum
34StringDynamic Programming
37ArrayBinary SearchDivide and Conquer
39TreeDepth-First SearchBreadth-First SearchBinary Tree
40ArrayTwo PointersBinary SearchSorting
41StringDynamic Programming
42TreeBreadth-First SearchBinary Tree
46ArrayHash TableStringBreadth-First Search
47ArrayDynamic ProgrammingMatrix
48ArrayGreedySortingHeap (Priority Queue)
49ArrayStackQueueSimulation
50ArrayHash TableStackMonotonic Stack
52ArrayHash TableStringSorting+1
53ArrayBreadth-First SearchHeap (Priority Queue)Matrix
55Depth-First SearchGraphEulerian Circuit
56ArrayDynamic ProgrammingGreedy
59ArrayDynamic ProgrammingStackMatrix+1
60TreeDepth-First SearchBinary Tree
61ArrayHash TableStringDynamic Programming+2
62Hash TableTreeDepth-First SearchBreadth-First Search+1
64ArrayMathDynamic ProgrammingRecursion+1
65ArrayDynamic ProgrammingBreadth-First SearchMatrix
67ArrayDynamic ProgrammingMatrix
68ArrayDepth-First SearchBreadth-First SearchUnion Find+1
70Linked ListTreeDepth-First SearchBreadth-First Search+1
71ArrayHash TableDivide and ConquerSorting+1
72TreeDepth-First SearchBreadth-First SearchBinary Tree
73ArrayHash TableUnion Find
74ArrayDynamic ProgrammingGreedy
75ArrayHash TableTwo PointersString+2
76Hash TableTreeDepth-First SearchBreadth-First Search+1
78BacktrackingTreeDepth-First SearchBinary Tree
79Hash TableStringSliding Window
80ArrayStackMonotonic Stack
82ArrayDynamic ProgrammingGreedyHeap (Priority Queue)
83ArraySortingHeap (Priority Queue)Simulation+1
84ArrayDivide and ConquerDynamic ProgrammingQueue+1
85ArrayHash TableMathGeometry+1
86ArrayHash TableSliding WindowHeap (Priority Queue)
89TreeDepth-First SearchBinary Tree
90ArrayHeap (Priority Queue)
92ArrayGreedySortingHeap (Priority Queue)
93ArrayDynamic ProgrammingGreedy
94ArrayQueueSliding WindowHeap (Priority Queue)+1
95ArrayBinary SearchGreedySorting
97ArrayGreedyHeap (Priority Queue)
98ArrayDivide and ConquerSortingHeap (Priority Queue)+1
99TreeDepth-First SearchBreadth-First SearchBinary Tree
100ArrayGreedySortingHeap (Priority Queue)