Zeta Interview Questions — 21 DSA Problems

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

Most frequently asked Zeta LeetCode questions for software engineering interviews.

• Apply Operations to Make Two Strings Equal (MEDIUM) — String, Dynamic Programming
• Split Array Largest Sum (HARD) — Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum
• Task Scheduler (MEDIUM) — Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting
• Evaluate Division (MEDIUM) — Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path
• IPO (HARD) — Array, Greedy, Sorting, Heap (Priority Queue)
• Next Greater Element II (MEDIUM) — Array, Stack, Monotonic Stack
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Capacity To Ship Packages Within D Days (MEDIUM) — Array, Binary Search
• Longest Valid Parentheses (HARD) — String, Dynamic Programming, Stack
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Count Univalue Subtrees (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Minimum Operations to Write the Letter Y on a Grid (MEDIUM) — Array, Hash Table, Matrix, Counting
• Substring with Concatenation of All Words (HARD) — Hash Table, String, Sliding Window
• Interleaving String (MEDIUM) — String, Dynamic Programming
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Find a Peak Element II (MEDIUM) — Array, Binary Search, Matrix
• Insert Delete GetRandom O(1) - Duplicates allowed (HARD) — Array, Hash Table, Math, Design, Randomized
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion