This page contains an archive of scribbling boards from our book club meetings on Competitive Programmer's Handbook (Antti Laaksonen) and CSES Problem Set.

Quick links:

Note that this set of boards is not meant to be a systematic exposition of topics covered in the handbook and the problem set. Instead this is just a collection of examples that illustrate some of the concepts we have come across while studying these resources. These boards were used to aid the discussions during our club meetings. As a result, the content of these boards is informal in nature and is not intended to be a substitute for the handbook or the actual club meetings.

If you find any mistakes in the content of the board files, please create a new issue or send a pull request.

- 001: Weird Algorithm: Collatz Conjecture
- 005: Permutations: Start With \( n \) or \( n - 1 \)
- 005: Permutations: End With \( 2 \) or \( 1 \)
- 005: Permutations: Start With \( 1 \) or \( 2 \)
- 005: Permutations: Insert \( n \) in the Solution for \( n - 1 \)
- 006: Number Spiral: Edges
- 006: Number Spiral: Diagonal
- 007: Two Knights: Incremental Solution: Introduction
- 007: Two Knights: Incremental Solution: Cases
- 007: Two Knights: Incremental Solution: Formula
- 007: Two Knights: Closed Form Expression
- 007: Two Knights: Blocks in Grid: General Formula
- 008: Two Sets: Necessary Condition for Solution
- 008: Two Sets: Solution for \( [k .. k - m + 1] \) With Consecutive Integers
- 008: Two Sets: Solution for \( [k .. k - m + 1] \) With Alternate Integers
- 008: Two Sets: Solution for \( [1 .. n] \)
- 008: Two Sets: Adding Each Integer to the Set With Smaller Sum
- 010: Trailing Zeros: Illustration
- 010: Trailing Zeros: Legendre's Formula
- 011: Coin Piles: Necessary Conditions for Emptying Both Piles
- 011: Coin Piles: Necessary Conditions Shown Algebraically
- 011: Coin Piles: Sufficient Conditions
- 012: Palindrome Reorder: Cases to Consider
- 013: Gray Code: XOR Operation
- 013: Gray Code: Observing the Reflect-And-Prefix Pattern
- 013: Gray Code: Expressing the Reflect-And-Prefix Pattern
- 013: Gray Code: Reflected Sequence of Two Symbols
- 013: Gray Code: Reflected Sequence of Repetitions of Two Symbols
- 013: Gray Code: Reflected Sequence of Power-Of-Two Repetitions of Two Symbols
- 013: Gray Code: XOR Rule for Reflect-And-Prefix Method
- 014: Tower of Hanoi: Illustration of Solution
- 014: Tower of Hanoi: Illustration of Recursion
- 014: Tower of Hanoi: Minimum Number of Moves
- 015: Creating Strings: Number of Strings
- 015: Creating Strings: Factorial and Integer Size
- 015: Creating Strings: Recursive Solution
- 015: Creating Strings: Representing String With Frequency Count
- 015: Creating Strings: Algorithm for Next Permutation
- 016: Apple Division: Iterative Solution
- 016: Apple Division: Recursive Solution
- 017: Chessboard and Queens
- 018: Digit Queries: Recurrence Relation and Closed-Form Expression
- 018: Digit Queries: Finding \( k \)th Digit
- 021: Apartments: An Example