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