881. Boats to Save People | Greedy | C++ | Hindi

Your one stop for detailed explanation of LeetCode daily challenges from brute force to most optimized solutions. Whether you're a seasoned programmer or just starting out, this video is for you.
Problem Link-leetcode.com/p...
Solution Link - github.com/pre...
Solving daily LeetCode problems is a great way to improve your coding skills! Join me in today's video as we tackle a new challenge and learn new techniques. Let's keep sharpening our problem-solving abilities together. 🚀❤️
Subscribe for daily LeetCode content as well as contest solutions!
Connect with me:
My LinkedIn- / priyanshi-porwal-8b919...
My Instagram- / coding._.cynics
My Github- github.com/pre...
My telegram channel- t.me/codingcynics
Timestamps-
Hashtags
#developer #leetcode #leetcodesolutions #leetcodequestions #linkedlist #leetcodedailychallenge #leetcodedailychallenge #interview #technicalinterview
881. Boats to Save People
881. Boats to Save People C++
881. Boats to Save People Leetcode
881. Boats to Save People Daily challenge solution
881. Boats to Save People Sorting
881. Boats to Save People brute force
881. Boats to Save People greedy
Greedy
Boats to Save People
Boats to Save People C++
Boats to Save People Leetcode
Boats to Save People Daily challenge solution
Boats to Save People Sorting
Boats to Save People brute force
Boats to Save People greedy
LeetCode daily challenge
LeetCode daily challenge solution
LeetCode daily challenge editorial
LeetCode daily
Leetcode POTD
LeetCode solution
Leetcode contest
Leetcode
LeetCode practice
Interview Problems
C++

[@visheshjoshi6809]

Understood the concepts so well. Very helpful. Thank you ma'am 👍🏻

[@LearntoCodewithNayan]

1k soon. 🎉

[@preetu391]

Yep 😁🚀

[@242deepak]

What is the proper logic/reasoning to the intuition that you told. Ideally if our strategy is to maximize the capacity usage of every boat (so as to minimize the number of boats), we should be greedy about using max weight with next max weight such that limit condition is satisfied. And indeed this approach gives correct answer but with O(n^2) solution. Not sure what is the proper reasing behind two pointer appoach.