- Climbing the leaderboard
- EVENDIFF
- INTRVS
- SUMPOS
- Rat Problem
- 4Sum
- Longest Happy Prefix
- Single Number
- Candy
- 3Sum
- Valid Palindrome
- Breadth First Search
- Depth of Tree
- Height of Tree
- Kruskal's Algorithm
- Prim's Algorithm
- Prim's Algorithm - Dynamic
- Dijkstra's Algorithm
- Topological Sort/Ordering
- Hamiltonian Path
- Articulation Point
- Connected Components
- Strongly Connected Components - Kosaraju's Algorithm
- Strongly Connected Components - Tarjan's Algorithm
- Bipartite Graph
- Directed Acyclic Graph
- Detect Negative Cycle
- Depth First Search
- Bellman Ford
- Rotten Oranges
- Top view of binary tree
- Warshall Algorithm
- Area
- Binary Exponentiation
- Delannoy Number
- Least Common Multiple (LCM)
- GCD - Euclidean Algorithm
- Extended Euclidean Algorithm
- Fibonacci Sequence Recursion
- Factorial
- Double Factorial
- Large Number Factorial
- Sieve of Eratosthenes
- Fibonacci number
- Fibonacci number with Recursion
- Min Max Sum
- Check Armstrong Number
- Strassen's Matrix Multiplication
- Ackermann Function
- Chinese Remainder theorem
- Ugly Number
- Prime Number Iterative and Recursive
- Catalan Number
- Lucas Theorem
- GCD of 2 Numbers
- Palindrome
- Next nth Palindrome
- Sine Function
- Sum of Digits of a Number
- Sterns Diatomic Series
- Arctan Function
- Strong Number
- Noble Integer
- Next Prime Number
- Happy Number
- Magic Number
- Hamming Distance
- Natural Algorithm
- K-th Largest Number
- Transpose of matrix
- Tribonacci
- Neon Number
- Matrix addition
- Matrix Multiplication
- Sum of Divisors
- Count of Divisors
- Reverse a Number
- Count of Digits
- Lucky Numbers
- Perfect square less than n
- Perfect Number
- Harshad Number
- Roots of Quadratic Equation
- Sieve of Eratosthenes
- Pronic Number
- Positive Decimal to Binary
- Squares in N*N Chessboard
- Coin Change Problem
- Cutting A Rod
- Longest Common Subsequence
- Longest Common Substring
- Longest Decreasing Subsequence
- Longest Increasing Subsequence
- Binary Trees with N nodes
- Unique BST with N nodes
- Edit Distance
- Golomb Sequence
- Knapsack Unbounded
- Knapsack 0-1
- Knapsack Fractional
- Maximum Sum Increasing Subsequence
- Maximum Sum Decreasing Subsequence
- Ugly Numbers
- Dice Throw Problem
- Partition Problem
- Matrix-Chain-Multiplication
- Count Derangements
- Subset Sum
- Maximum Profit
- Tiling Problem 2xN
- Catalan Number