Backtracking
N Queens
Ciphers
Data Structures
Divide and Conquer
Convex Hull
Dynamic Programming
Knapsack
Is Subsequence
Coin Change
+1
Maximal Square
Longest Increasing Subsequence
Longest Continuous Increasing Subsequence
Longest Common Subsequence
Maximum Subarray
Edit Distance
+2
EggDropping
Rod Cutting
General
Kmeans
Geometry
Closest Points
Graphs
Hashing
Sha256
Math
Others
Hanoi
Searches
Sorts
Counting Sort
+5
Selection Sort
+11
Radix Sort
+7
Quick Sort
+15
Bubble Sort
+15
Shell Sort
+7
Insertion Sort
+14
Odd Even Sort
Stooge Sort
Cocktail Shaker Sort
Merge Sort
+16
Comb Sort
+7
Heap Sort
+12
