1000 rating to Specialist , This is actually working for me.

Focus on Doing these many Topics and

get problem A, B, C of div2 within 30-40 min.

Step 1: https://youtu.be/U2E9PxRd680 -road map by candidate master Priyansh31dec

Step 2: NUMBER THEORY:

1: Modular arithmatic, Primes, Multiples , Divisors

    2: Bitwise, Euclidean algo, Seive of Eratosthenes

    3: Binary Modular Exponentiation

    4: Combinatorics

    RESOURCES: 

    1) https://www.youtube.com/watch?v=dg1CUYrLrD0&list=PL5DyztRVgtRWblnyEHtajWijQffrfwLz6

    2) https://cp-algorithms.com/#algebra

    3) https://www.youtube.com/watch?v=tDM6lT-qjys

Step 3: BINARY & TERNARY SEARCH:

1: Monotonic Functions & Binary search on answers

    2: C++ STL ( upper and lower bound )

    3: Convex functions & Ternary Functions

    RESOURCES:

    1) https://codeforces.me/edu/courses

    2) https://www.youtube.com/watch?v=TiQ_W2qG3kU

    3) https://cp-algorithms.com/num_methods/ternary_search.html

Step 4: GREEDY:

1) Exchange arguments for proving your solution

    RESOURCES:

    1) https://cses.fi/problemset/  (first 50% of greedy)

    2) https://www.youtube.com/watch?v=Oq1seKJvfQU

    3) https://www.geeksforgeeks.org/greedy-algorithms/#standardGreedyAlgorithms

Step 5: DP:

1) standard dp

    2) dp with bitmasking (basics)

    3) dp with trees (basics)

    4) prefer recursive dp

    RESOURCES:

    1) https://www.youtube.com/watch?v=YBSt1jYwVfU&list=PLl0KD3g-oDOGJUdmhFk19LaPgrfmAGQfo

    2) https://cses.fi/problemset/   (60%)

    3) https://www.youtube.com/watch?v=24hk2qW_BCU&list=PLb3g_Z8nEv1h1w6MI8vNMuL_wrI0FtqE7

    4) https://atcoder.jp/contests/dp   (first 10 probs)

    5) https://www.youtube.com/watch?v=OlA7gfvN6os&list=PLn8m49B2OVF4nGlNNY_aijlUz8Caiye11