POTD - 17/09/2024 | Minimize the Heights II | Problem of the Day | GeeksforGeeks Practice

preview_player
Показать описание
Welcome to the daily solving of our PROBLEM OF THE DAY with Jay Dalsaniya. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Data Structures and Algorithms but will also help you build up problem-solving skills.

So come along and solve the GFG POTD of 17th Sep 2024 with us!

Find daily solutions for POTD here on our channel! Make sure you are subscribed and stay updated.

-----------------------------------------------------------------------------------------

-----------------------------------------------------------------------------------------

Follow us and stay updated on everything happening in the world of geeks:

#GFGPractice #GeeksforGeeks #ProblemofTheDay #CodingQuestions #POTD #POTD17Sep #problemsolving #practice #dsa #MinimizetheHeightsII #arrays #greedy #dynamicprogramming #datastructures #alogrithim #jaydalsaniya#gfgpractice
Рекомендации по теме
Комментарии
Автор

there are n possible things that can happen like what if K is greater than largest, what if so called smallest is actually greater that greatest like arr[0]+k>arr[n-1]-k i just couldnt understand this algo please explain with these params

sairahultanuku
Автор

now I got the right intuition behind this

abhishek