6.1 Full explanation - Binary Search On Answer | Maximum Tastiness of Candy Basket | Leetcode 2517

6.1 Full explanation - Binary Search On Answer | Maximum Tastiness of Candy Basket | Leetcode 2517 | Easy Template Series ‪@codingsamurais‬ Problem: Leetcode 2517 ( Maximum Tastiness of Candy Basket ) : https://leetcode.com/problems/maximum... Solution : Sweep Line playlist :    • Sweep Line Algo easy template   Window Sliding playlist :    • Window Sliding all problems using only one...   Binary search playlist :    • Binary Search in C++ STL   Tips and Tricks in programming playlist:   • Tips & Tricks for programming & development   Think Logical (Greedy) playlist:   • Think Logical ( Greedy Algorithm )   Bit Manipulation playlist:    • Bit Manipulation   Pointers: 0:00 Gyan 0:58 Understanding Problem 6:41 Why to sort data 7:30 Brute Force 8:47 Optimization ( Binary search on Answer ) 17:17 How to decide lower and upper range 21:15 Dry running the test case on code ( Binary search ) 30:35 Dry running ISVALID function Hello guys, In this video I have explained about the problem Maximum Tastiness of Candy Basket (Leetcode 2517) using Binary search . This concept is seems to be hard for beginners to understand but in this video I have put my all efforts to make sure that you will master this concept. So please watch the video that how we can apply Binary Search on our search space (answer). Thankyou, #binarysearchonanswer #binarysearchonsearchspace #modifiedbinarysearch #fullexplanationbinarysearchonanswer #maximumtastinessofcandybasket #leetcode2517 #aggressivecows #interviewQuestionsDSA #modifiedbinarysearchplaylist #sweeplineAlgo