P

PhonePe

93 questions tracked89 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 93 of 93 questions

1
HardFrog Jumpβœ“ Our Solution
100
ArrayDynamic Programming
2
HardBurst Balloonsβœ“ Our Solution
94
ArrayDynamic Programming
3
MediumDecoded String at Indexβœ“ Our Solution
91
StringStack
4
MediumMaximum Tastiness of Candy Basketβœ“ Our Solution
87
ArrayBinary SearchGreedySorting
5
MediumSimple Bank Systemβœ“ Our Solution
87
ArrayHash TableDesignSimulation
6
HardSmallest Range Covering Elements from K Listsβœ“ Our Solution
87
ArrayHash TableGreedySliding Window+2
7
HardViewers Turned Streamers
84
Database
8
HardFrequencies of Shortest Supersequencesβœ“ Our Solution
84
ArrayStringBit ManipulationGraph+2
9
MediumSmallest String With Swapsβœ“ Our Solution
84
ArrayHash TableStringDepth-First Search+3
10
MediumMaximum Amount of Money Robot Can Earnβœ“ Our Solution
84
ArrayDynamic ProgrammingMatrix
11
HardCheck if Point Is Reachableβœ“ Our Solution
84
MathNumber Theory
12
HardCount the Number of Arrays with K Matching Adjacent Elementsβœ“ Our Solution
84
MathCombinatorics
13
HardFind Beautiful Indices in the Given Array IIβœ“ Our Solution
84
Two PointersStringBinary SearchRolling Hash+2
14
MediumRemove K Digitsβœ“ Our Solution
79
StringStackGreedyMonotonic Stack
15
MediumMost Stones Removed with Same Row or Columnβœ“ Our Solution
76
Hash TableDepth-First SearchUnion FindGraph
16
HardBus Routesβœ“ Our Solution
76
ArrayHash TableBreadth-First Search
17
HardTrapping Rain Waterβœ“ Our Solution
72
ArrayTwo PointersDynamic ProgrammingStack+1
18
MediumLongest Palindromic Substringβœ“ Our Solution
72
Two PointersStringDynamic Programming
19
MediumHouse Robber IIβœ“ Our Solution
67
ArrayDynamic Programming
20
MediumQueue Reconstruction by Heightβœ“ Our Solution
67
ArrayBinary Indexed TreeSegment TreeSorting
21
HardSplit Array Largest Sumβœ“ Our Solution
67
ArrayBinary SearchDynamic ProgrammingGreedy+1
22
67
ArrayGreedy
23
MediumFrequency of the Most Frequent Elementβœ“ Our Solution
67
ArrayBinary SearchGreedySliding Window+2
24
MediumHouse Robberβœ“ Our Solution
67
ArrayDynamic Programming
25
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
67
ArrayDynamic Programming
26
MediumKth Smallest Element in a Sorted Matrixβœ“ Our Solution
67
ArrayBinary SearchSortingHeap (Priority Queue)+1
27
HardMaximum Profit in Job Schedulingβœ“ Our Solution
67
ArrayBinary SearchDynamic ProgrammingSorting
28
MediumAmount of Time for Binary Tree to Be Infectedβœ“ Our Solution
62
Hash TableTreeDepth-First SearchBreadth-First Search+1
29
MediumLongest Continuous Subarray With Absolute Diff Less Than or Equal to Limitβœ“ Our Solution
62
ArrayQueueSliding WindowHeap (Priority Queue)+2
30
HardReachable Nodes In Subdivided Graphβœ“ Our Solution
62
GraphHeap (Priority Queue)Shortest Path
31
MediumKoko Eating Bananasβœ“ Our Solution
62
ArrayBinary Search
32
HardSum of Distances in Treeβœ“ Our Solution
62
Dynamic ProgrammingTreeDepth-First SearchGraph
33
MediumMake Lexicographically Smallest Array by Swapping Elementsβœ“ Our Solution
62
ArrayUnion FindSorting
34
62
ArrayGreedySortingHeap (Priority Queue)
35
MediumJump Game IIβœ“ Our Solution
62
ArrayDynamic ProgrammingGreedy
36
MediumHouse Robber IIIβœ“ Our Solution
55
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
37
MediumDistribute Coins in Binary Treeβœ“ Our Solution
55
TreeDepth-First SearchBinary Tree
38
MediumSort Colorsβœ“ Our Solution
55
ArrayTwo PointersSorting
39
MediumMerge Intervalsβœ“ Our Solution
55
ArraySorting
40
MediumMaximal Squareβœ“ Our Solution
55
ArrayDynamic ProgrammingMatrix
41
MediumSplit Array into Consecutive Subsequencesβœ“ Our Solution
55
ArrayHash TableGreedyHeap (Priority Queue)
42
HardBest Time to Buy and Sell Stock IIIβœ“ Our Solution
55
ArrayDynamic Programming
43
HardWord Ladderβœ“ Our Solution
55
Hash TableStringBreadth-First Search
44
HardMinimum Cost to Cut a Stickβœ“ Our Solution
55
ArrayDynamic ProgrammingSorting
45
MediumRotting Orangesβœ“ Our Solution
55
ArrayBreadth-First SearchMatrix
46
MediumMatchsticks to Squareβœ“ Our Solution
55
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
47
HardSliding Window Maximumβœ“ Our Solution
55
ArrayQueueSliding WindowHeap (Priority Queue)+1
48
MediumAccounts Mergeβœ“ Our Solution
55
ArrayHash TableStringDepth-First Search+3
49
HardSwim in Rising Waterβœ“ Our Solution
55
ArrayBinary SearchDepth-First SearchBreadth-First Search+3
50
HardBest Time to Buy and Sell Stock IVβœ“ Our Solution
45
ArrayDynamic Programming
51
MediumEvaluate Divisionβœ“ Our Solution
45
ArrayStringDepth-First SearchBreadth-First Search+3
52
MediumBinary Tree Level Order Traversalβœ“ Our Solution
45
TreeBreadth-First SearchBinary Tree
53
MediumGroup Anagramsβœ“ Our Solution
45
ArrayHash TableStringSorting
54
MediumLongest Consecutive Sequenceβœ“ Our Solution
45
ArrayHash TableUnion Find
55
MediumLRU Cacheβœ“ Our Solution
45
Hash TableLinked ListDesignDoubly-Linked List
56
MediumFind Duplicate Subtreesβœ“ Our Solution
45
Hash TableTreeDepth-First SearchBinary Tree
57
MediumWays to Make a Fair Arrayβœ“ Our Solution
45
ArrayPrefix Sum
58
HardFirst Missing Positiveβœ“ Our Solution
45
ArrayHash Table
59
MediumHeatersβœ“ Our Solution
45
ArrayTwo PointersBinary SearchSorting
60
MediumSnakes and Laddersβœ“ Our Solution
45
ArrayBreadth-First SearchMatrix
61
MediumSum of Subarray Minimumsβœ“ Our Solution
45
ArrayDynamic ProgrammingStackMonotonic Stack
62
MediumAsteroid Collisionβœ“ Our Solution
45
ArrayStackSimulation
63
MediumGenerate Parenthesesβœ“ Our Solution
45
StringDynamic ProgrammingBacktracking
64
MediumInsert Intervalβœ“ Our Solution
45
Array
65
HardBinary Tree Camerasβœ“ Our Solution
45
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
66
HardMaximum Performance of a Teamβœ“ Our Solution
45
ArrayGreedySortingHeap (Priority Queue)
67
MediumJump Gameβœ“ Our Solution
45
ArrayDynamic ProgrammingGreedy
68
HardPartition Array Into Two Arrays to Minimize Sum Differenceβœ“ Our Solution
45
ArrayTwo PointersBinary SearchDynamic Programming+3
69
HardLargest Rectangle in Histogramβœ“ Our Solution
45
ArrayStackMonotonic Stack
70
HardDecode Ways IIβœ“ Our Solution
45
StringDynamic Programming
71
HardFind Minimum Time to Finish All Jobsβœ“ Our Solution
45
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
72
HardAlien Dictionary
45
ArrayStringDepth-First SearchBreadth-First Search+2
73
MediumDaily Temperaturesβœ“ Our Solution
45
ArrayStackMonotonic Stack
74
MediumCourse Schedule IIβœ“ Our Solution
45
Depth-First SearchBreadth-First SearchGraphTopological Sort
75
MediumLongest Repeating Character Replacementβœ“ Our Solution
45
Hash TableStringSliding Window
76
MediumComplete Binary Tree Inserterβœ“ Our Solution
45
TreeBreadth-First SearchDesignBinary Tree
77
MediumString Compressionβœ“ Our Solution
45
Two PointersString
78
MediumNumber of Islandsβœ“ Our Solution
45
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
79
MediumMagnetic Force Between Two Ballsβœ“ Our Solution
45
ArrayBinary SearchSorting
80
HardNumber of Islands II
45
ArrayHash TableUnion Find
81
MediumCopy List with Random Pointerβœ“ Our Solution
45
Hash TableLinked List
82
MediumMaximum Total Damage With Spell Castingβœ“ Our Solution
45
ArrayHash TableTwo PointersBinary Search+3
83
MediumFind All Possible Recipes from Given Suppliesβœ“ Our Solution
45
ArrayHash TableStringGraph+1
84
MediumGas Stationβœ“ Our Solution
45
ArrayGreedy
85
MediumWalking Robot Simulationβœ“ Our Solution
45
ArrayHash TableSimulation
86
MediumMinimum Cost Tree From Leaf Valuesβœ“ Our Solution
45
ArrayDynamic ProgrammingStackGreedy+1
87
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
45
ArrayDynamic ProgrammingGreedy
88
HardApply Operations to Maximize Frequency Scoreβœ“ Our Solution
45
ArrayBinary SearchSliding WindowSorting+1
89
MediumMake Sum Divisible by Pβœ“ Our Solution
45
ArrayHash TablePrefix Sum
90
MediumMinimum Height Treesβœ“ Our Solution
45
Depth-First SearchBreadth-First SearchGraphTopological Sort
91
MediumFind the Celebrity
45
Two PointersGraphInteractive
92
EasyLongest Common Prefixβœ“ Our Solution
45
StringTrie
93
HardNumber of Flowers in Full Bloomβœ“ Our Solution
45
ArrayHash TableBinary SearchSorting+2