Array
1 item
Backtracking
1 item
Binary Search
1 item
Bit Manipulation
One-line summary: Operate directly on bits — XOR, AND, OR, shifts — for elegant O(1) tricks that would otherwise require O(n) logic.
Bloom Filter
A bloom filter is a space-efficient probabilistic
Cryptography
4 items
Disjoint Set
Disjoint-set data structure (also called a union–find data structure or merge–find set) is a data
Doubly Linked List
In computer science, a doubly linked list is a linked data structure that
Dynamic Programming
1 item
Graphs
15 items
Greedy
1 item
Hash Table
In computing, a hash table (hash map) is a data
Hashing (Map / Set)
One-line summary: Use a hash table to achieve O(1) average-time lookup, insertion, and deletion — turning O(n²) brute-force into O(n).
Heap (Priority Queue)
One-line summary: A complete binary tree satisfying the heap property — O(log n) insert and extract-min/max, the engine behind Top-K, median, K-way merge, and scheduling algorithms.
Image Processing
1 item
DSA Concepts
Learn data structures and algorithms from simple to advanced with a structured, topic-wise roadmap.
Kadane's Algorithm
One-line summary: Find the maximum-sum contiguous subarray in O(n) by tracking the best sum ending at each position.
Linked List
3 items
Least Recently Used (LRU) C...
A Least Recently Used (LRU) Cache organizes items in order of use, allowing you to quickly identify which item hasn't been used for the longest amount of time.
Math
21 items
Matrix
One-line summary: 2D arrays — master spiral traversal, layer-by-layer rotation, and diagonal/anti-diagonal iteration.
Machine Learning Algorithms
2 items
Monotonic Stack
One-line summary: A stack that maintains a strictly increasing or decreasing order — enabling O(n) solutions for "next greater/smaller element" and span problems.
Prefix Sum
One-line summary: Pre-compute cumulative sums so any range query sum(L..R) is answered in O(1) after O(n) preprocessing.
Printing Patterns
5 items
Priority Queue
In computer science, a priority queue is an abstract data type
Queue
1 item
Recursion
1 item
School Level Basics
9 items
Search
5 items
Sets & Combinatorics
11 items
Sliding Window
One-line summary: Move a window over the input to solve subarray/substring problems in O(n) instead of O(n²).
Sorting
11 items
Stack
2 items
Statistics
1 item
Strings
9 items
Trees
8 items
Trie
In computer science, a trie, also called digital tree and sometimes
👉 Two Pointers
One-line summary: Use two indices that move toward each other (or in the same direction) to eliminate the O(n²) nested loop — achieving O(n) on sorted data.
Uncategorized Problems
9 items