P
PhonePe
93 questions tracked89 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 93 of 93 questions
4ArrayBinary SearchGreedySorting
5ArrayHash TableDesignSimulation
6ArrayHash TableGreedySliding Window+2
7HardViewers Turned Streamers
Database
8ArrayStringBit ManipulationGraph+2
9ArrayHash TableStringDepth-First Search+3
10ArrayDynamic ProgrammingMatrix
12HardCount the Number of Arrays with K Matching Adjacent Elementsβ Our Solution MathCombinatorics
13Two PointersStringBinary SearchRolling Hash+2
14StringStackGreedyMonotonic Stack
15Hash TableDepth-First SearchUnion FindGraph
16ArrayHash TableBreadth-First Search
17ArrayTwo PointersDynamic ProgrammingStack+1
18Two PointersStringDynamic Programming
20ArrayBinary Indexed TreeSegment TreeSorting
21ArrayBinary SearchDynamic ProgrammingGreedy+1
23ArrayBinary SearchGreedySliding Window+2
26ArrayBinary SearchSortingHeap (Priority Queue)+1
27ArrayBinary SearchDynamic ProgrammingSorting
28Hash TableTreeDepth-First SearchBreadth-First Search+1
29MediumLongest Continuous Subarray With Absolute Diff Less Than or Equal to Limitβ Our Solution ArrayQueueSliding WindowHeap (Priority Queue)+2
30GraphHeap (Priority Queue)Shortest Path
32Dynamic ProgrammingTreeDepth-First SearchGraph
33MediumMake Lexicographically Smallest Array by Swapping Elementsβ Our Solution ArrayUnion FindSorting
34ArrayGreedySortingHeap (Priority Queue)
35ArrayDynamic ProgrammingGreedy
36Dynamic ProgrammingTreeDepth-First SearchBinary Tree
37TreeDepth-First SearchBinary Tree
40ArrayDynamic ProgrammingMatrix
41ArrayHash TableGreedyHeap (Priority Queue)
43Hash TableStringBreadth-First Search
44ArrayDynamic ProgrammingSorting
45ArrayBreadth-First SearchMatrix
46ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
47ArrayQueueSliding WindowHeap (Priority Queue)+1
48ArrayHash TableStringDepth-First Search+3
49ArrayBinary SearchDepth-First SearchBreadth-First Search+3
51ArrayStringDepth-First SearchBreadth-First Search+3
52TreeBreadth-First SearchBinary Tree
53ArrayHash TableStringSorting
54ArrayHash TableUnion Find
55Hash TableLinked ListDesignDoubly-Linked List
56Hash TableTreeDepth-First SearchBinary Tree
59ArrayTwo PointersBinary SearchSorting
60ArrayBreadth-First SearchMatrix
61ArrayDynamic ProgrammingStackMonotonic Stack
63StringDynamic ProgrammingBacktracking
65Dynamic ProgrammingTreeDepth-First SearchBinary Tree
66ArrayGreedySortingHeap (Priority Queue)
67ArrayDynamic ProgrammingGreedy
68ArrayTwo PointersBinary SearchDynamic Programming+3
69ArrayStackMonotonic Stack
70StringDynamic Programming
71ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
72HardAlien Dictionary
ArrayStringDepth-First SearchBreadth-First Search+2
73ArrayStackMonotonic Stack
74Depth-First SearchBreadth-First SearchGraphTopological Sort
75Hash TableStringSliding Window
76TreeBreadth-First SearchDesignBinary Tree
78ArrayDepth-First SearchBreadth-First SearchUnion Find+1
79ArrayBinary SearchSorting
80HardNumber of Islands II
ArrayHash TableUnion Find
82ArrayHash TableTwo PointersBinary Search+3
83ArrayHash TableStringGraph+1
85ArrayHash TableSimulation
86ArrayDynamic ProgrammingStackGreedy+1
87ArrayDynamic ProgrammingGreedy
88ArrayBinary SearchSliding WindowSorting+1
89ArrayHash TablePrefix Sum
90Depth-First SearchBreadth-First SearchGraphTopological Sort
91MediumFind the Celebrity
Two PointersGraphInteractive
93ArrayHash TableBinary SearchSorting+2