Week | Slides & Book Pages | | Reinforce Exercise | | Code Forces Exercise | | References | | | Find the Bugs | | |
1 | Basic C++Recursion Chapter 1Page 8 | | PointerFibonacci Number Calculate Nth Term | | Word Expression Pangram | | What is CP? Math Essentials Cheat Sheet | | | FTB1 FTB2 | | |
2 | Array | | Array | | Two Arrays And Swaps | | Linked List | | | FTB3 | | |
| Linked List | | Print LL | | Most Unstable Array | | | | | FTB4 | | |
| Chapter 3: 3.1,3.2, 3.3Page 77 | | Insert at beg Insert at end Insert at index | | Remove Duplicates | | Linked vs Array | | | | | |
3 | StackChapter 3: 3.6Page 103 | | Stack as Linked List and ArrayPush | | Lovely Palindromes Regular Bracket Sequence | | Stack Implementation Stack STL | | | FTB5 FTB6 | | |
| Wednesday September 9DROP DEADLINE | | Pop | | | | | | | | | |
| | | Print | | | | | | | | | |
4 | Queue + efficiency Chapter 3: 3.7Page 112 | | Queue EnqueueDequeue | | Queue at the School Queue | | Queue Implementation Queue STL | | | FTB7 FTB8 | | |
5 | Sorting + efficiency Chapter 2Page 51Chapter 7: 7.2,7.3Page 291 | | Bubble sort Binary search Linear Search Merge Sort Quicksort Insertion sort Bucket sort | | Sort the Array CardsTeams Forming | | Sorting Algorithms Big-O Cheat Sheet | | | FTB9 FTB10 | | |
6 | Programming Contest + | | | | Valid Parentheses | | | | | | | |
| Review | | | | Implement Stack using QueuesImplement Queue using Stacks Intersection of Two Arrays II | | | | | | | |
| | | | | Intersection of Two Linked Lists Middle of the Linked List | | | | | | | |
7 | Priority Queues HeapsChapter 6:Page 246 | | Priority Queue using QueueHeap Sort using priority queue | | Heap Operations Queue on Bus Stop | | Binary Heap Heap Sort | | | FTB11 | | |
8 | Hashing, Shell-Bucket- RadixChapter 5:Page 193Chapter 7.11Page 331 | | Linear Quadratic Double ChainSTL | | Registration system WinnerEquivalent Strings Implement Shell Sort | | Hashing Intro Bucket Sort Radix Sort | | | FTB15 FTB20 | | |
9 | TreesChapter 4:Page 121 | | Insert a node Contains a value Find Min and Max Remove a node Get level of node Get height of node | | Party | | VisualgoTree Traversals | | | FTB13 FTB14 | | |
10 | Programming Contest + Review | | | | Binary Tree Inorder Traversal Symmetric TreeInvert Binary Tree Path SumDesign Circular Queue | | | | | | | |
11 | BST ImplementationChapter 5:Page 193 | | Basic ADTs Add a node Find a value Delete a node | | BST height Valid BST | | BST Implementation | | | FTB16 | | |
12 | AVL Trees, B-Tree Chapter 4:Page 144Chapter 4:Page 168 | | Add a node and balance AVL TreeB-Tree problem set | | Christmas SpruceNew Year Transportation Self Balancing Tree | | VisualgoAVL Insertion B-Tree Intro | | | FTB17 | | |
13 | Graphs Chapter 9:Page 413, 419 | | Tracing problems DFS, BFS, Kruskal, Prim | | Two ButtonsOstap and Grasshopper | | Greedy Kruskal’s Prim’s | | | FTB18 FTB19 | | |
14 | Graphs Chapter 9:Page 391, 453Chapter 10:Page 453 | | Tracing problems Dijkstra’s + Huffman Code(optional) | | PlanetsPaths and Trees | | Dijkstra’s Huffman Code Tracing Dijkstra’s | | | FTB21 | | |
15 | Programming Contest + | | Design HashMap | | | | | | | | | |
| Review | | Two SumSearch in a Binary Search Tree Merge Two Binary Trees | | | | | | | | | |
| | | Destination CityKth Largest Element in an Array | | | | | | | | | |