CP Notes

This repository is a journal of every thing I leaned about competitive programming.

TODOs

• Maximum subarray sum - link
• Is bypassing comparator worth it?
• map
• 2 pointer course in CF
• luv cp course
• cp handbook
• dp priyangsh agharwal
• erichto edu
• dm kenneth
• algo cormen
• BACS
• https://codeforces.com/blog/entry/95447

Table of Content

The moon besides the topic indicates difficulty.
Least difficult to most difficult: 🌑🌒🌓🌔🌕

Array

• 🌑 Subarray
• 🌑 Subsequence
• 🌒 2D Array

Searching

• 🌓 Binary Search

Sorting

• 🌒 Comparator Function
• 🌓 Inversion

Tips and Tricks

• 🌓 Input array
• 🌒 Newline at the end of row
• 🌓 Bypassing Comparator Function for Sorting
• 🌒 Unknow number of inputs

Maths

• 🌒 Number of digits in an integer
• 🌒 Check how many times an integer divides another
• 🌑 Series sum
• 🌑 Comparing floating point numbers
• 🌒 Modular Arithmetic

2 Pointer

• 🌓 Find maximum length of a segment that follows given condition(s)

STL Containers

• 🌔 Tuple

Miscellaneous

• 🌑 Rating for DivX
• 🌑 How to get better in CP
• 🌒 Optimizing CPP

Contribution

I would love it, if you contribute to this open source note containing all sorts of tips and tricks for competitive programming. Fixing typos are also appreciated :)