Pocket Gems Interview Questions — 15 DSA Problems

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

Most frequently asked Pocket Gems LeetCode questions for software engineering interviews.

• Find the Index of the First Occurrence in a String (EASY) — Two Pointers, String, String Matching
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Non-negative Integers without Consecutive Ones (HARD) — Dynamic Programming
• Clone Graph (MEDIUM) — Hash Table, Depth-First Search, Breadth-First Search, Graph
• Word Break (MEDIUM) — Array, Hash Table, String, Dynamic Programming, Trie, Memoization
• Top K Frequent Words (MEDIUM) — Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting
• Shortest Palindrome (HARD) — String, Rolling Hash, String Matching, Hash Function
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Alien Dictionary (HARD) — Array, String, Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Basic Calculator III (HARD) — Math, String, Stack, Recursion
• Inorder Successor in BST (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Longest Repeating Character Replacement (MEDIUM) — Hash Table, String, Sliding Window
• Find All Duplicates in an Array (MEDIUM) — Array, Hash Table