The Algorithms
Array
Validate Subsequence
Backtracking
Open Knight Tour
Conversions
BinaryToHexadecimal
Hexadecimal to Decimal
Binary to Decimal
+1
Binary to Octal
Hexadecimal to Octal
Decimal to Octal
IntegerToRoman
Decimal to Any
RomanToInteger
Decimal to Binary
+1
OctalToHexadecimal
Octal to Binary
Octal to Decimal
HexaDecimalToBinary
Decimal to Hexadecimal
Data Structures
Quad Tree
Basic Binary Tree
Circular Queue
Priority Queue
List Queue
Cycle in Linked List
Linked List
Array Stack
Linked List Stack
BalancedBrackets
Min Heap Two
Max Heap
Min Heap
Hashing
Divide and Conquer
Heaps Algorithm
Dynamic Programming
Graphs
Math
Simpson Rule
Perfect Number
Factorial Approximation
FactorialRecursion
Fibonacci Recursion
Find Min
Palindrome String Recursion
Fermats Little Theorem
Amicable Numbers
Relu Function
Eulers Totient
Kynea Numbers
Sieve of Eratosthenes
+1
Abs
+1
Factors
Find Max Recursion
Pow
Sigmoid
PalindromeNumber
LinearDiophantineEqn
Palindrome String
Ugly Numbers
Abs Max
ArmstrongNumber
Find Max
Average
Shreedharacharya
Find Min Recursion
Prime Check
+1
Power of Two
Fibonacci Dynamic Programming
Sphenic Number
Symmetric Derivative
Abs Min
N Bonacci
Magic Number
GCD
Numerical Analysis
Others
Binpow
Fisher Yates Shuffle
Ackermann
Tower of Hanoi
Lcm
Moore Voting Algorithm
Collatz
Haversine Formula
Swap All Odd and Even Bits
FizzBuzz
Searches
Interpolation Search
+2
Jump Search
+5
Ternary Search
+3
Peak Element
Binary Search Recursion
Binary Search
+11
Fibonacci Search
Linear Search
+10
Binary Tree Traversal
Sorts
Cocktail Sort
Radix Sort
+7
Tim Sort
Pigeonhole Sort
Merge Sort
+16
Heap Sort
+11
Select Sort
Quick Sort
+15
Bubble Sort
+15
Insert Sort
Comb Sort
+6
Shell Sort
+7
Gnome Sort
+3
