Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Algorithm List
- Backtraking
- Knight's tour problem
- N Queens Problem
- Cryptography
- Affine Cipher
- Caesar Cipher
- Dynamic Programming
- Catalan Number
- Fibonacci Sequence
- Integer Partition
- Knapsack Problem
- Longest Common Subsequence
- Longest Increasing Subsequence
- Longest Palindromic Subsequence
- Maximum Subarray
- Maximum Sum Path
- Pascal's Triangle
- Shortest Common Supersequence
- Sliding Window
- Ugly Numbers
- Graph Search
- Bellman-Ford
- BFS
- Find-Bridges
- DFS
- Depth-Limited Search
- Dikstra
- Folyd-Warshall
- PageRank Algorithm
- Topological-Sort
- Greedy
- Job Scheduling Algorithm
- Majority Element(Boyer–Moore majority vote algorithm)
- Minimum Spanning Tree
- Kruskal's Algorithm
- Prim's Algorithm
- Number Theory
- Euclidean Algorithm
- Sieve of Eratosthenes
- Search
- Binary Search
- Sorting
- Bucket Sort
- Bubble Sort
- Comb Sort
- Counting Sort
- Cycle Sort
- Heapsort
- Insertion Sort
- Merge Sort
- Pigeonhole Sort
- Quicksort
- Radix Sort
- Selection Sort
- Shellsort
- Pancake Sort
- String
- Edit Distance (レーベンシュタイン距離,編集距離)
- KMP Substring Search
- Rabin-karp Algorithm
- Suffix Array (construction & usage)
- Z Algorithm
- Tree
 - Binary Search Tree (二分探索木)
- Binary Tree Traversal (木構造の横断)
- Lowest Common Ancestor
- Uncategorized
- Flood Fill
- Cellular Automate
- Create Maze
- Magic Square
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.