Pocket-gems Master DSA Sheet

This compilation contains exclusive, previously asked data structure and algorithm questions from real Pocket-gems interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.

top-specificpocket-gems-prep

Inorder Successor in BST

Medium

Binary Search TreeBinary TreeDepth-First Search

Non-negative Integers without Consecutive Ones

Hard

Dynamic Programming

Top K Frequent Words

Medium

ArrayBucket SortCounting

Clone Graph

Medium

Breadth-First SearchDepth-First SearchGraph Theory

Alien Dictionary

Hard

ArrayBreadth-First SearchDepth-First Search

Basic Calculator III

Hard

MathRecursionStack

Longest Repeating Character Replacement

Medium

Hash TableSliding WindowString

Insert Delete GetRandom O(1)

Medium

ArrayDesignHash Table

Find the Index of the First Occurrence in a String

Easy

StringString MatchingTwo Pointers

Shortest Palindrome

Hard

Hash FunctionRolling HashString

Find All Duplicates in an Array

Medium

ArrayHash TableSorting

Top K Frequent Elements

Medium

ArrayBucket SortCounting

Sort Colors

Medium

ArraySortingTwo Pointers

Kth Largest Element in an Array

Medium

ArrayDivide and ConquerHeap (Priority Queue)

Word Break

Medium

ArrayDynamic ProgrammingHash Table

Pocket-gems Master DSA Sheet

All Questions