Good Day to you!

While a lot of us, when he begins to start competitive programming he found difficult to found problems on some topics in the beginning to practice of it, and same thing for a lot of ICPC Communites that they have started.

These are some topic not advanced and videos, problems and articles on them.

**Prefix Sum & Frequency Array**

**STLS**

**Problems**

**Videos**

William Fiset (PQ)

Adel Nassim (PQ)

Apna College (Multiset)

Adel Nassim (Dequeue)

Adel Nassim (Stack)

Adel Nassim (Queue)

**Number Theory**

**Modular Arthmetics**

**Videos**

**Articles**

**Big integer mod m**

**Problems**

**Articles**

**Divisible rules and tests**

**Problems**

**Articles**

**Pow, gcd, lcm**

**Primes**

**Seive**

**Videos**

**Articles**

**Factorization & Divisors**

**Math**

**Videos**

**Binary Search**

**2 Pointers**

**Recursion**

**Backtracking**

**Bits**

**Graph**

**Dynammic Programming**

**Problems**

- Lightoj Problems
- New Year and the Permutation Concatenation
- Multiply
- Stars Drawing(Easy Version)
- Consecutive Subsequence
- substring
- permute Digits
- Mike and GCD Problem
- Mahmud and message
- Travel Card
- Coloring Trees
- Robbers' Watch
- Alyona And the tree
- Geometric Progression
- Kyoya and balls
- soldier and number game
- Animals
- Flag
- Pavel and Triangles

**Videos**

- DP tutorial #1 by Errichto
- DP tutorial #2 by Errichto
- DP tutorial #3 by Errichto
- Leetcode DP problems by Errichto
- Algorithms Series | Session 3 | Dynamic Programming (Arabic)
- Dynamic programming I (Arabic)
- DP playlist(Arabic)
- DP playlist2(Arabic)
- Atcoder DP contest solutions by Errichto
- DP playlist(English)
- DP playlist (created by gkcs, English)
- DP playlist2(English)
- DP playlist3(Englush)
- Dp playlist4(English)
- DP playlist5(English)
- DP playlist6(English)
- DP playlist7(English)
- DP MIT open course
- Atcoder DP contest stream
- vplanet DP tutorials
- Algorithms Live

**Segment Tree**

**Classic**

Xenia and Bit Operations

Knight Tournament

Pashmak and Parmida's problem

Enemy is weak

Sereja and Brackets

Ant colony

Copying Data

Misha and Permutations Summation

Little Elephant and Inversions

Optimize!

Points

Jeff and Removing Periods

Drazil and Park

Infinite Inversions

Frogs and mosquitoes

REQ

Function

**Ordered Set**

Sorry for my poor english.

Thanks for sharing this!

you're welcome

Thanks for 'Recursion'!

you're welcome

thanks

you're welcome

Wow! So convenient. Thanks a lot!

you're welcome

I can't access the Modular Arthmetics problems

Join to the group first:

Good job bro ❤️

Thanks bro ❤️

Are these problems introduced to people who struggled with B problems ?

I think that

Thanks alot bro

I'd mostly agree with you, but the last 4 topics have almost zero chance of ever appearing in a Div2B problem due to the pre-requisite knowledge required.

If a problem requires Graphs or Dynamic Programming, nearly all problem setters and coordinators will not even consider putting it at any position less than Div2C. The same is true for SegTree or Ordered Set and Div2D.

Disclaimer: I've only looked at the topic headings, not the actual problems, so I can't be 100% sure about the difficulty of the problems you've linked on these topics and am just assuming they're not too tough. Its certainly possible to set problems that are at the Div2F level or even higher using just one or two of these topics.

Also, in my opinion just solving problems that are moderately difficult for you is a decent way of finding stuff that you need at your level that you don't know.

I agree with you completely, the last four topics will be Div2 C or Div2 D, but not difficult for anyone who study these topics they are not hard and not easy, If anyone wants to train on these topics they will help them.

I see that too last 4 topics are a little bit advanced but I think may be in my way to raise my level learning these topics and practise in it too. Hoping to raise my level a little bit.

thank you very much

you're welcome

Hey ,

In case of graph sheets, do you have solutions or hints somewhere written so that we can refer to, in case of a difficulty.

You can search on the name of the problem and get the original problem from the original contest and read the tutorial.

That's fine too.And you DP playlists is also very helpful.

Thank you bro

you're welcome

Thanks for your sharing (≧∇≦)ﾉ

you're welcome

you're welcome

Thanks (≧∇≦)

Currently I don't prefer topic-based practice anymore.It's better to do just randomly

If you don't know 50% of these topics, you will be stuck in solving most of the problems, they will help you to practice on a specific topic to be good at it, but after that, you must practice in blind style to know how to solve the problem with which topic.

I learnt 100% of the topics by solving blindly

in STL sheet last problem ( LLPS problems ) I am not allowed to access this sheet

Try this:

when I click this link it says I am not allowed to view this contest.

Try this STLs Sheet

thanks...it worked.

superb , thanks a lot sir

you're welcome

Thank you very much for what you give us, this will help us a lot, thanks for your effort, keep on being the best. I support you very much and wish you every success.Thanks for your support

Thanks a lot , I needed this

you're welcome

Thank yu so much for sharing this

you're welcome

Thank you very much

there is no tutorial for graph

This blog was helpful. Thanks