- Contiguous Sub Array with Maximum Sum
- Finding Prime numbers using Sieve
- Prime Factorization using Sieve
- Printing all the subsets of an Array
- Finding Factorials using Recursion
- Finding GCD using Euclid's Algorithm
- Rainwater Trapping
- Checking if a number is a power of 2
- Knapsack
- Print all subsequences of a string
- Painting Fence
- Cutting A Rod
- Count Derangements
- Golomb Sequence
- Fibbonaci Number
- Longest Common Substring
- Longest Common Subsequence
- Longest Decreasing Subsequence
- Longest Increasing Subsequence
- Maximum Sum Increasing Subsequence
- Maximum Sum Decreasing Subsequence
- Subset Sum Problem
- Armstrong Number
- Automorphic Number
- Eulerian Number
- Palindrome Number
- Delannoy Number
- Perfect Number
- Pronic Number
- Krishnamurthy Number
- Lucas Number
- N'th Catalan Number
- Number of Digits
- Noble Integer
- Magic Number
- Mystery Number
- Neon Number
- Reverse a Number
- Strong Number
- Sum of Digits
- Sum of Divisors
- Stern's Diatomic Series
- Tower of Hanoi
- Tribonacci Series