- Binary Exponentiation
- Euclidean algorithm for computing the greatest common divisor
- Extended Euclidean Algorithm
- Factorial without recursion
- Fibonacci Numbers
- Linear Diophantine Equations
- Modular Inverse
- Linear Congruence Equation
- Chinese Remainder Theorem
- Factorial modulo p
- Discrete Log
- Primitive Root
- Discrete Root
- Montgomery Multiplication
- All Unique Prime Factors ----> C++ | Java
- Binary to Decimal Number Transformation ----> C++ | Java
- Checking for Anagram ---->Python
- Check Prime Number ----> Java | Python
- Check Trimorphic number ---->C++ | Java
- Counting number of digits in factorial using Kamenetsky's Formula ----> Java
- Determining if a number is a prime number or not using Trial Division Algorithm ---> C++
- Factorial of a number using recursion ---->C++ | Python
- Factorial of a number without recursion ---->Python
- Fibonacci Series ----> Java
- GCD of two number using Euclidean Algorithm ----> Java | Python
- Geek-onacci Number----> C++
- Program to check a number is perfect ---> C++
- All Unique Prime Factors of any number N ----> C++
- Modular Exponentiation ----> C++
- Palindrome Number ---> C++ | Python
- Program to check a string is a pangram----> Python
- Square Root using Binary Search ----> Java
- Taylor's Series of e^x ----> Java
- Check Triautomorphic number ----> Java
- To check for palindrome number---->Java
- To find all prime number from 2 to N ----> C++
- Check Smith Number ----> Java
- Sliding Window Maximum ----> Python
- Pronic Number ---> C++