Successful Pairs of Spells and Potions - (MICROSOFT) | Leetcode-2003 | Explanation ➕ Live Coding
This is the 13th Video on our Binary Search Playlist.
In this video we will try to solve a very good problem on Binary Search "Successful Pairs of Spells and Potions" (Leetcode - 2003)
We will solve is using lower_bound STL and we will also write our own lower_bound function using binary search
We will do live coding after explanation and see if we are able to pass all the test cases.
Problem Name : Successful Pairs of Spells and Potions
Company Tags : MICROSOFT
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Binary%20Search/Successful%20Pairs%20of%20Spells%20and%20Potions.cpp
Leetcode Link : https://leetcode.com/problems/successful-pairs-of-spells-and-potions/description/
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish