This lecture is based on the problem called “Magic Ship” (Codeforces Education Round #60), and you can find a link to it here:
https://codeforces.com/problemset/problem/1117/C
In this problem, we are trying to help a ship reach its destination in some challenging weather! While it becomes clear quickly that you want to binary search on the possibilities for the number of days you need to arrive, the upper bound for the search range is a bit of a mystery at the outset - and fun to figure out.
The code discussed in the video can be found here:
https://github.com/noc21-cs99/lectures/tree/main/Week02
If you are watching this during an active run of the course, you can join the discord community for the course using this link:
https://discord.gg/etdD3SSJ6T
The course website can be found at:
https://neeldhara.com/courses/nptel/cp
