hello-algo
hello-algo copied to clipboard
Writing Kanban
Please feel free to drop your comments and expectations about this book to us.
| Chapter | Section | Status | Author | To-dos |
|---|---|---|---|---|
| Introduction | Algorithms are everywhere | Completed | @krahets | |
| Introduction | What is DSA | Completed | @krahets | |
| Introduction | Summary | Completed | @krahets | |
| Computational Complexity | Performance evaluation | Completed | @krahets | |
| Computational Complexity | Time complexity | Completed | @krahets | |
| Computational Complexity | Space complexity | Completed | @krahets | |
| Computational Complexity | Space-Time tradeoff | Completed | @krahets | |
| Computational Complexity | Summary | Completed | @krahets | |
| Data Structure | Classification of data structure | Completed | @krahets | |
| Data Structure | Number encoding | Completed | @krahets | |
| Data Structure | Character encoding | Completed | @krahets | |
| Data Structure | Summary | Completed | @krahets | |
| Array And LinkedList | Array | Completed | @krahets | |
| Array And LinkedList | Linked List | Completed | @krahets | |
| Array And LinkedList | Dynamic array | Completed | @krahets | |
| Array And LinkedList | Summary | Completed | @krahets | |
| Stack And Queue | Stack | Completed | @krahets | |
| Stack And Queue | Queue | Completed | @krahets | |
| Stack And Queue | Deque | Completed | @krahets, @FangYuan33 | |
| Stack And Queue | Summary | Completed | @krahets | |
| Hashing | Hash Map | Completed | @krahets | |
| Hashing | Hash Collision | Completed | @krahets | |
| Hashing | Hash Algorithm | Completed | @krahets | |
| Hashing | Summary | Completed | @krahets | |
| Tree | Binary Tree | Completed | @krahets | |
| Tree | Binary Tree Traversal | Completed | @krahets | |
| Tree | Binary Tree Representation | Completed | @krahets | |
| Tree | Binary Search Tree | Completed | @krahets | |
| Tree | AVL Tree | Completed | @krahets, @mgisr | |
| Tree | Summary | Completed | @krahets | |
| Heap | Heap | Completed | @krahets | |
| Heap | Building Heap | Completed | @krahets | |
| Heap | Top-K Problem | Completed | @krahets | |
| Heap | Summary | Completed | @krahets | |
| Graph | Graph | Completed | @krahets | |
| Graph | Basic Operation of Graph | Completed | @krahets | |
| Graph | Graph Traversal | Completed | @krahets | |
| Graph | Summary | Completed | @krahets | |
| Searching | Binary Search | Completed | @krahets | |
| Searching | Binary Search Edge | Completed | @krahets | |
| Searching | Replace linear by hashing | Completed | @krahets | |
| Searching | Searching algorithm revisited | Completed | @krahets | |
| Searching | Summary | Completed | @krahets | |
| Sorting | Sorting | Completed | @krahets | |
| Sorting | Selection Sort | Completed | @krahets | |
| Sorting | Bubble Sort | Completed | @krahets | |
| Sorting | Insertion Sort | Completed | @krahets | |
| Sorting | Selection Sort | Completed | @krahets | |
| Sorting | Quick Sort | Completed | @krahets | |
| Sorting | Merge Sort | Completed | @krahets | |
| Sorting | Heap Sort | Completed | @krahets | |
| Sorting | Bucket Sort | Completed | @krahets | |
| Sorting | Counting Sort | Completed | @krahets | |
| Sorting | Radix Sort | Completed | @krahets | |
| Sorting | Summary | Completed | @krahets | |
| Divide and Conquer | Divide and Conquer Algorithm | Completed | @krahets | |
| Divide and Conquer | Binary Search Recur | Completed | @krahets | |
| Divide and Conquer | Build Tree Problem | Completed | @krahets | |
| Divide and Conquer | Hanota Problem | Completed | @krahets | |
| Divide and Conquer | Summary | Completed | @krahets | |
| Backtracking | Backtracking Algorithm | Completed | @krahets | |
| Backtracking | Permutations Problem | Completed | @krahets | |
| Backtracking | Subset sum Problem | Completed | @krahets | |
| Backtracking | N Queens Problem | Completed | @krahets | |
| Backtracking | Summary | Completed | @krahets | |
| Dynamic Programming | Introduction to DP | Completed | @krahets | |
| Dynamic Programming | DP Problem Features | Completed | @krahets | |
| Dynamic Programming | DP Solution Pipeline | Completed | @krahets | |
| Dynamic Programming | 0-1 Knapsack | Completed | @krahets | |
| Dynamic Programming | Unbounded Knapsack | Completed | @krahets | |
| Dynamic Programming | Edit Distance | Completed | @krahets | |
| Dynamic Programming | Summary | Completed | @krahets | |
| Greedy | Greedy Algorithm | Completed | @krahets | |
| Greedy | Fractional Knapsack Problem | Completed | @krahets | |
| Greedy | Max Capacity Problem | Completed | @krahets | |
| Greedy | Max Product Cutting Problem | Completed | @krahets | |
| Greedy | Summary | Completed | @krahets |
- Lens feature of gitbook ?! (AI)