Guys listen Carefully ⚠️ In this question the brute force approach is the main and important approach of this problem as this only lays the foundation of why we are taking LeftMax and RightMax and why we are checking which is smaller than arr[i] or arr[j] SO I want you all to understand carefully and code the brute force approach by your own and you can EVEN SUBMIT it also it'll be accepted also because it's the main approach....the optimal one is just the optimization of that main logic...you can understand the optimal approach by just 1-2 dry runs...but main one is that brute force one ❤️🗿
Guys listen Carefully ⚠️
In this question the brute force approach is the main and important approach of this problem as this only lays the foundation of why we are taking LeftMax and RightMax and why we are checking which is smaller than arr[i] or arr[j]
SO I want you all to understand carefully and code the brute force approach by your own and you can EVEN SUBMIT it also it'll be accepted also because it's the main approach....the optimal one is just the optimization of that main logic...you can understand the optimal approach by just 1-2 dry runs...but main one is that brute force one ❤️🗿
Very simply explained !! Thank you so muhc bhai. Thank youu.
🙏🏻❤️
Amazing❤
Thanks 😄
Nice Maza aa gaya bhai 🎉❤
🙏🏻😊
thanks bhai
🙏🏻❤️
🙌
🙏🏻❤️
I can't see yesterday question potd so I can't do i found my streak break i use time machine I'm eligible for reward?