Minimize the Heights | Love Babbar DSA Sheet Q9 | Arrays

✅ Useful Links
𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - / codingwithprakash
𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/c...
𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - / prakash-shukla
SUBSCRIBE AND HIT BELL ICON TO CHECK MORE OF MY CONTENT
czcams.com/users/Pra...
Minimize the Heights | Love Babbar DSA Sheet Q9 | Arrays
𝐌𝐔𝐒𝐈𝐂 𝐂𝐑𝐄𝐃𝐈𝐓
Track: Julius Dreisig & Zeus X Crona - Invisible [NCS Release]
Music provided by NoCopyrightSounds.
Watch: • Julius Dreisig & Zeus ...
Free Download / Stream: ncs.io/Invisibl... Complete Crash Course at prakashshukla.com
Track: Axollo - Silence (ft. Josh Bogert) [NCS Release]
Music provided by NoCopyrightSounds.
Watch: • Axollo - Silence (ft. ...
Free Download / Stream: ncs.io/ASilence

[@AlokKumar-ld9qr]

Thanks sir.....I am struggling with the question from two days but After Watching your video....this Question is looking so easy.

[@MilindGupta]

❤️❤️ keep going bhai this was confusing pblm for me

[@prasads7530]

Thank you Sir, it helped me a lot!! after referring multiple explanations for this question, finally i came to this video and now its clear to me

[@abhishektandon2312]

Great Explanation Sir, After watching a lot of videos now I get the exact intuition from your's
Thank you so much 🙏🙏

[@harsh_govind]

+1

[@hrithiksinghrtk6158]

i saw all the u tube videos for this question solution at last i found urs ....really very good explanation🤩

[@ankukushwaha1098]

Thanks a lot sir... I didn't understand this question clearly even after watching tech skeleton video but i did after watching yours... Great explanation ❣

[@SaifKhan-lq1sp]

Bahut jayada hi clear.
Very well done.

[@gowthambhat1498]

you deserve more subscribers, excellent explanation.

[@mugdhamonga25]

Easiest solution explanation i have watched so far. You deserve more subscribers

[@aasifali9139]

Thanks for this video sir. Very well explained.

[@Just_Clip_8055]

Sir you made this question too easy very well explained👍👍✌

[@showsshorts4696]

lovely explanation by you sir thanks alot

[@travelnlearn]

Thank You Sir for this awesome and genuine content.
This q looked difficult to me before but now its a piece of cake for me.
All thanks to you Sir, May GBU with lots of love long life success happiness and enjoyment
Thanks a lot again

[@rishabhgupta9846]

Thanks bhai,aapki video dekh kar hi mujhe clear hua. Make more videos-- your new subscriber

[@CodingWithPrakash_]

Thanks rishabh

[@Shivamkumar-ue4hl]

Thanks a lot bro after wasting my lots of time on other videos finally got this question understood well by you ! 😁😁

[@Shivamkumar-ue4hl]

@@aadarshkeerti000 try krte rho mainly dry run karo jada...

[@dhirajkumarsahu999]

Thank you so much Bhai, this was the best solution for this question. Keep making such videos. You have earned my subscription

[@user-bc1mp6rh1t]

best explanation of this question on youtbe

[@levi-lb6dp]

thanks bro for precise and simple solution

[@wtfun5465]

best explanation than other viedeos

[@tusharnain6652]

Only video that helps, tysm

[@black_shadow4627]

great explanation thanks a lot

[@prateektripathi100]

Great Explanation....

[@aryantiwari2784]

wow simplest explanation ever

[@gauravnagpal172]

Perfectly explained
💯

[@sujithsaikalakonda4863]

Nice explanation brother.

[@ajit287]

Very well explained...

[@user-gq1ij]

I am glad I found this one at last, no one else explained this well

[@adnanshaikh6141]

A simple and great explanation👌

[@ModifiedGaddiyan]

best solution ever

[@rohitumadi9544]

superb explanation

[@AAYUSHSHARMAPCE21CS002]

Absolutely amazing explaination sir!!!!!
thankyou so much sir

[@CodingWithPrakash_]

Most welcome!

[@05_hemantpanchariya92]

thank you prakash bhai

[@growmore1672]

Int diff = arr[n-1] - arr[0]
Yeh isliye kiya to handle a edge case of (arr[n-1] + k ) - (arr[0] + k )
Yeh bhi ek minimum difference ka candidate hai

[@azimuddin6921]

nice bhai, Thank you

[@alokbind3305]

Nice explanation 🔥

[@lalit-singh-bisht]

best explanation guruji

[@datakube3053]

Bhai bohot sahi explain kiya hai

[@PrinceKumar-rt7qc]

well explained

[@amansingh.h716]

in question they mentioned we have to perform k operation in each element,
so why u don't perform k operation in your first diff operation

[@lokanathpatasahani897]

Thank you sir

[@mannpatel7441]

great work..

[@tanvitripathi5743]

Keep going ❤❤

[@sumitchakraborty9451]

clean and clear

[@sunidhibhardwaj4529]

nice explanation

[@ramyabl6753]

super bhaiya keep going

[@pratyushtripathi1728]

❤

[@shubhamshete8877]

Best explanation

[@blockkedd]

can anyone explain the line no 52 ????

[@arhamali4041]

keep going bhaiya

[@omkarsawant9267]

C language code and code breakdown will help better understand.
#include
#include
// Qsort Time Complexity is O(nlogn) where n is no of elements in an array and Loop Interates is O(n)
// Space complexity is O(logn) due to recursive call of sorting alogithm
// Helper function to swap two integers
void swap (int* a, int* b)
{
int temp = *a;
*a = *b;
*b = temp;
}
// Helper Function to compare two integers for Qsort
int compare (const void *a, const void *b)
{
return (*(int *)a - *(int *)b);
}
// Function to minimize the max difference between heights
int minimizeMaxDiff(int arr[], int n, int k)
{
if (n big)
swap(&small,&big);
// Traverse middle Elements
for (int i; i=small || add

[@abdurrahman-gn6hy]

thanks ur r good

[@CodingWithPrakash_]

U too

[@abdurrahman-gn6hy]

sir please upload some videos on time complexity. I am very confused.

[@CodingWithPrakash_]

Krta hu try

[@everyone8057]

thek hai

[@lalit-singh-bisht]

sir ye kuch alag level ka question tha...toh inka logic find krne mein toh dhoti khul jaaegi

[@vyankteshdwivedi674]

max - min -2k ni kar skte kya

[@shalabhbhatiya5659]

bro concept samaj nhi aaya kya karru
???

[@nikhilmaliwal7914]

is this question available on leetcode , if yes provide no.

[@MyAnish22]

Not all test cases are getting cleared - using C++
What is wrong in my code? Can someone help?
class Solution {
public:
int getMinDiff(int arr[], int n, int k) {
int mini = INT_MAX;
int maxi = INT_MIN;
for (int i = 0; i < n; i++){
if(arr[i]

[@sooojihalwa]

use long long instead of int

[@Premkumar-zk7lb]

🙏

[@user-qo6vg5jb6y]

not running for test casses
1 5 8 10
if k=2

[@garimanagarwal1571]

Acthually

[@roastforfun7931]

Not helpful could not get the concept

[@CodingWithPrakash_]

✅ Useful Links
𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - instagram.com/codingwithprakash/
𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/channel/0029VaACtTa4tRrpDCQc5f44
𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - www.linkedin.com/in/prakash-shukla/

[@saket5925]

Thank you sir, for great Explaination🙏😇

[@dipteshdeore5207]

great explanation 🤩

[@rajulshakywar3168]

Great explanation