Zopsmart Interview Questions — 18 DSA Problems
18 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Zopsmart LeetCode questions for software engineering interviews.
- Zigzag Conversion (MEDIUM) — String
- Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
- Reverse Nodes in Even Length Groups (MEDIUM) — Linked List
- Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
- Bulls and Cows (MEDIUM) — Hash Table, String, Counting
- Fraction Addition and Subtraction (MEDIUM) — Math, String, Simulation
- Remove K Digits (MEDIUM) — String, Stack, Greedy, Monotonic Stack
- Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
- Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
- Reverse Words in a String (MEDIUM) — Two Pointers, String
- 3Sum (MEDIUM) — Array, Two Pointers, Sorting
- Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
- Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
- Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
- Reverse Linked List (EASY) — Linked List, Recursion
- Reverse Nodes in k-Group (HARD) — Linked List, Recursion
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
- Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
Z
Zopsmart
18 questions tracked18 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 18 of 18 questions
2ArrayTwo PointersDynamic ProgrammingStack+1
4Hash TableStringSliding Window
7StringStackGreedyMonotonic Stack
9ArrayHash TableStringSorting
14Hash TableStringBacktracking
17Two PointersStringDynamic Programming