Interactive Algorithm Laboratory
📦 Data Structures
▼
🏗️
Binary Heap (Max-Heap)
O(log N) Insert/Extract
🏗️
Binary Heap (Min-Heap)
O(log N) Insert/Extract
➡️
Singly Linked List
Forward Pointers
↔️
Doubly Linked List
Two-way Pointers
🔄
Reverse Linked List
O(n)
🔍 Searching Algorithms
▼
🔍
Binary Search
🦘
Binary Jump Search
🎯
Lower Bound
🎯
Upper Bound
📊 Sorting
▼
🔵
Bubble Sort
O(N²)
📊
Selection Sort
O(N²)
📥
Insertion Sort
O(N²)
⛙
Merge Sort
O(N log N)
⚡
Quick Sort
O(N log N)
🕸️ Graph & Tree & List Algorithms
▼
🌲
Depth-First Search (DFS)
O(V + E) — Stack/Recursion
🌊
Breadth-First Search (BFS)
O(V + E) — Queue/Level-order
🔍
Cycle Detection (Floyd's Algorithm)
📉 Dynamic Programming
▼
∑
Kadane's Algorithm
O(N)
📉
Longest Common Subsequence
📈
Longest Increasing Subsequence
O(N²)
📈
Longest Increasing Subsequence (Patience Sorting)
O(N log N) — Binary Search
📉
Edit Distance
🧬
Longest Arithmetic Subsequence
🪜
Climbing Stairs
🛣️
Minimum Path Sum
📊
Arithmetic Slices I — Subarrays
Contribution Technique
🔢
Arithmetic Slices II — Subsequences
DP + Hash Map — O(N²)
🧬 Number Theory
▼
🧬
Sieve of Eratosthenes
O(N log log N)
🔄 Combinatorics
▼
🔄
Narayana's Permutation
Next Lex Order
🔢 Math
▼
⊞
Matrix Multiplication
O(N³)