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