Furthest Building You Can Reach | Live Coding with Explanation | Leetcode - 1642

Get Discount on GeeksforGeeks courses (practice.geeksforgeeks.org/co...) by using coupon code: ALGOMADEASY
To support us you can donate
Patreon: / algorithmsmadeeasy
UPI: algorithmsmadeeasy@icici
Paypal: paypal.me/algorithmsmadeeasy
Check out our other popular playlists:
Questions you might like:
✅✅✅[ Tree Data Structure] : • Tree Data Structure
✅✅✅[ Graphs Data Structure] : • Graph Data Structure
✅✅✅[ February Leetcoding Challenge] : • February Leetcoding Ch...
✅✅✅[ January Leetcoding Challenge] : • January Leetcoding Cha...
✅✅✅[ February Leetcoding Challenge] : • February Leetcoding Ch...
✅✅✅[ March Leetcoding Challenge] : • March Leetcoding Chall...
✅✅✅[ December Leetcoding Challenge] : • December Leetcoding Ch...
✅✅✅[ November Leetcoding Challenge] : • November Leetcoding Ch...
✅✅✅[ August Leetcoding Challenge] : • August LeetCoding Chal...
✅✅✅[ July Leetcoding challenges] : • July LeetCoding Challe...
✅✅✅[ June Leetcoding challenges] : kzbin.info?list...
✅✅✅[ May Leetcoding challenges] : • May LeetCoding Challen...
✅✅✅ Cracking the Coding Interview - Unique String: • Cracking the Coding In...
Problem Link: leetcode.com/problems/furthes...
Code: github.com/Algorithms-Made-Ea...
If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.
#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode

[@AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure] : kzbin.info/aero/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure] : kzbin.info/aero/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ February Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wrfvII0eZQsPm-MZCmHodm ✅✅✅[ January Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn ✅✅✅[ February Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wrfvII0eZQsPm-MZCmHodm ✅✅✅[ March Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2zH-YC5ZiptbAvw2QZkmyk9 ✅✅✅[ December Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅[ July Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅[ June Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2xIPptnCvUtKrUcod2zAKG ✅✅✅[ May Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅Cracking the Coding Interview - Unique String: kzbin.info/aero/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

[@xueli5641]

I love this video. So glad to see your video in the search results. Thank you.

[@sproutboot]

known your dsa solution video from 2022, love your explanation

[@AlgorithmsMadeEasy]

Thank you!!

[@rhythmbhatia8906]

Thanks for the awesome explanation!

[@sainikhil956]

Ma'am i dont have the habit of writing in comments but the way u solved it i really enjoyed it ,code is very beautiful just like you thank you! keep doing good work

[@philbowden]

that was excellent. Thank you.

[@AlgorithmsMadeEasy]

Thank you!!

[@amrholo4445]

Thank you so much, helped me a lot

[@karthikmr1855]

wonderful explanation mam.thankyou so much

[@AlgorithmsMadeEasy]

Glad you liked it !!

[@SenthilKumar-ep4mq]

Best explanation❤️, keep posting🙏

[@AlgorithmsMadeEasy]

Thanks 😀

[@shivshaktipandey7148]

best explanation , too smooth

[@sonukumarram1880]

great explanation through animation made me clear my doubts thnx a lot

[@AlgorithmsMadeEasy]

Thank you!!

[@SurajYadav-ve1tr]

hey, in your second code how it will check whether to use ladder or brick depending upon the priority queue?

[@AlgorithmsMadeEasy]

The condition if(q.size()>ladders) will remove the smallest number from the priority queue. So, that will optimize the use of ladder and bricks

[@muthuvalli333]

Awesome...👌

[@AlgorithmsMadeEasy]

Thanks 😀

[@suryanshgupta7518]

Thankyou..

[@AmritAgarwal07]

Rajat can you tell me the name of the video in which you told about the memorization

[@AmritAgarwal07]

i got Ones and Zeroes | Live Coding with Explanation | Leetcode - 474

[@darshanp526]

Do you use manim for animation?

[@AlgorithmsMadeEasy]

We use powerpoint.

[@Weirdvloggertrue]

Could you please suggest me whether I should go for java or Cpp for data structures?

[@Weirdvloggertrue]

Please reply

[@AlgorithmsMadeEasy]

Both are good choices. as we have not worked on CPP that much, we cannot comment on that.

[@Weirdvloggertrue]

@@AlgorithmsMadeEasy thank you

[@akki_gamingzone]

where your reducing the ladder available?

[@rhythmbhatia8906]

We are increasing size of heap by pushing the jump differences where ladders were used! So, decreasing no. of ladders or increasing size mean the same.

[@shreyashtech8556]

thanx a lot

[@AlgorithmsMadeEasy]

Most welcome!

[@AmritAgarwal07]

faster PriorityQueue maxHeap = new PriorityQueue(new Comparator() { public int compare(Integer a, Integer b) { return b - a; } }); int n = heights.length; int i = 1; int leftBricks = bricks; for(;i < n; i++) { if(heights[i] = diff) { leftBricks -= diff; maxHeap.offer(diff); } else if(ladders > 0) { ladders--; if(!maxHeap.isEmpty() && maxHeap.peek() > diff) { leftBricks = leftBricks + maxHeap.poll() - diff; maxHeap.offer(diff); } } else { break; } } return i - 1;