Here are Some easy to intermediate codeforces graph and backtracking problems this problems normally only use some basic knowledge of graphs/trees + basic algorithms , I hope it helps↵
↵
1- [problem:1944A] rate : 800 -> basic of graphs [Very Simple]↵
↵
2- [problem:1598A] rate : 800 -> not so much graph [Very Simple]↵
↵
3- [problem:1797A] rate : 800 -> not so much graph + edge cases [Very Simple]↵
↵
4- [problem:1843C] rate : 800 -> not so much graph or tree [Very Simple]↵
↵
5- [problem:939A] rate : 800 -> can be solved with graph or not [Very Simple]↵
↵
6&7- [problem:115A] and [problem:116C] rate : 900 -> bfs [Simple]↵
↵
8- [problem:500A] rate : 1000 -> dfs [Simple]↵
↵
9- [problem:727A] rate : 1000 -> backtracking / dfs [Simple]↵
↵
10- [problem:1020B] rate : 1000 -> dfs [Simple]↵
↵
11- [problem:1324C] rate : 1100 -> not so much graph but can be solved with dfs [Very Simple]↵
↵
12- [problem:445A] rate : 1200 -> can be solved with dfs [Simple(simpler than it's rating)]↵
↵
13- [problem:217A] rate : 1200 -> dfs [Simple/Intermediate]↵
↵
14- [problem:893C] rate : 1300 -> dfs [Simple]↵
↵
15- [problem:476B] rate : 1300 -> backtracking [Simple]↵
↵
16- [problem:1638C] rate : 1300 -> creativity [Simple/Intermediate]↵
↵
17- [problem:1970C1] rate : 1300 -> trees + dfs/bfs [Simple/Intermediate]↵
↵
18- [problem:96B] rate : 1300 -> backtracking [Simple]↵
↵
19- [problem:1143C] rate : 1400 -> trees + you can use dfs/bfs [Simple]↵
↵
1920- [problem:520B] rate : 1400 -> bfs [Simple/Intermediate]↵
↵
201- [problem:580C] rate : 1500 -> trees + dfs/bfs [Intermediate]↵
↵
212- [problem:977E] rate : 1500 -> dfs [Intermediate]↵
↵
223- [problem:377A] rate : 1600 -> bfs [Intermediate]↵
↵
234- [problem:601A] rate : 1600 -> bfs / matrix [Intermediate/Hard]↵
↵
245- [problem:1144F] rate : 1700 -> bipartite graphs [Intermediate/Hard]↵
↵
256- [problem:1093D] rate : 1700 -> bipartite graphs [Intermediate/Hard]↵
↵
267- [problem:1970C2] rate : 1700 -> a little hard + dfs/bfs [Intermediate/Hard]↵
↵
1- [problem:1944A] rate : 800 -> basic of graphs [Very Simple]↵
↵
2- [problem:1598A] rate : 800 -> not so much graph [Very Simple]↵
↵
3- [problem:1797A] rate : 800 -> not so much graph + edge cases [Very Simple]↵
↵
4- [problem:1843C] rate : 800 -> not so much graph or tree [Very Simple]↵
↵
5- [problem:939A] rate : 800 -> can be solved with graph or not [Very Simple]↵
↵
6&7- [problem:115A] and [problem:116C] rate : 900 -> bfs [Simple]↵
↵
8- [problem:500A] rate : 1000 -> dfs [Simple]↵
↵
9- [problem:727A] rate : 1000 -> backtracking / dfs [Simple]↵
↵
10- [problem:1020B] rate : 1000 -> dfs [Simple]↵
↵
11- [problem:1324C] rate : 1100 -> not so much graph but can be solved with dfs [Very Simple]↵
↵
12- [problem:445A] rate : 1200 -> can be solved with dfs [Simple(simpler than it's rating)]↵
↵
13- [problem:217A] rate : 1200 -> dfs [Simple/Intermediate]↵
↵
14- [problem:893C] rate : 1300 -> dfs [Simple]↵
↵
15- [problem:476B] rate : 1300 -> backtracking [Simple]↵
↵
16- [problem:1638C] rate : 1300 -> creativity [Simple/Intermediate]↵
↵
17- [problem:1970C1] rate : 1300 -> trees + dfs/bfs [Simple/Intermediate]↵
↵
18- [problem:96B] rate : 1300 -> backtracking [Simple]↵
↵
19- [problem:1143C] rate : 1400 -> trees + you can use dfs/bfs [Simple]↵
↵
↵
2
↵
2
↵
2
↵
2
↵
2
↵
2
↵
2