Data Structures & Algorithms

Interactive Mindmap - Complete Reference Guide

Total Topics: 0
Expanded: 0
Visible: 0
Static Arrays
Dynamic Arrays
Multidimensional Arrays
Jagged Arrays
Insertion
Deletion
Searching
Traversal
Sorting
Division Method
Multiplication Method
Universal Hashing
Cryptographic Hash
Chaining
Open Addressing
Linear Probing
Quadratic Probing
Double Hashing
Bubble Sort
Selection Sort
Insertion Sort
Cocktail Sort
Gnome Sort
Quick Sort
Merge Sort
Heap Sort
Shell Sort
Tim Sort
Intro Sort
State Space Tree
Pruning
Backtrack Function
Branch and Bound
Generate Permutations
Generate Combinations
Subsets Generation
Partition Problems
N-Queens Problem
Sudoku Solver
Knight's Tour
Maze Solving
Graph Coloring
Hamiltonian Path
Sum of Subsets
KMP Algorithm
Rabin-Karp
Boyer-Moore
Aho-Corasick
Suffix Array
Manacher's Algorithm
Longest Common Subsequence
Longest Common Substring
Edit Distance
Levenshtein Distance
Point in Polygon
Line Intersection
Distance Calculations
Convex Hull
Closest Pair of Points
Voronoi Diagrams
Delaunay Triangulation
GCD and LCM
Prime Number Tests
Sieve of Eratosthenes
Modular Arithmetic
Extended Euclidean Algorithm
Chinese Remainder Theorem
Fast Exponentiation
Miller-Rabin Primality Test
AND, OR, XOR
Left/Right Shift
NOT Operation
Bit Counting
Subset Generation
Power Set
Bitmasking
Fast Multiplication
Big O Notation
Big Omega (Ω)
Big Theta (Θ)
Little o and ω
O(1) - Constant
O(log n) - Logarithmic
O(n) - Linear
O(n log n) - Linearithmic
O(n²) - Quadratic
O(n³) - Cubic
O(2ⁿ) - Exponential
O(n!) - Factorial
Auxiliary Space
In-place Algorithms
Space-Time Tradeoffs
Memory Optimization
Recurrence Relations
Master Theorem
Substitution Method
Iteration Method
Recursion Tree Method
Best Case Analysis
Average Case Analysis
Worst Case Analysis
Amortized Analysis
Make Set
Find
Union
Path Compression
Union by Rank
Union by Size
Hash Functions
False Positives
Space Efficiency
Applications
Multiple Levels
Probabilistic Balancing
Search Operations
Insert/Delete
Standard Trie
Compressed Trie
Suffix Trie
Radix Tree
Patricia Tree
Range Sum Query
Range Min/Max Query
Lazy Propagation
2D Segment Tree
Prefix Sum
Point Update
Range Update
2D BIT
Sparse Table
Square Root Decomposition
P (Polynomial Time)
NP (Non-deterministic Polynomial)
NP-Complete
NP-Hard
EXP (Exponential Time)
PSPACE
NPSPACE
LOGSPACE
Traveling Salesman Problem
Knapsack Problem
Graph Coloring
3-SAT
Hamiltonian Path
Clique Problem
Vertex Cover
Subset Sum
Approximation Ratio
PTAS (Polynomial Time Approximation Scheme)
FPTAS (Fully PTAS)
Greedy Approximations
PRAM Model
BSP Model
LogP Model
MapReduce Model
Divide and Conquer
Prefix Sum
Matrix Multiplication
Sorting Networks
Byzantine Fault Tolerance
Paxos Algorithm
Raft Algorithm
Consistent Hashing
Distributed Hash Tables
Merkle Trees
Lock-free Data Structures
Wait-free Data Structures
Atomic Operations
Memory Models
Counting Sort
Radix Sort
Bucket Sort
Pigeonhole Sort
Topological Sort
External Sort
Parallel Sort
Stable Sort
In-Place Sort
Simple Linear Search
Sentinel Linear Search
Recursive Linear Search
Iterative Binary Search
Recursive Binary Search
Ternary Search
Exponential Search
Interpolation Search
Fibonacci Search
Depth-First Search
Breadth-First Search
Best-First Search
A* Search
Beam Search
Naive Pattern Search
KMP Algorithm
Rabin-Karp Algorithm
Boyer-Moore Algorithm
Z Algorithm
Aho-Corasick Algorithm
Recursive DFS
Iterative DFS
DFS Applications
BFS Implementation
Level-wise Traversal
BFS Applications
Dijkstra's Algorithm
Bellman-Ford Algorithm
SPFA Algorithm
Floyd-Warshall Algorithm
Johnson's Algorithm
Kruskal's Algorithm
Prim's Algorithm
Borůvka's Algorithm
Ford-Fulkerson Algorithm
Edmonds-Karp Algorithm
Dinic's Algorithm
Push-Relabel Algorithm
DFS-based Detection
Union-Find Detection
Floyd's Cycle Detection
Kahn's Algorithm
Memoization (Top-down)
Tabulation (Bottom-up)
Space Optimization
Fibonacci Sequence
Climbing Stairs
House Robber
Maximum Subarray
Longest Common Subsequence
Edit Distance
Palindromic Subsequence
Word Break
Knapsack Problem
Coin Change
Rod Cutting
Matrix Chain Multiplication
Tree Diameter
Binary Tree Maximum Path
Tree Rerooting
Greedy Choice Property
Optimal Substructure
Greedy vs DP
Activity Selection
Job Scheduling
Interval Scheduling
Fractional Knapsack
Huffman Coding
Gas Station
Divide Phase
Conquer Phase
Combine Phase
Base Case
Binary Search
Merge Sort
Quick Sort
Strassen's Matrix Multiplication
Closest Pair of Points
Maximum Subarray
Singly Linked List
Doubly Linked List
Circular Linked List
Doubly Circular
Insert at Beginning
Insert at End
Insert at Position
Delete Node
Search
Reverse
Push
Pop
Peek/Top
IsEmpty
Size
Function Calls
Expression Evaluation
Parentheses Matching
Undo Operations
Backtracking
Simple Queue
Circular Queue
Priority Queue
Double-ended Queue
Enqueue
Dequeue
Front
Rear
IsEmpty
IsFull
Complete Binary Tree
Full Binary Tree
Perfect Binary Tree
Balanced Binary Tree
Skewed Binary Tree
AVL Tree
Red-Black Tree
Splay Tree
Treap
Inorder
Preorder
Postorder
Level Order
B-Tree
B+ Tree
Trie
Suffix Tree
Segment Tree
Fenwick Tree
Directed Graph
Undirected Graph
Weighted Graph
Unweighted Graph
Connected Graph
Disconnected Graph
Cyclic Graph
Acyclic Graph
Adjacency Matrix
Adjacency List
Edge List
Incidence Matrix
Max Heap
Min Heap
Binary Heap
Fibonacci Heap
Binomial Heap
Insert
Extract Min/Max
Peek
Heapify
Decrease Key
Delete