MUSA MALIK
Sliding Window Pattern
Concept: Used for problems involving contiguous
subarrays or substrings.
1
MUSA MALIK
Two Pointer Pattern
Concept: Two pointers are used to solve problems
involving sorted arrays.
2
MUSA MALIK
Fast & Slow Pointers Pattern
Concept: Two pointers moving at different speeds
to find cycles.
3
MUSA MALIK
Merge Intervals Pattern
Concept: Merges overlapping intervals into one.
4
MUSA MALIK
Cyclic Sort Pattern
Concept: Sorts arrays containing numbers within
a known range.
5
MUSA MALIK
In-Place Reversal of Linked List Pattern
Concept: Reverses linked list sections in place.
6
MUSA MALIK
Tree Breadth-First Search (BFS) Pattern
Concept: Traverses nodes level by level in a
tree.
7
MUSA MALIK
Depth-First Search (DFS) Pattern
Concept: Explores nodes deeply before
backtracking.
8
MUSA MALIK
Two Heap Pattern
Concept: Uses two heaps to maintain dynamic
datasets.
9
MUSA MALIK
Subsets Pattern
Concept: Generates all subsets of a given set.
10
MUSA MALIK
Modified Binary Search Pattern
Concept: Searches efficiently in rotated or
partially sorted arrays.
11
MUSA MALIK
Bitwise XOR Pattern
Concept: Solves problems involving pairs using
XOR operations.
12
MUSA MALIK
Top 'K' Elements Pattern
Concept: Uses heaps to find the top K elements.
13
MUSA MALIK
K-Way Merge Pattern
Concept: Efficiently merges multiple sorted
arrays or lists.
14
MUSA MALIK
0/1 Knapsack Dynamic Programming Pattern
Concept: Optimizes selection under constraints
using dynamic programming.
15
MUSA MALIK
Topological Sort Graph Pattern
Concept: Finds a valid order of tasks in
Directed Acyclic Graphs (DAG).
16
