Can you please explain the problem “Chef and Frogs” it’s a dynamic programming problem.
Please???
very nice stuff, was looking for such stuff from long time. Thanks buddy , hope you will sooner be a 6 or 7 star guy
Thank you buddy , and I wish the same for you
Bro, it would be better if you also explain time complexity along with the problem or algorithm in upcoming videos.
thanks man i really need a path for this
and bro you should make a playlist of videos so that easy for us .
No problem ,I can do that
When will the part 2 be completely uploaded?
Hard to tell.
Today added lecture in Number Theory , soon I will add videos In graph theory part 2 as well
12 May 2020 : 1 editorial video added
L16 : TOPOSORT (Spoj) | Topological Sort Practice Problem
when are the new videos coming?
currently working on segment tree lectures , soon I will add Graph theory lectures too
Brother can you make explanation video on bipartite matching using DSU?if you have time
Edit: FILLMTR Problem - CodeChef or add a editorial for this in DSU series.
bipartite matching itself is a different concept , so first i need to teach that , then I may make editorial for this problem.
Thanks for suggestion btw.
28 May 2020 : 2 lecture added.
L19 : Counting connected components on grid
E01 : Counting Rooms | CSES | Graph Algorithms