Z

Zomato

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

Showing 24 of 24 questions

1
HardMaximum Spending After Buying Itemsβœ“ Our Solution
100
ArrayGreedySortingHeap (Priority Queue)+1
2
HardSplit the Array to Make Coprime Productsβœ“ Our Solution
100
ArrayHash TableMathNumber Theory
3
MediumBitwise OR of All Subsequence Sums
100
ArrayMathBit ManipulationBrainteaser+1
4
HardShortest Cycle in a Graphβœ“ Our Solution
100
Breadth-First SearchGraph
5
HardNumber of Ways to Divide a Long Corridorβœ“ Our Solution
100
MathStringDynamic Programming
6
MediumCount the Hidden Sequencesβœ“ Our Solution
94
ArrayPrefix Sum
7
MediumFind and Replace Patternβœ“ Our Solution
82
ArrayHash TableString
8
MediumTotal Cost to Hire K Workersβœ“ Our Solution
82
ArrayTwo PointersHeap (Priority Queue)Simulation
9
HardCherry Pickupβœ“ Our Solution
77
ArrayDynamic ProgrammingMatrix
10
MediumCount Zero Request Serversβœ“ Our Solution
69
ArrayHash TableSliding WindowSorting
11
HardFirst Missing Positiveβœ“ Our Solution
69
ArrayHash Table
12
HardFrog Jumpβœ“ Our Solution
59
ArrayDynamic Programming
13
HardOptimal Account Balancing
59
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
14
MediumUnique Pathsβœ“ Our Solution
59
MathDynamic ProgrammingCombinatorics
15
HardLargest Rectangle in Histogramβœ“ Our Solution
59
ArrayStackMonotonic Stack
16
59
ArrayTwo PointersSorting
17
HardLFU Cacheβœ“ Our Solution
59
Hash TableLinked ListDesignDoubly-Linked List
18
MediumNumber of Islandsβœ“ Our Solution
59
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
19
HardSelf Crossingβœ“ Our Solution
59
ArrayMathGeometry
20
MediumUnique Paths IIβœ“ Our Solution
59
ArrayDynamic ProgrammingMatrix
21
MediumJump Game IIβœ“ Our Solution
59
ArrayDynamic ProgrammingGreedy
22
MediumTwo Sum II - Input Array Is Sortedβœ“ Our Solution
59
ArrayTwo PointersBinary Search
23
MediumSnakes and Laddersβœ“ Our Solution
59
ArrayBreadth-First SearchMatrix
24
MediumMaximum Subarrayβœ“ Our Solution
59
ArrayDivide and ConquerDynamic Programming