Array
Backtracking
Bitmanipulation
Swap All Odd and Even Bits
Konvertierungen
Decimal to Any
Decimal to Binary
+5
Decimal to Hexadecimal
Decimal to Octal
Integer To Roman
Binary to Decimal
+4
Binary to Hexadecimal
Binary to Octal
Hexa Decimal To Binary
Hexadecimal to Decimal
Hexadecimal to Octal
Octal to Binary
Octal to Decimal
Octal to Hexadecimal
Roman To Integer
Datenstrukturen
Hashing
Max Heap
Min Heap
Min Heap Two
Circular Queue
List Queue
Priority Queue
Array Stack
Stack with Singly Linked List
+3
Basic Binary Tree
Cycle in Linked List
Linked List
+1
Merge Sorted List
Prime
+8
Teile und herrsche
Dynamische Programmierung
01knapsack Recursive
Coin Change
+6
Kadanes Algorithm
Longest Common Subsequence
+1
Longest Common Substring
Min Number of Jumps
Factorial
+13
Fizz Buzz
Kadane Algo
Graphen
Lineare Algebra
Lu Decomposition
Mathematik
Two Sum
Armstrong Number
+8
Kynea Numbers
Linear Diophantine Eqn
Ugly Numbers
Abs
+5
Abs Max
Abs Min
Amicable Numbers
Average
Euler's Totient
+2
Factorial Approximation
Factorial Recursion
Factors
Fermats Little Theorem
Fibonacci Dynamic Programming
Fibonacci Recursion
Find Max
Find Max Recursion
Find Min
+1
Find Min Recursion
Newton Method
Palindrome Number
Palindrome String
Palindrome String Recursion
Perfect Number
+7
Pow
Power of Two
Relu Function
Shreedharacharya
Sieve of Eratosthenes
+4
Sigmoid
Simpson Rule
Sphenic Number
Symmetric Derivative
LCM
+2
N Bonacci
Chinese Remainder Theorem
Collatz
GCD
Magic Number
Andere
Suchen
Binary Tree Traversal
Binary Search
+15
Binary Search Recursion
Fibonacci Search
+5
Interpolation Search
+6
Jump Search
+8
Linear Search
+14
Peak Element
Ternary Search
+5
Sortieren
Fisher Yates Shuffle
Bubble Sort
+19
Cocktail Sort
+3
Comb Sort
+8
Count Sort
Gnome Sort
+8
Heap Sort
+15
Insert Sort
Pigeonhole Sort
+2
Quick Sort
+19
Radix Sort
+9
Select Sort
Shell Sort
+10
Tim Sort
+3
Stacks
Balanced Brackets
Strings
Hamming Distance
+7
