F

Flipkart

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

Showing 100 of 100 questions

1
HardSmallest Range Covering Elements from K Listsβœ“ Our Solution
100
ArrayHash TableGreedySliding Window+2
2
MediumShortest Bridgeβœ“ Our Solution
98
ArrayDepth-First SearchBreadth-First SearchMatrix
3
HardTrapping Rain Waterβœ“ Our Solution
95
ArrayTwo PointersDynamic ProgrammingStack+1
4
MediumMaximum Points You Can Obtain from Cardsβœ“ Our Solution
93
ArraySliding WindowPrefix Sum
5
HardDesign Movie Rental Systemβœ“ Our Solution
84
ArrayHash TableDesignHeap (Priority Queue)+1
6
MediumMinimum Number of Coins to be Addedβœ“ Our Solution
84
ArrayGreedySorting
7
MediumCapacity To Ship Packages Within D Daysβœ“ Our Solution
82
ArrayBinary Search
8
MediumMinimum Cost to Reach City With Discounts
82
GraphHeap (Priority Queue)Shortest Path
9
MediumMinimum Limit of Balls in a Bagβœ“ Our Solution
82
ArrayBinary Search
10
HardThe Score of Students Solving Math Expressionβœ“ Our Solution
82
ArrayMathStringDynamic Programming+2
11
MediumNumbers With Same Consecutive Differencesβœ“ Our Solution
82
BacktrackingBreadth-First Search
12
HardTriples with Bitwise AND Equal To Zeroβœ“ Our Solution
82
ArrayHash TableBit Manipulation
13
HardMinimum Total Cost to Make Arrays Unequalβœ“ Our Solution
79
ArrayHash TableGreedyCounting
14
MediumContainer With Most Waterβœ“ Our Solution
79
ArrayTwo PointersGreedy
15
HardBinary Tree Maximum Path Sumβœ“ Our Solution
76
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
16
MediumKoko Eating Bananasβœ“ Our Solution
76
ArrayBinary Search
17
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
76
Hash TableStringSliding Window
18
MediumAsteroid Collisionβœ“ Our Solution
76
ArrayStackSimulation
19
HardCherry Pickup IIβœ“ Our Solution
73
ArrayDynamic ProgrammingMatrix
20
HardMinimum Adjacent Swaps for K Consecutive Onesβœ“ Our Solution
73
ArrayGreedySliding WindowPrefix Sum
21
69
ArrayHash Table
22
HardStrong Password Checkerβœ“ Our Solution
69
StringGreedyHeap (Priority Queue)
23
HardCreate Maximum Numberβœ“ Our Solution
69
ArrayTwo PointersStackGreedy+1
24
MediumProduct of Array Except Selfβœ“ Our Solution
69
ArrayPrefix Sum
25
MediumNumber of Islandsβœ“ Our Solution
64
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
26
MediumRotting Orangesβœ“ Our Solution
64
ArrayBreadth-First SearchMatrix
27
MediumGas Stationβœ“ Our Solution
64
ArrayGreedy
28
MediumCourse Scheduleβœ“ Our Solution
64
Depth-First SearchBreadth-First SearchGraphTopological Sort
29
HardMaximum Profit in Job Schedulingβœ“ Our Solution
64
ArrayBinary SearchDynamic ProgrammingSorting
30
HardLargest Rectangle in Histogramβœ“ Our Solution
59
ArrayStackMonotonic Stack
31
HardDungeon Gameβœ“ Our Solution
59
ArrayDynamic ProgrammingMatrix
32
MediumSubarray Sum Equals Kβœ“ Our Solution
59
ArrayHash TablePrefix Sum
33
MediumSort Colorsβœ“ Our Solution
59
ArrayTwo PointersSorting
34
MediumEdit Distanceβœ“ Our Solution
59
StringDynamic Programming
35
EasyMerge Two Sorted Listsβœ“ Our Solution
59
Linked ListRecursion
36
MediumPartition Equal Subset Sumβœ“ Our Solution
59
ArrayDynamic Programming
37
HardMedian of Two Sorted Arraysβœ“ Our Solution
59
ArrayBinary SearchDivide and Conquer
38
HardBurst Balloonsβœ“ Our Solution
59
ArrayDynamic Programming
39
MediumMaximum Width of Binary Treeβœ“ Our Solution
59
TreeDepth-First SearchBreadth-First SearchBinary Tree
40
HardFind K-th Smallest Pair Distanceβœ“ Our Solution
59
ArrayTwo PointersBinary SearchSorting
41
MediumDecode Waysβœ“ Our Solution
59
StringDynamic Programming
42
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
59
TreeBreadth-First SearchBinary Tree
43
HardFirst Missing Positiveβœ“ Our Solution
59
ArrayHash Table
44
52
ArrayGreedy
45
MediumMerge Intervalsβœ“ Our Solution
52
ArraySorting
46
MediumOpen the Lockβœ“ Our Solution
52
ArrayHash TableStringBreadth-First Search
47
HardCherry Pickupβœ“ Our Solution
52
ArrayDynamic ProgrammingMatrix
48
HardMaximum Performance of a Teamβœ“ Our Solution
52
ArrayGreedySortingHeap (Priority Queue)
49
EasyNumber of Students Unable to Eat Lunchβœ“ Our Solution
52
ArrayStackQueueSimulation
50
EasyNext Greater Element Iβœ“ Our Solution
52
ArrayHash TableStackMonotonic Stack
51
MediumHouse Robberβœ“ Our Solution
52
ArrayDynamic Programming
52
MediumRank Teams by Votesβœ“ Our Solution
52
ArrayHash TableStringSorting+1
53
HardCut Off Trees for Golf Eventβœ“ Our Solution
52
ArrayBreadth-First SearchHeap (Priority Queue)Matrix
54
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
52
ArrayBinary Search
55
HardReconstruct Itineraryβœ“ Our Solution
52
Depth-First SearchGraphEulerian Circuit
56
MediumJump Gameβœ“ Our Solution
52
ArrayDynamic ProgrammingGreedy
57
EasyRemove Duplicates from Sorted Arrayβœ“ Our Solution
52
ArrayTwo Pointers
58
MediumFind Peak Elementβœ“ Our Solution
52
ArrayBinary Search
59
HardMaximal Rectangleβœ“ Our Solution
52
ArrayDynamic ProgrammingStackMatrix+1
60
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
52
TreeDepth-First SearchBinary Tree
61
MediumWord Breakβœ“ Our Solution
52
ArrayHash TableStringDynamic Programming+2
62
MediumAmount of Time for Binary Tree to Be Infectedβœ“ Our Solution
52
Hash TableTreeDepth-First SearchBreadth-First Search+1
63
MediumCopy List with Random Pointerβœ“ Our Solution
52
Hash TableLinked List
64
MediumPredict the Winnerβœ“ Our Solution
52
ArrayMathDynamic ProgrammingRecursion+1
65
Medium01 Matrixβœ“ Our Solution
52
ArrayDynamic ProgrammingBreadth-First SearchMatrix
66
52
ArrayTwo PointersSorting
67
MediumUnique Paths IIβœ“ Our Solution
42
ArrayDynamic ProgrammingMatrix
68
MediumSurrounded Regionsβœ“ Our Solution
42
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
69
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
42
ArrayDynamic Programming
70
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
42
Linked ListTreeDepth-First SearchBreadth-First Search+1
71
EasyMajority Elementβœ“ Our Solution
42
ArrayHash TableDivide and ConquerSorting+1
72
EasySame Treeβœ“ Our Solution
42
TreeDepth-First SearchBreadth-First SearchBinary Tree
73
MediumLongest Consecutive Sequenceβœ“ Our Solution
42
ArrayHash TableUnion Find
74
MediumJump Game IIβœ“ Our Solution
42
ArrayDynamic ProgrammingGreedy
75
MediumLongest String Chainβœ“ Our Solution
42
ArrayHash TableTwo PointersString+2
76
MediumAll Nodes Distance K in Binary Treeβœ“ Our Solution
42
Hash TableTreeDepth-First SearchBreadth-First Search+1
77
MediumFilling Bookcase Shelvesβœ“ Our Solution
42
ArrayDynamic Programming
78
MediumPath Sum IIβœ“ Our Solution
42
BacktrackingTreeDepth-First SearchBinary Tree
79
MediumLongest Repeating Character Replacementβœ“ Our Solution
42
Hash TableStringSliding Window
80
MediumDaily Temperaturesβœ“ Our Solution
42
ArrayStackMonotonic Stack
81
MediumRotate Arrayβœ“ Our Solution
42
ArrayMathTwo Pointers
82
HardMinimum Number of Refueling Stopsβœ“ Our Solution
42
ArrayDynamic ProgrammingGreedyHeap (Priority Queue)
83
MediumCar Poolingβœ“ Our Solution
42
ArraySortingHeap (Priority Queue)Simulation+1
84
MediumMaximum Sum Circular Subarrayβœ“ Our Solution
42
ArrayDivide and ConquerDynamic ProgrammingQueue+1
85
MediumMinimum Area Rectangleβœ“ Our Solution
42
ArrayHash TableMathGeometry+1
86
HardSliding Window Medianβœ“ Our Solution
42
ArrayHash TableSliding WindowHeap (Priority Queue)
87
MediumMinimum Number of Arrows to Burst Balloonsβœ“ Our Solution
42
ArrayGreedySorting
88
MediumMinimum Cost For Ticketsβœ“ Our Solution
42
ArrayDynamic Programming
89
MediumPath Sum IIIβœ“ Our Solution
42
TreeDepth-First SearchBinary Tree
90
EasyLast Stone Weightβœ“ Our Solution
42
ArrayHeap (Priority Queue)
91
HardPatching Arrayβœ“ Our Solution
42
ArrayGreedy
92
HardCourse Schedule IIIβœ“ Our Solution
42
ArrayGreedySortingHeap (Priority Queue)
93
HardMinimum Number of Taps to Open to Water a Gardenβœ“ Our Solution
42
ArrayDynamic ProgrammingGreedy
94
HardSliding Window Maximumβœ“ Our Solution
42
ArrayQueueSliding WindowHeap (Priority Queue)+1
95
HardMaximum Running Time of N Computersβœ“ Our Solution
42
ArrayBinary SearchGreedySorting
96
EasyCrawler Log Folderβœ“ Our Solution
42
ArrayStringStack
97
MediumFurthest Building You Can Reachβœ“ Our Solution
42
ArrayGreedyHeap (Priority Queue)
98
MediumKth Largest Element in an Arrayβœ“ Our Solution
42
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
99
MediumBinary Tree Right Side Viewβœ“ Our Solution
42
TreeDepth-First SearchBreadth-First SearchBinary Tree
100
HardPut Marbles in Bagsβœ“ Our Solution
42
ArrayGreedySortingHeap (Priority Queue)