Hello Codeforces Community , this is CodeNCode.
I have created a course for basic algorithms and teaching binary search in there as beginning.Just as I was thinking what next problem I should take to teach how beautiful this concept is , I saw Problem B from education round 87. so here is the list of lectures added till now.
- L01 : Why should you learn binary search
- L02 : Understanding the core of binary search
- E01 : Monk's Encounter with polynomial(Practice Problem 1)
- E02 : Ternary String(Ed. Round 87 B)(Practice Problem 2)
PS : Of course I will add more problems to this list (problems like aggressive cows from spoj)
PS1 : for pointing out any mistake of mine / suggestion please let me know in the comments.
Thank you for your valuable time. CodeNCode out.