Array & Hashing

Array and Hashing concepts for coding interview preparation. Recommended resource: Striver's Playlist.

Importance 95

Two Pointers

Two Pointers technique for solving array, string, and searching-based interview problems. Recommende...

Importance 90

Sliding Window

Sliding Window technique for substring, subarray, and optimization-based interview problems. Recomme...

Importance 92

Stacks

Stack-based problems including next greater element, monotonic stack, histogram, and expression eval...

Importance 88

Binary Search

Binary Search concepts including search space reduction, lower bound, upper bound, and binary search...

Importance 94

Heap / Priority Queue

Heap and Priority Queue problems including top K elements, kth largest/smallest, merging, and schedu...

Importance 87

Recursion

Recursion fundamentals including base condition, recursive tree, subsets, permutations, and recursiv...

Importance 85

Dynamic Programming (DP)

Dynamic Programming concepts including memoization, tabulation, subsequence DP, knapsack, LIS, grid ...

Importance 98

Linked List

Linked List problems including reversal, cycle detection, merge, middle node, and pointer manipulati...

Importance 86

Trees

Tree problems including traversal, height, diameter, LCA, BST, views, and tree construction. Recomme...

Importance 96

Graphs

Graph problems including BFS, DFS, shortest path, cycle detection, topological sort, DSU, MST, and g...

Importance 97

Tries

Trie-based problems including prefix search, word dictionary, autocomplete, and bitwise trie problem...

Importance 82

Backtracking

Backtracking problems including subsets, permutations, combination sum, N-Queens, sudoku solver, and...

Importance 89