Zomato Interview Questions — 24 DSA Problems

22 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Zomato LeetCode questions for software engineering interviews.

• Maximum Spending After Buying Items (HARD) — Array, Greedy, Sorting, Heap (Priority Queue), Matrix
• Split the Array to Make Coprime Products (HARD) — Array, Hash Table, Math, Number Theory
• Bitwise OR of All Subsequence Sums (MEDIUM) — Array, Math, Bit Manipulation, Brainteaser, Prefix Sum
• Shortest Cycle in a Graph (HARD) — Breadth-First Search, Graph
• Number of Ways to Divide a Long Corridor (HARD) — Math, String, Dynamic Programming
• Count the Hidden Sequences (MEDIUM) — Array, Prefix Sum
• Find and Replace Pattern (MEDIUM) — Array, Hash Table, String
• Total Cost to Hire K Workers (MEDIUM) — Array, Two Pointers, Heap (Priority Queue), Simulation
• Cherry Pickup (HARD) — Array, Dynamic Programming, Matrix
• Count Zero Request Servers (MEDIUM) — Array, Hash Table, Sliding Window, Sorting
• First Missing Positive (HARD) — Array, Hash Table
• Frog Jump (HARD) — Array, Dynamic Programming
• Optimal Account Balancing (HARD) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
• Unique Paths (MEDIUM) — Math, Dynamic Programming, Combinatorics
• Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• LFU Cache (HARD) — Hash Table, Linked List, Design, Doubly-Linked List
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Self Crossing (HARD) — Array, Math, Geometry
• Unique Paths II (MEDIUM) — Array, Dynamic Programming, Matrix
• Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy
• Two Sum II - Input Array Is Sorted (MEDIUM) — Array, Two Pointers, Binary Search
• Snakes and Ladders (MEDIUM) — Array, Breadth-First Search, Matrix
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming