psc0606 / aha-algorithm

Aha, algorithm by go

aha-algorithm

Aha, algorithm by go. See Chinese README.md

Table

String Matching

• BF
• KMP [M] [I]
• Wu-Manber(WM) Algorithm
• Shift-And Algorithm

Sort Algorithm

• Insertion Sort
• Bubble Sort
• Selection Sort
• Shell Sort
• Quick Sort
• Merge Sort
• Heap Sort
• Counting Sort
• Radix Sort
• Bucket Sort
• ...

Advanced Structure

• (Double Linked List)(src/list/double-linked-list.go)
• Disjoint Set (Union Find Set)
• Heap
• Treap (TODO)
• SkipList
• RB-Tree (TODO)
• Trie
• DAT (Double Array Tire) (TODO)
• B-Tree (TODO)
• B+Tree (TODO)
• B*Tree (TODO)
• R Tree (TODO)
• Segment Tree (TODO)
• Ternary Search Tree (TODO)
• FST (TODO)
• B* (Branch Star) (TODO)
• ...

Geo

• GeoHash (TODO)
• Mercator (TODO)
• ...

Probabilistic Data Structure

• HyperLogLog (TODO)
• Bloom Filter (TODO)
• Count-Min Sketch (TODO)
• ...

Cache

• LRU cache
• LRU with timestamp (TODO)
• LFU (TODO)
• W-TintyLFU (TODO)
• ...

Election Algorithm

• Boyer–Moore majority vote algorithm - paper link

Funny Problem

[E] means EASY, [M] means MEDIUM, [H] means HARD, [I] means INTERVIEW

---

Bits Operation

• Power Of Two [E]
• Hamming Distance [E]
• Counting Bits [M]
• Subsets [M]

---

Array

• Remove Duplicates From Sorted Array [E] [I]
• Move Zero [E] [I]
• Plus One [E] [I]
• Merge Sorted Array [E] [I]
• Intersection Of Two Arrays [E]
• Intersection Of Two ArraysII [E]
• Intersection Of Two ArraysIII [E]
• Intersection Of Two ArraysIV [E]
• Fibonacci Number [E]
• Two Sum [E] [I]
• Three Sum [M] [I]
• Spiral Matrix [M] [I]
• Spiral Matrix II [M]
• Top-k frequent elements [M]
• Search In Rotated Sorted Array [M]
• Find The Duplicate Number [M]
• Container With Most Water [M] [I]
• Rotate Array [M] [I]
• Group Anagrams [M] [I]
• K-th Largest Element In An Array [M] [I]
• Sliding Window Maximum [M] [I]
• Merge Intervals [M]
• Trap Rain Water [H] [I]

---

List

• Reverse List [E] [I]
• Remove Duplicates From Sorted List [E] [I]
• Remove Duplicates From Sorted List II [M] [I]
• First Common Linked List Node [E] [I]
• Merge Two Sorted Lists [M] [I]
• Remove n-th Node From End Of List [M]
• Linked List Cycle [E] [I]
• Linked List Cycle II [M] [I]
• Swap Nodes In Pairs [M] [I]
• Sort List [M]

---

Stack

• Minimum Stack [E] [I]
• Valid Parentheses [E] [I]
• Decode String [M]

---

Queue

• Sliding Window Maximum [M] [I]
• Design Circular Dequeue [M]

---

Dynamic Programming

• Climbing Stairs [E] [I]
• Best Time To Buy And Sell Stock [E]
• Best Time To Buy And Sell Stock With Cool Down [M]
• Task scheduler [M]
• Jump Game [M]
• Maximum Subarray [E] [I]
• Maximum Product Subarray [M]
• word break [M]
• Longest Palindromic Substring [M]
• Longest Substring Without Repeating Characters [M] [I]

---

Greedy

• Assign Cookies [E]
• Candy [H]

---

Knapsack problem

• Coin Change [M]
• Perfect Squares [M]

---

Tree

• Diameter Of Binary Tree [E]
• Invert Binary Tree [E]
• Minimum Depth Of Binary Tree [E]
• Maximum Depth Of Binary Tree [E]
• Path Sum [E] [I]
• Path Sum II [M] [I]
• Path Sum III [M]
• Validate Binary Search Tree [M]
• Unique binary search trees [M]
• Binary Tree Preorder-Inorder-Postorder Traversal [E]
• Tree Level Traversal [M]
• Tree Level TraversalII [M]
• Binary Tree Zigzag Level Order Traversal [M]
• Tree Preorder Traversal [M]
• Tree Inorder Traversal(non-recursive) [M] [I]
• N-ary Tree Level Order Traversal [M]
• N-ary Tree Preorder Traversal [M]
• N-ary Tree Postorder Traversal [M]
• Flatten Binary Tree To Linked List [M]
• LCA [M]
• kth Small Element In A Bst [M] [I]
• Binary Tree Right Side View [M] [I]

---

Graph

• Course Schedule [M]
• Minimum Spanning Tree, MST [M] [I]

---

Backtrace

• Letter Combinations Of A Phone Number [M]
• Generate Parenthesis [M] [I]
• Combination Sum [M]
• Permute [M]
• Number of Islands [M]
• Subsets [M]

Disjoint Set (Union Find Set)

• Accounts merge [M]
• Number of Islands [M]

Math

• Pow x^n [M] [I]

License