Leetcode 1642. Furthest Building You Can Reach

[@probabilitycodingisfunis1]

Code CPP:
int i ;
priority_queuepq;
for( i=0;i0)
{ //have to use a brick or ladder
bricks-= difference;
pq.push(difference);
if(bricks

[@nileshkadam9986]

I stared 180 challenge of leetcode in DSA your videos very helpfull for me create more videos

[@shashanksahu5032]

Great Explanation.. thank you !!

[@pixelsbyme]

Just wanna say that ur content is nice, has helped me. Keep it up!

[@dvjulakantidoraemon]

🙌

[@vivek_1300]

lovely explanation

[@sushmitakumari8252]

Thanks for drawing entire heap structure and explaining . finally I understood here.

[@kaavincraig4765]

why priority_queuepq; and not just priority_queue.

[@tusharnain6652]

First View, like and comment 😁

[@ShivamSharma-q3t]

Amazing

[@gorakhkumargupta491]

Amazing 👏

[@Idukhan-jj9kc]

Very beautiful question like u

[@sivasainagireddi7956]

The way you writing the code by taking an example is too good mam

[@princegupta5339]

Just wanna say I ❤️ you, would you help me in image processing code ? I'm getting error in it but I can't figure out 🥺

[@gautamarora6556]

Time complexity of this solution?

[@mohitarora2190]

Wow that was great explanation

[@sssumeet]

very well explained;

[@kewtomrao]

Is there a possibility to share all the questions you practiced before reaching this level of expertise?
It would help out starters!

[@maitreyikshetrapal1644]

very nice explanation!!

[@cypher7536]

Very nice explaination ❤️

[@satyajeetkumarjha1482]

Coddddding and Problemmmmmmm. Your explanation is good .

[@dhananjoydey1337]

can you upload today's POTD solution?