Home Pricing FAQ Blog

Loading...

Home Pricing FAQ Blog

Loading...

Table of Contents

Kruskal’s Minimum Spanning Tree
Prim’s Minimum Spanning Tree
Dijkstra’s Shortest Path
Interval Scheduling Maximization
Coin Change (Greedy Variant)
Fractional Knapsack
Huffman Coding
Job Scheduling (Minimizing Lateness)
Best-First Search (Greedy Best-First)
Activity Selection Problem

Kruskal’s Algorithm
Depth-First Search (DFS)
Topological Sort
Prim’s Algorithm
Tarjan’s SCC Algorithm
Dijkstra’s Algorithm
Johnson’s Algorithm
Floyd-Warshall Algorithm
Kosaraju’s SCC Algorithm
Bellman-Ford Algorithm
Breadth-First Search (BFS)
Maximum Flow (Ford-Fulkerson)

Heap Sort
Tim Sort
Selection Sort
Insertion Sort
Bucket Sort
Bubble Sort
Quick Sort
Counting Sort
Shell Sort
Merge Sort
Radix Sort
External Sort

Knapsack Problem (0/1)
Matrix Chain Multiplication
Egg Dropping Problem
Partition Problem
Fibonacci Sequence
Coin Change
Word Break Problem
Longest Common Subsequence (LCS)
House Robber Problem
Longest Increasing Subsequence (LIS)
Rod Cutting Problem
Edit Distance (Levenshtein Distance)

Inorder Traversal
Fenwick Tree (Binary Indexed Tree)
Preorder Traversal
Postorder Traversal
Segment Tree Construction
Lowest Common Ancestor (LCA) Computation
Red-Black Tree Insertion
Binary Search Tree Insertion
AVL Tree Rotations
Binary Search Tree Deletion

Aho-Corasick
Roling Hash (e.g.
Suffix Automaton
Manacher’s Algorithm
Suffix Tree Construction (Ukkonen’s Algorithm)
Suffix Array Construction
LCP Array Construction
Horspool’s Algorithm
Z-Algorithm
Knuth-Morris-Pratt (KMP)
Rabin-Karp
Boyer-Moore

Linear Probing
Separate Chaining
Quadratic Probing
Bloom Filter
Cuckoo Hashing
Hash Table Construction
Universal Hashing
Double Hashing
Perfect Hashing
Rolling Hash

Jump Search
Binary Search
Linear Search
Hash-Based Search
Best-First Search
Exponential Search
Fibonacci Search
Uniform-Cost Search
Breadth-First Search (BFS)
A* Search
Interpolation Search
Depth-First Search (DFS)

Generate Subsets Using Bit Masks
Reverse Bits of an Integer
Bitwise XOR for Single Element Detection
Check If Power of Two
Extracting and Setting Bits
Brian Kernighan’s Algorithm for Counting Set Bits
Compute XOR Prefix/Suffix Arrays
Swap Two Variables Using XOR

Hamiltonian Path Problem
Rat in a Maze
Cryptarithm Solver
Puzzle Solving
Combinations Generator
Graph Coloring
N-Queens Problem
Permutations Generator
Knight’s Tour
Sudoku Solver
Word Search Puzzle Solver
Subset Sum

Quick Sort
Convex Hull (Divide-and-Conquer)
Karatsuba Multiplication
Matrix Chain Multiplication (Divide-and-Conquer Variant)
Binary Search
Cooley-Tukey FFT
Closest Pair of Points
Strassen’s Matrix Multiplication
Merge Sort
Median of Medians

Remove Duplicates
Partition List
Detect Cycle
Insertion at Position
Find Middle Element
List Traversal
Reverse List
Palindrome Check
Merge Sorted Lists
Node Deletion

Semaphore Algorithm
Deadlock Prevention
Reader-Writer Lock
Parallel Reduction

Point in Polygon
Convex Hull
Line Intersection

Double-Ended Queue
Basic Queue Enqueue
Rate Limiting Queue
Message Queue
Priority Queue
Breadth-First Search
Round Robin Scheduling
Circular Queue
Queue Reversal
Basic Queue Dequeue

Gaussian Elimination
Linear Programming
Monte Carlo Method
Graham Scan
Convex Hull Algorithm
Newton-Raphson Method
QuickSort
Sieve of Eratosthenes

Sum Pairs
Slow-Fast Pointer
Reverse String
Merge Sorted Arrays
Three Sum
Container With Most Water
Sliding Window
Remove Duplicates
Palindrome Validation

Depth-First Search
Basic Stack Push
Infix to Postfix Conversion
Expression Evaluation
Min/Max Stack
Undo Mechanism
Balanced Parentheses Check
Recursion Simulation
Basic Stack Pop

Palindrome Checker
Power Function Implementation
Tower of Hanoi
Factorial Calculation
Directory File Traversal
Fibonacci Sequence

Huffman Coding
LZW Compression
Run-Length Encoding

Ethernet CSMA/CD
Dijkstra's Routing Algorithm
Nagle's Algorithm
Reed-Solomon Error Correction
Spanning Tree Protocol

Roling Hash (e.g.

Polynomial Rolling Hash)

Category: string

Loading...

Enjoy reading code with a tandem explainer?

Explain code with DocComment! Try out your own code!

DocComment is all you need to help you understand code. It gives you comprehensive explanations for any code, making it easier to understand and maintain.

Copyright © 2025 - All rights reserved

LINKS

Support Pricing Blog Classic Code Explanation

LEGAL

Terms of services Privacy policy Refund policy