CP-Week02-Mod02 The Meeting Place Cannot Be Changed

This lecture is based on the problem called “The Meeting Place Cannot Be Changed” (Codeforces #403), and you can find a link to it here: https://codeforces.com/problemset/problem/782/B In this problem, we are trying to get some friends on a line to meet at a common point as quickly as possible. Once you recast it in terms of intersecting intervals, a binary search over potential times does the trick finally! 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