nathaliaop / training

Training

Problems for practicing competitive programming techniques

Summary

• Day 1 - DP Theory

  • [USACO] Hoof Paper Scissors: iterative and recursive
  • [CODEFORCES] Mortal Kombat Tower: iterative and recursive
  • [USACO] Time is Mooney: iterative and recursive

• Day 2 - Knapsack

  • [CSES] Coin Combinations I: iterative and recursive
  • [CSES] Dice Combinations: iterative and recursive
  • [CODEFORCES] Joyride: iterative and recursive
  • [ATCODER] Knapsack: iterative and recursive
  • [CSES] Minimizing Coins: iterative and recursive

• Day 3 - Paths on Grids

  • [USACO] Cow Checklist: iterative and recursive
  • [CSES] Grid Paths: iterative and recursive
  • [LEETCODE] Longest Common Subsequence: iterative and recursive
  • [USACO] Radio Contact: iterative and recursive

• Day 4 - Order matters

  • [CSES] Book Shop: iterative, recursive and iterative alternative
  • [CSES] Coin Combinations II: iterative and recursive
  • [ATCODER] LCS: iterative and recursive
  • [CSES] Money Sums: iterative and recursive

• Day 5 - Longest Increasing Subsequence

  • Material:
    • CSES, pg. 80, 7.2 Longest increasing subsequence
    • CP Algorithms, Longest increasing subsequence
  • [CSES] Inscresing Subsequence: quadratic base for segtree, segtree, quadratic base for binary search and binary search
  • [CSES] Towers: solution
  • [CSES] Consecutive Subsequence: solution
  • [Codeforces] LCS on Permutations: solution

• Day 6 - Bitmask DP

  • Material:
    • CSES Handbook, pg. 187, 19.2 Hamiltonian Paths
    • CSES Handbook, pg. 112, 10.5 DP on bits
    • A Primer on Bitmask DP
    • Dynamic Programming, pg. 37, 6. Bitmasking
  • [CSES] Hamiltonian Flights: solution
  • [ATCODER] Matching: solution
  • [ATCODER] Pac-Takahashi: solution

• Day 7 - Digit DP

  • Material:
    • Codeforces Blog Digit DP
    • Dynamic Programming, pg. 30, 5. Digits
  • [SPOJ] Digit Sum: solution
  • [LIGHTOJ] Investigation: solution

• Day 8 - General Review

  • [ATCODER] Frog 1: iterative and recursive
  • [ATCODER] Frog 2: iterative and recursive
  • [ATCODER] Vacation: iterative and recursive
  • [ATCODER] Longest Path: solution

• Day 9 - Knapsack 2

  • [USACO] Fruit Feast: iterative and recursive
  • [CSES] Two Sets II: solution

• Day 10 - Grid Paths 2

  • Material:
    • Handbook, pg. 81, 7.3 Paths in a grid
    • Programiz - Longest Common Subsequence
  • [CSES] Array Description: iterative and recursive
  • [CSES] Edit Distance: solution and solution with path recovery

• Day 11 - General Review 2

  • [USACO] Teamwork: solution
  • [USACO] Why Did the Cow Cross the Road II: solution
  • [USACO] Snakes: solution

• Day 12 - Digit DP 2

  • Material:
    • Geek for geeks
  • [USACO] Odometer: solution
  • [CSES] Counting Numbers: solution

• Day 13 - Digit DP 3

  • [ATCODER] Digit Sum: solution
  • [LIGHTOJ] Digit Count: solution
  • [SPOJ] Ra One Numbers: solution
  • [SPOJ] G-One Numbers: solution
  • [SPOJ] LUCIFER Number: solution

• Day 14 - Range DP

  • [USACO] Modern Art 3: solution
  • [CODEFORCES] Clear the String: solution
  • [CODEFORCES] Vasya and Binary String: solution

• Day 15 - Kadane

  • [LEETCODE] Maximum Subarray: solution
  • [CSES] Maximum Subarray Sum: iterative and recursive
  • [CODEFORCES] Beautiful Array: solution

• Day 16 - Greedy Algorithms with Sorting

  • [USACO] Studying Algorithms: solution
  • [CSES] Movie Festival: solution
  • [CSES] Tasks and Deadlines: solution
  • [CSES] Movie Festival II: solution

• Day 17 - Prefix Sum

  • [USACO] Subsequences Summing to Sevens: solution
  • [USACO] Hoof, Paper, Scissors: prefix sum and dp
  • [CSES] Subarrray Sums II: solution
  • [CSES] Subarray Divisibility: solution
  • [CSES] Range Xor Queries: solution
  • [SPOJ] Maximum Sum Sequences: solution

• Day 18 - 2-SAT

  • Material:
    • CP-Algorithms
    • Codeforces 2-SAT Tutorial
    • Handbook, pg. 167, Chapter 17 Strong connectivity
  • [CSES] Giant Pizza: solution
  • [CODEFORCES] Exam Period: solution
  • [CODEFORCES] The Door Problem: solution

• Day 19 - Maximum Flow 1

  • Material:
    • Maximum Flow Intuition
    • Dinic's Algorithm
    • Dinic's Algorithm Source Code
    • Handbook, pg. 191, Chapter 20 Flows and cuts
  • [CSES] Download Speed: solution
  • [CSES] Distinct Routes: solution
  • [SPOJ] Fast Maximum Flow: solution

• Day 20 - Maximum Flow 2

  • [CSES] School Dance: solution
  • [CSES] Police Chase: solution

• Day 21 - Convex Hull

  • [CSES] Convex Hull: solution
  • [KATTIS] Convex Hull: solution

• Day 22 - Greedy Algorithms with Sorting 2

  • [CSES] Stick Lengths: solution
  • [CSES] Ferris Wheel: solution
  • [CSES] Apartments: solution
  • [USACO] Why Did the Cow Cross the Road: solution
  • [CSES] Stick Divisions: solution

• Day 23 - Trie

  • [CODEFORCES] Vasiliy's Multiset: solution

• Day 24 - Stack

  • Material:
    • CSAcademy, Stack Introduction
    • Handbook, pg. 89, 8.2 Nearest smaller elements
    • CS Academy, Stack Application: Soldiers Row
  • [CSES] Nearest Smaller Values: solution
  • [CSES] Advertisement: solution

• Day 25 - Introduction to Trees

  • Material:
    • Introduction to Trees
    • CPH, Chapter 14 - Tree algorithms
  • [CSES] Subordinates: solution
  • [CSES] Tree Diameter: dfs and dp

• Day26 - Binary Lifting

  • Material:
    • BInary Lifting
    • CPH, 18.1 - Finding Ancestors
    • AryanshS, Binary Lifting Part 1
  • [CSES] Company Queries I: solution
  • [CSES] Planets Queries I: solution

• Day27 - Lowest Common Ancestor

  • Material:
    • LCA
    • CPH, 18.3 Lowest common ancestor
    • AryanshS, Binary Lifting Part 2
    • AryanshS, Binary Lifting Part 3
  • [CSES] Company Queries II: binary lifting and traversal array
  • [CSES] Distance Queries: solution

• Day28 - Small to Large

  • Material:
    • Small to Large
    • CPH, 18.4 Offline algorithms
    • Explaining DSU on Trees
    • Sack (DSU on Tree)
    • Proof of Small To Large in this question
  • [CSES] Distinct Colors: solution
  • [CODEFORCES] Lomsat Gelral: solution

• Day29 - Euler Tour

  • Material:
    • Euler Tour
    • CPH, 18.2 - Subtree and paths
    • USACO Guide (walkthrough + animação)
  • [CSES] Subtree Queries: solution
  • [CSES] Path Queries: solution

Season 2

• Día 1 - Complete Search
  • [USACO] Milk Pails: solution
  • [USACO] Cow Gymnastics: solution
  • [USACO] Load Balancing: solution

Thanks : tilnoene