Array
Backtracking
Blockchain
Chinese Remainder Theorem
Conversions
Binary to Octal
Decimal to Binary
+3
Decimal to Hexadecimal
Octal To Hexadecimal
Integer To Roman
Hexadecimal to Octal
Octal to Decimal
Binary to Decimal
+2
Octal to Binary
Binary to Hexadecimal
Decimal to Octal
Roman To Integer
Hexadecimal to Decimal
Hexa Decimal To Binary
Decimal to Any
Data Structures
Priority Queue
List Queue
Circular Queue
Min Heap Two
Min Heap
Max Heap
Quad Tree
Basic Binary Tree
Stack with Singly Linked List
+2
Balanced Brackets
Array Stack
Linked List
Cycle in Linked List
Hashing
Prime
+7
Divide and Conquer
Heaps Algorithm
Dynamic Programming
Kadanes Algorithm
Min Number of Jumps
Coin Change
+4
Longest Common Substring
Longest Common Subsequence
+1
01knapsack Recursive
Factorial
+10
Fizz Buzz
Kadane Algo
Graphs
Math
Two Sum
Sieve of Eratosthenes
+4
Average
Palindrome String Recursion
Abs Max
Perfect Number
Find Max
Ugly Numbers
Euler's Totient
+1
Sphenic Number
Abs
+4
Palindrome Number
Amicable Numbers
Factorial Approximation
Power of Two
Find Min
+1
Find Max Recursion
Fibonacci Dynamic Programming
Armstrong Number
+7
Pow
Sigmoid
Symmetric Derivative
Factorial Recursion
Find Min Recursion
Abs Min
Factors
Fibonacci Recursion
Fermats Little Theorem
Kynea Numbers
Shreedharacharya
Palindrome String
Relu Function
Simpson Rule
Linear Diophantine Eqn
Collatz
GCD
LCM
+2
Magic Number
N Bonacci
Numerical Analysis
Others
Haversine Formula
Swap All Odd and Even Bits
Moore Voting Algorithm
Tower of Hanoi
+1
Ackermann
Binpow
Searches
Binary Tree Traversal
Fibonacci Search
+4
Linear Search
+12
Ternary Search
+5
Binary Search Recursion
Peak Element
Jump Search
+7
Binary Search
+13
Interpolation Search
+4
Sorts
Quick Sort
+17
Cocktail Sort
Gnome Sort
+6
Bubble Sort
+17
Comb Sort
+7
Radix Sort
+7
Count Sort
Shell Sort
+7
Pigeonhole Sort
+2
Select Sort
Tim Sort
+1
Insert Sort
Merge Sort
+17
Heap Sort
+12
