Category Problem Type Count

Arrays 0
Handling single and multi-dimensional arrays 0
Rotating images 0
Finding subarray with a given sum 0
Implementing dynamic array structures like ArrayList or Vecto 0
Maximum product subarray 0
Two-sum problem 0
Kadane’s algorithm for maximum subarray sum 0
Array partitioning (rearrange according to pivot) 0
Dutch national flag problem (sort 0s, 1s, 2s) 0
Find the duplicate/missing number 0
Strings 0
String manipulation (reversing, converting) 0
Substring search (KMP algorithm) 0
Anagram checking 0
String encoding and compression 0
Longest common prefix or suffix 0
Palindrome check 0
String permutations 0
Minimum window substring 0
First unique character in a string 0
String to integer (atoi) implementation 0
Matrices 0
Matrix rotation 0
Spiral traversal 0
Search in a row-wise/column-wise sorted matrix 0
Flood fill algorithms 0
Set matrix zeroes (nullify rows & columns) 0
Matrix multiplication 0
Transpose matrix 0
Determinant of a matrix 0
Island counting (number of islands in a grid) 0
Longest increasing path in a matrix 0
Linked Lists 0
Reversing a linked list 0
Merging sorted linked lists 0
Detecting cycles 0
Finding the middle element 0
Handling doubly linked lists 0
Add two numbers represented by linked lists 0
Copy list with random pointer 0
Linked list cycle II 0
 Flatten a multilevel linked list 0
Rotate list 0
Stacks_Queues 0
Implementing undo/redo functionality 0
Balancing symbols (parentheses, brackets) 0
Postfix/prefix expression evaluation 0
Largest rectangle in histogram 0
Queue implementation with arrays or stacks 0
Level order traversal in trees 0
Implementing LRU cache 0
Circular queue design 0
Next greater element 0
Minimum element in stack 0
Dynamic_Programming 0
Fibonacci sequence 0
Knapsack problem 0
Coin change problem 0
Longest increasing subsequence 0
Matrix chain multiplication 0
Climbing stairs 0
Edit distance 0
Minimum path sum in a grid 0
Decode ways 0
Unique paths in a grid 0
Backtracking 0
N-Queens problem 0
Solving Sudoku 0
Permutation and combination problems 0
Hamiltonian paths and cycles 0
Combination sum 0
Letter combinations of a phone number 0
Palindrome partitioning 0
Generate parentheses 0
Word search 0
Additive number 0
Trees_Graphs 0
Binary search tree operations 0
AVL tree rotations 0
Finding LCA (Lowest Common Ancestor) 0
Serialize and deserialize a binary tree 0
Trie operations for word search 0
Binary tree right side view 0
Count good nodes in binary tree 0
 Diameter of binary tree 0
Binary tree maximum path sum 0
Construct binary tree from preorder and inorder traversal 0
Hash_Tables_Sets 0
Implementing a hash map 0
Handling collisions (chaining, open addressing) 0
Subarray sum equals K 0
Group anagrams 0
Design a hash set 0
Two sum 0
Three sum 0
Four sum 0
Group shifts 0
Longest consecutive sequence 0
Advanced_Data_Structures 0
Disjoint set unions (DSU) 0
Fenwick trees (Binary Indexed Tree) 0
Segment trees for range queries and updates 0
LRU cache 0
Implement Trie (Prefix Tree) 0
Add and search word 0
Merge K sorted lists 0
Find median from data stream 0
Insert delete getrandom O(1) 0
Range sum query - mutable 0
Sorting_Searching 0
Quick sort, merge sort, heap sort 0
Binary search in sorted arrays 0
Order statistics and median finding algorithms 0
Merge intervals 0
Insert interval 0
Search in rotated sorted array 0
Find peak element 0
Meeting rooms 0
Meeting rooms II 0
K closest points to origin 0
Greedy_Divide_Conquer 0
Activity selection problem 0
Huffman coding 0
Job sequencing problem 0
Fractional knapsack 0
Quick sort, merge sort 0
Best time to buy and sell stock 0
 Maximize profit in job scheduling 0
Gas station 0
Task scheduler 0
Jump game II 0
Graph_Algorithms 0
DFS, BFS for both connected and disconnected graphs 0
Network flow, minimum spanning tree algorithms 0
Shortest path in weighted graphs (Dijkstra, Bellman-Ford) 0
Clone graph 0
Course schedule 0
Course schedule II 0
Pacific Atlantic water flow 0
Number of connected components in an undirected graph 0
Redundant connection 0
Find the town judge 0
Advanced_Computational 0
Prime number generation (Sieve of Eratosthenes) 0
GCD and LCM calculations 0
Convex hull (Graham’s scan) 0
Kth smallest element in a sorted matrix 0
Find K pairs with smallest sums 0
Sliding window median 0
Max sum of rectangle no larger than K 0
Split array largest sum 0
Minimum window subsequence 0
Smallest range covering elements from K lists 0