Codeforces Round #656 Problem E: Directing Edges

I'll discuss my approach in detail with required proofs to the problem E of Codeforces Round #656. I will also discuss my implementation. Gist of the video: 1. Problem statement discussion. 2. Sample Input and output. 3. Discussing why answer is NO if there is cycle in initial graph. 4. Claiming the answer is YES otherwise. 5. Proving the claim. 6. Discussing my implementation. Enjoy Watching!! Super useful books for algo ds and programming fundamentals! 1. Introduction to Algorithms by Cormen: https://amzn.to/35AmQqu 2. The Algorithm Design Manual: https://amzn.to/2K9RGPq 3. Fundamentals of Data Structures in C++: https://amzn.to/2LCwIsN 4. Object-Oriented Programming by E Balagurusamy: https://amzn.to/2Xxmdtr 5. Head First Java: https://amzn.to/39kb44K 6. Cracking the coding interview: https://amzn.to/3iDOHLK 7. Database System concepts: https://amzn.to/3pisuFQ 8. Operating Systems: https://amzn.to/39fcmis 9. Discrete Mathematics: https://amzn.to/2MlgCE6 10. Compiler Design: https://amzn.to/3pkYvx2