If there is any feedback, please provide it anonymously in this Google form.
| Date | References | |
|---|---|---|
| Lecture 01 | 8th Jan 2025 | Introduction (Ch 1, 2.1) |
| Lecture 02 | 9th Jan 2025 | Recursive Algorithms (Ch 2.2.1, 2.2.2) |
| Quiz 01 | 10th Jan 2025 | quiz-01 |
| Lecture 03 | 15th Jan 2025 | Algorithm Design Examples (Ch 3.2) |
| Lecture 04 | 16th Jan 2025 | Algorithm Design Examples (Ch 3.2) |
| Lecture 05 | 17th Jan 2025 | Computing Recurrence |
| Lecture 06 | 21st Jan 2025 | Sorting (Ch 4.1, 4.2) |
We will use this Github repo to store the code. There are no individual links from problems to solutions. You can find corresponding solution in the repo using the problem name. The precise problem statement is mentioned at the start of the solution files in the comments.
| Name | Description | Name | Description |
|---|---|---|---|
| test-01 | Compute Fibonacci | test-02 | Missing Number |
| quiz-11 | Collatz Conjecture Sequence | quiz-12 | Largest Prime Factor |
| quiz-13 | Coin Piles | ||
| test-03 | Maximum Subarray Sum | test-04 | Increasing Array |
| test-05 | Two Knights | test-06 | Repetitions |
| test-07 | Permutations | test-08 | Tower of Hanoi |
| test-09 | Josephus Problem I | test-10 | Josephus Problem II |
| test-11 | Restaurant Customers | test-12 | Sum of Two Values |
| Nr. | Book | Authors |
|---|---|---|
| [1] | Guide to Competitive Programming | Antti Laaksonen |
| [2] | CSES Problem Set |