Zepto Interview Questions — 31 DSA Problems

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

Most frequently asked Zepto LeetCode questions for software engineering interviews.

• Longest Univalue Path (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Merge Intervals (MEDIUM) — Array, Sorting
• Path Sum III (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Car Pooling (MEDIUM) — Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum
• Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack
• Minimum Cost For Tickets (MEDIUM) — Array, Dynamic Programming
• Find Peak Element (MEDIUM) — Array, Binary Search
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
• Unique Paths II (MEDIUM) — Array, Dynamic Programming, Matrix
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Divide Two Integers (MEDIUM) — Math, Bit Manipulation
• Maximum Width Ramp (MEDIUM) — Array, Two Pointers, Stack, Monotonic Stack
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Next Permutation (MEDIUM) — Array, Two Pointers
• Longest Repeating Character Replacement (MEDIUM) — Hash Table, String, Sliding Window
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Gas Station (MEDIUM) — Array, Greedy
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
• Rabbits in Forest (MEDIUM) — Array, Hash Table, Math, Greedy
• Count Sub Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Make Array Empty (HARD) — Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set
• Find the Distance Value Between Two Arrays (EASY) — Array, Two Pointers, Binary Search, Sorting
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Open the Lock (MEDIUM) — Array, Hash Table, String, Breadth-First Search
• Maximum Sum BST in Binary Tree (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Maximum Good Subarray Sum (MEDIUM) — Array, Hash Table, Prefix Sum