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