Word wrap | Problem of the day: 16/04/2022 | Yash Dwivedi

[@kushagrabhardwaj3308]

By far the best explanation on KZbin on word wrapping

[@yash.dwivedi]

Thank you glad that you liked my explaination

[@Hydrogen-w4k]

This is how one should explain such kind of problems, thanks a lot sir, this really helped me.

[@yash.dwivedi]

Thanks means alot

[@JoyaKhan-pu6ro]

best explanation of this problem till now. Thanks a lot sir

[@yash.dwivedi]

Hi Joya glad that you liked my way of explaining keep coding ✨🎉🔥

[@earningonlinevip8147]

best explanation of word wrap.....thank you .

[@yash.dwivedi]

Thank you keep coding and please share with your friends as well

[@shreyasingh1960]

really good explanation, please never stop making videos, its helping a lot

[@yash.dwivedi]

Thank you Shreya for your valuable remarks will try to work hard. Keep coding ✨🔥

[@Vanshikapoor5]

Best explanation till now sir!!!

[@yash.dwivedi]

Thank you

[@space_ace7710]

Understood !! Best explanation ever :)

[@yash.dwivedi]

Hi thank you for your valuable feedback means a lot I will try to bring more such quality editorials in future. 🔥keep coding

[@indianathena219]

Suppose earlier you have calculated result for recurese(2,4) and stored in dp. IF same arguments appear for last I value, will it not give wrong and since in last I we have to ignore remaining cost?

[@sirshenduroy6032]

Great explanation thanks for explaining the problem👍👍👍👍

[@yash.dwivedi]

glad that you liked my explanation thank you and keep coding ✨🔥

[@abishekp640]

Not able to think of the solution after watching the video it looks easy to understand the approach

[@yash.dwivedi]

Great 🔥 keep coding

[@Sahilsharma-sk5vr]

clear and crisp explaination

[@yash.dwivedi]

Thanks alot

[@HKSNGU]

Best explanation of this problem on KZbin, thanks for the video. Understood 😊

[@yash.dwivedi]

Glad that it was helpful for you keep coding ✨🔥🎉

[@gursimrankhela3242]

Best explanation of this problem on the internet 👏 thanks man

[@yash.dwivedi]

Thank you for your valuable comment 🙏

[@NilanjanBhattacharjee]

@yash.dwivedi Suggest me if I'm wrong. You may need to update your code a bit, It doesn't handle the case when rem is -1, and it's possible in case of a word is placed in the same remaining size of a line. I'm providing the solution method in Java. public int dp(int arr[], int k, int i, int rem, int dp[][]){ if(i == arr.length) return 0; int ans; if(rem >=0 && dp[i][rem] != -1) return dp[i][rem]; else if(arr[i] > rem){ ans = (rem+1)*(rem+1)+dp(arr,k,i+1, k-arr[i]-1,dp); } else{ int option1 = (rem+1)*(rem+1)+dp(arr,k,i+1, k-arr[i]-1,dp); int option2 = dp(arr,k,i+1,rem-arr[i]-1,dp); ans = Math.min(option1,option2); } if(rem>=0){ return dp[i][rem] = ans; } return ans; }

[@yash.dwivedi]

yes this way is better .Actually at that time explaining the problem statement was a bit of challenge so that is why I might have missed this while recoding the editorial

[@dhritiarora4147]

you were amazing!! i was really having a hard time getting it in my head

[@yash.dwivedi]

Thank you Dhriti glad that you liked my explanation keep coding ✨🔥

[@uditkaushik]

where are you considering the "last line" condition ?

[@Anonymous____________A721]

Can anyone explain

[@manyagupta8679]

The explanation was awesome....but I wrote the same as yours...only difference is I didn't use memset and it is not working without memset...what's wrong in this code? int solve(int i, int rem, vector&arr, int k, vector&dp) { if(i==arr.size()) { return 0; } if(dp[i][rem]!=-1) { return dp[i][rem]; } int ans; if(arr[i]>rem) { ans=(rem+1)*(rem+1)+solve(i+1,k-arr[i]-1,arr,k,dp); } else { int choice1=(rem+1)*(rem+1)+solve(i+1,k-arr[i]-1,arr,k,dp); int choice2=solve(i+1,rem-arr[i]-1,arr,k,dp); ans=min(choice1,choice2); } dp[i][rem]=ans; return dp[i][rem]; } int solveWordWrap(vectorarr, int k) { int n=arr.size(); vectordp(n, vector(k+1,-1)); return solve(0,k,arr,k,dp); }

[@amityadav1459]

same issue

[@Whyush7]

Awesome explanation!

[@yash.dwivedi]

Thank you 💓

[@mrinmoymondal9194]

best explanation

[@yash.dwivedi]

Thank you for your valuable feedback means alot

[@ishaanrawal9327]

Great explanation, Yash! Thanks a lot :)

[@yash.dwivedi]

glad that you liked my explanation thank you and keep coding ✨🔥

[@Drawing_tricks]

Only available decent explanation using Memoization .

[@yash.dwivedi]

Thanks

[@harshwardhanpatki846]

Understood 🔥🙇‍♂️

[@yash.dwivedi]

Glad that it helped

[@aysheri8321]

is it possible to create a tabulation solution for this?

[@LaxmanVaru-q9z]

Awesome 👌 👏 👍

[@yash.dwivedi]

Thank you

[@LogicArena01]

❤love your explanation

[@yash.dwivedi]

Thank you ❤

[@ishumiglani0]

Understood Well explained ❤️

[@yash.dwivedi]

Thank you 🙏keep coding ✨

[@rajendertanwar1881]

Best explanation on yt❤

[@tusharnain6652]

You are good at it, you should run your own yt channel.

[@yash.dwivedi]

😅😅 Thank you for believing me such comments motivate me to work harder

[@lucario404]

Thanks Yash!

[@yash.dwivedi]

Thank you ❤️

[@srushtinarnaware4919]

thanks for the great explanation

[@yash.dwivedi]

Glad that you liked it keep coding ✨🔥

[@ayushpatel-uw8od]

nice explanation.

[@yash.dwivedi]

Thank you

[@chandrasekharmandapalli9181]

Thanks yash

[@yash.dwivedi]

Make sure to remember this kind of pattern while solving other dp problems ✨

[@chandrasekharmandapalli9181]

@@yash.dwivedi sure yashh

[@devanshtiwari9163]

nicely explained

[@yash.dwivedi]

Thank you for your valuable feedback glad that it helped you 🙂

[@miscellaneouscontent5078]

great explanation

[@yash.dwivedi]

Thank you I am glad that you liked my explanation

[@pranavkorhale5089]

very good explanation

[@yash.dwivedi]

thank you ❤

[@gypsygirlkigypsylife]

whats memset??

[@yash.dwivedi]

memset is a function in C++ that helps you set a bunch of boxes in a row to the same value. Imagine you have a row of boxes (which represent a block of memory) and you want to fill all the boxes with the same color (representing a specific value). That's what memset does for you. Hope it helps

[@tanujgarg1236]

great explanation :)

[@yash.dwivedi]

Thank you for your valuable feedback keep coding ✨🎉

[@fahadabdullah687]

instead of going back to examples again and again ,, better keep the recursive tree right there only where the code is written .. that will make the video a lot less confusing....however great explanation bhai.

[@yash.dwivedi]

thank you for your valuable feedback keep coding ✨

[@mohitpardeshi2471]

why is it giving TLE in java?

[@tusharnain6652]

Understood!

[@yash.dwivedi]

thank you glad that it helped

[@rishabhkumar11]

Thanks

[@yash.dwivedi]

Hi Rishabh I am glad that you liked my explanation thank you and keep coding ✨🥳🎉

[@AayushTayalBCH]

You are wrong, your time complexity is not O(n^2), it is O(n*k) & the expected is O(N^2),

[@parasgarg8187]

Understood finally

[@yash.dwivedi]

Glad that it helped you keep coding ✨🔥

[@premanand2640]

understood

[@yash.dwivedi]

Great 🔥 keep coding ✨

[@belive9676]

understood sir

[@yash.dwivedi]

Thank you glad that it was helpful

[@gladyouseen8160]

Pretty bad discription in gfg

[@yash.dwivedi]

I tried to explain the problem statement in detail

[@ayush88]

Now they've improved it. Also, they've made the difficulty level of it as Hard

[@prasanth7698]

great

[@yash.dwivedi]

glad that you liked it 😊

[@devanshkhandelwal5453]

understood!

[@yash.dwivedi]

Hi Devansh glad that you liked my explanation keep coding ✨🔥🔥

[@divyanshrathore6349]

Understood

[@yash.dwivedi]

Great 🔥

[@ayush88]

Very well explained Yash bhaiya. I looked for some other videos too of the same problem, they were taking pride in just explaining the question statement and then the code. Approach is the main thing, you explained it nicely 🙌🙌

[@yash.dwivedi]

Hi Ayush I am glad that you liked my explanation it took alot of effort to make this video that you for the comment keep coding ✨🎉 🔥 also make sure to keep this concept in mind while solving other dp problems

[@shivamkumarsingh7816]

When I type this code in java . I got Index Out of Bond Exception....because let say rem=2 and arr[i]=2 ... then rem-arr[i]-1===-1 ....so now rec(i,-1,arr,k).

[@yash.dwivedi]

Are you writing the exact same code?

[@harmanjeetsingh3556]

class Solution { public int solveWordWrap (int[] nums, int k) { // Code here int n = nums.length; int dp[][] = new int[n][k+1]; return helper(nums,0,k,dp,k,n); // return dp[1][k-nums[0]-1]; } public int helper(int nums[], int i, int rem,int dp[][], int k, int n){ if(i==n-1 ){ if(nums[i]>rem){ return (rem+1)*(rem+1); } return 0; } if(dp[i][rem]!=0){ return dp[i][rem]; } int ans = 0; int costa = Integer.MAX_VALUE,costb=Integer.MAX_VALUE; if(nums[i]>rem){ costa = (rem+1)*(rem+1) + helper(nums,i+1,k-nums[i]-1,dp,k,n); ans = costa; }else{ if(rem==nums[i]){ costb = helper(nums,i+1,k,dp,k,n); }else{ costb = helper(nums,i+1,rem-nums[i]-1,dp,k,n); } costb = Math.min(costb,(rem+1)*(rem+1) + helper(nums,i+1,k-nums[i]-1,dp,k,n)); ans = costb; } // System.out.println(ans); return dp[i][rem] = ans; } }

[@priyankagrawal9920]

@@yash.dwivedi yes same here

[@alankruthisaieni2562]

Did you solved it??

[@pranavkorhale5089]

just do a slight change in the DP array class Solution { public int dp[][] = new int [3000][3000]; public int solveWordWrap (int[] nums, int k) { for(int i=0;i

[@bobbykuhikar5527]

your code is getting wrong answer in gfg in current testcases

[@yash.dwivedi]

Hi Bobby I just submitted the same code now and it got accepted. you can try to submit it the code passes all the testcases int dp[505][2005]; int rec(int i,int rem,vector& arr, int &k) { if(i==arr.size()) { return 0; } if(dp[i][rem]!=-1) return dp[i][rem]; int ans; if(arr[i]>rem) //next { ans=(rem+1)*(rem+1)+rec(i+1,k-arr[i]-1,arr,k); } else // same slne or next { int choice1=(rem+1)*(rem+1)+rec(i+1,k-arr[i]-1,arr,k); //next int choice2=rec(i+1,rem-arr[i]-1,arr,k); //same ans=min(choice1,choice2); } dp[i][rem]=ans; return dp[i][rem]; } int solveWordWrap(vectorarr, int k) { // Code here memset(dp,-1,sizeof(dp)); return rec(0,k,arr,k); }

[@paulomeede1947]

understood!:)

[@yash.dwivedi]

great 🔥 keep coding ✨

[@saketram690]

Could u plz speak slowly ur being very fast not even able understand the question

[@yash.dwivedi]

feedback noted ! but I would recommend that you watch the complete video you will understand the question as well as the approach really well. Thanks

[@ayush88]

There's an option to control the playback speed. Try watching at 0.75x if you think that's fast.

[@funwithfoooood6749]

The number of "right" >>>>>>

[@yash.dwivedi]

😅😅

[@chiragpagaria7367]

it is giving index out of bound exception in java plzz help

[@yash.dwivedi]

please share your code

[@shreyasri4774]

@@yash.dwivedi please look into this java code..same error int dp[][] = new int[501][2005]; public int solveWordWrap (int[] nums, int k) { // Code here for(int i[] : dp) Arrays.fill(i, -1); return rec(0, nums, k, k); } int rec(int idx, int nums[], int rem, int k){ if(idx == nums.length){ return 0; } //if(rem == -1) return rec(idx, nums, k, k); if( dp[idx][rem] != -1) return dp[idx][rem]; int ans = 0; if(nums[idx] > rem){ ans = (rem + 1)*(rem + 1) + rec(idx + 1, nums, k - nums[idx] - 1, k); }else{ int op1 = rec(idx + 1, nums, rem - nums[idx] - 1, k); int op2 = (rem + 1)*(rem + 1) + rec(idx + 1, nums, k - nums[idx] - 1, k); ans = Math.min(op1, op2); } dp[idx][rem] = ans; return dp[idx][rem]; }

[@arunchoudhary9608]

Thanks bhai, but ek bat bat ko bar bar sun ke irritate ho gya

[@yash.dwivedi]

Yes will improve these things but hope that you understood the problem

[@thedailycoding]

You are so confused. Fixed yourself, what you want to say.

[@yash.dwivedi]

Please watch the video carefully you will understand everything.

[@shubhamgarad657]

Did not get what he was trying to say . He himself is confused so much while explaining and was very fast .

[@yash.dwivedi]

re-watch you will understand it

[@OnlyAyushAgarwal]

[@yash.dwivedi]

Thank you

[@penanrajput6690]

best explanation

[@yash.dwivedi]

Thank you glad that you liked it keep coding ✨🔥

[@riskyboygaming1215]

Understood

[@yash.dwivedi]

Thank you keep coding

[@vijetasinghyadav2026]

understood

[@yash.dwivedi]

Great 🔥🔥 keep coding ✨

[@prasanthibammidi4681]

Understood

[@yash.dwivedi]

great

[@kartikkatara5999]

understood

[@yash.dwivedi]

great 🔥 keep coding ✨

[@namanupadhyay1660]

Understood

[@yash.dwivedi]

Thanks

[@Mohit_Tanwar_18]

understood

[@yash.dwivedi]

great 🔥❤️

[@hariprakash1715]

understood

[@yash.dwivedi]

great keep learning 👍

[@VishnuVardhan-gr6op]

understood

[@yash.dwivedi]

great 🔥🔥

[@shreyashjadhav1303]

understood

[@yash.dwivedi]

Great 🔥❤️

[@venumadhav7321]

understood

[@yash.dwivedi]

Thank you glad that it helped you 😊

[@rvikur6233]

understood

[@yash.dwivedi]

great keep coding

[@snehank4012]

understood

[@yash.dwivedi]

thanks

[@rajukale1974]

understood