- Artificial Intelligence
- Backtracking
- Bit Manipulation
- Cellular Automaton
- Ciphers
- Computational Geometry
- Cryptography
- Data Structures
- Divide and conquer
- Dynamic Programming
- Gaming Theory
- Graphs
- Greedy Algorithms
- Math
- Networking
- Numerical Analysis
- Operating system
- Randomized Algorithms
- Searches
- Selections Algorithms
- Sorting
- Strings
- Online Challenges
- Others
- Queue
- Stack
- Linked List
- Coin Change
- Edit Distance
- Knapsack
- Longest common subsequence
- Longest Path
- Ways to Cover
- Fibonacci Numbers
- Rod Cutting
- Bellman Ford
- Breadth-first search
- Count Disconnected Components
- Depth-first search
- Dijkstra
- Floyed Warshall
- Prims Adjacency List
- Topo-Sort
- Collatz
- Euclids Greatest common divisor
- Factorial
- Greatest common divisor of array
- Least common multiple of array
- Lucky Numbers
- Modular Exponentiations
- nth Fibonacci Number using Goldenratio
- Armstrong Numbers
- Termo Conversion
- Pascal Triangle
- Modular Exponentiation
- Maximum Subarray Problem
- Eulers Totient (Phi-function)
- Slicker Algorithm
- Bubble Sort
- Heap Sort
- Heap Sort without vectors
- Insertion Sort
- Merge Sort
- Quick Sort
- Selection Sort
- Sort Vector
- Tree Sort
- Counting Sort
- Bogo-Sort
- Radix-Sort
- Rank Sort
- Shell Sort
- Stooge Sort
- Shaker Sort
- Anagram Check
- Lexicographic Ranking
- Longest Palindrome Subset
- Naive Search
- Permutations of string
- Print duplicate string
- Rabin Karp
- Remove Adjacent Duplicates
- Remove Duplicates
- Reverse String
- Naive Search
This work is released under MIT License
To the extent possible under law, Carlos Abraham has waived all copyright and related or neighboring rights to this work.
