BRAINIAC2677 / Competitive-Programming

Contains Resources , practice problems and relevant templates.

Competitive-Programming

Contains Resources , practice problems and relevant templates.

Topics

• Asymptotic Analysis
• Contructive Algorithms
• String Hashing
• Dynamic Programming
• Bitmask
• Segment Tree
• Merge Sort Tree
• DFS
• Interactive Problems

Theorems And Concepts

• Regular Polygon

• Permutation - Even odd permutation, cyclic notation, transposition of a permutation.

Asymptotic Analysis

• Resources

  1. Quick Read

Constructive Algorithms

• Resources

  1. Tips on Constructive Algorithms

• Practise Problems

  1. Easy - Fillomino 2

String Hashing

• Resources

  1. https://cp-algorithms.com/string/string-hashing.html

• Template-Code

• Practise Problems

  1. Easy - Watto and Mechanism
  2. Medium - Palindrome pairs
  3. Medium - Games on a CD

Dynamic Programming

• Practise Problems

  1. Medium - Add One
  2. Medium hard - Python Indentation
  3. Medium - Mr. Kitayuta, the Treasure Hunter
  4. Easy - The Sports Festival
  5. Medium - Explorer Space
  6. Hard - Traveler
  7. Medium - Armchairs
  8. linear dp - Kavi on Pairing Duty
  9. tree dp - Parsa's Humongous Tree
  10. Hard - Red-Black Number

Bitmask

• Practise Problems

  1. Beautiful - AGAGA XOOORRR

Segment Tree

• Practise Problems

  1. Playoff Tournament

• Applications:

  • Sum, Min, Max, Product, GCD, LCM over a range of a changable array.
  • Number of Min/Max in a range.
  • Finding the K'th zero.
  • For a given value x we have to quickly find smallest index i such that the sum of the first i elements of the array a[] is greater or equal to x (assuming that the array a[] only contains non-negative values).
  • For a given value x and a range a[l…r] find the smallest i in the range a[l…r], such that a[i] is greater than x.
  • Finding subsegments with the maximal sum.

Merge Sort Tree

• Resources

  1. https://cp-algorithms.com/data_structures/segment_tree.html#toc-tgt-9

  2. Distinct numbers on an interval

• Template-Code

• Practise Problems

  1. Beginner - K-query
  2. Medium - Smallest subarrays

DFS

• Practise Problems

  1. Easy - Unique Color
  2. Nice Solution - The Number of Imposters

Interactive Problems

• Practise Problems

  1. Hard - Lost Tree
  2. Medium - RPD and Rap Sheet (Easy Version)

Expected Value

• Resources

  1. Errichto

• Practise Problems

  1. Easy - Need for Pink Slips