Text Justification - Leetcode 68 - Python

[@flueesyblueesy6246]

This question has been the bane of me for years now

[@johnj171]

😂😂😂😂its nice to know someone out there

[@Syed_Shifat]

Hey Neet, I love you, man. I wish I could meet you someday. Your videos are greatly organized and so helpful.

[@akashchandra4uify]

Me too.

[@RagingAcid]

I've been waiting for this one from you

[@manasawalaaamir]

this is really good, your coding style is very easy to understand !

[@CST1992]

I got this one in a CodeSignal assessment. Solving this PLUS 3 other (smaller) questions in a 70-minute time frame? Forget it.

[@vigneshs1852]

shitt.......😬😬

[@Chinmay_395]

was it for capital one?

[@VidyaBhandary]

Finally!!! Thank you. Needed this one.

[@MP-ny3ep]

Thank you so much for the daily problems

[@agrimpuriya2585]

the string section of the 150 problem set was mostly easy, and then at the very end they drop this bombshell.

[@hbhavsi]

I solved this but mine is quite long and handles cases separately. This is very neat. On the lines of some top solutions on the Leetcode page, but those solutions are super hard to understand.

[@garth2356]

They legit asked this exact same question in the coding round for DevRev and I was able to solve it!

[@CarsMeetsBikes]

wish I saw this video before I got a problem in a coding round today. Couldn't figure out the justification part, but at least separated the words correctly

[@aadil4236]

The Problem was good. It imporves your thinking. Can you share more problem like these? Thanks for the explanation!

[@NeetCodeIO]

Yeah I really enjoyed it. I don't remember many like this tbh, but if anyone else does feel free to mention them here.

[@isaiahr7041]

When you say "It improves your thinking", does this specific problem benefit you in coming up with more efficient and elegant approaches, especially with to string related problems? Even though many LC problems can enhance your problem-solving skills, does this specific one opens up to newer techniques you could use based upon what you have said?

[@impatientgaming9868]

Had to rewatch once but good explanation.

[@kidscodera3043]

very useful video ,thanks for amazing explaination . Can you please tell me where is this mention that there has to be space between 2 consecutive words in the line. Like in example 3 : line#3 has the word enough which can be fir easily in the line#2 if we don't keep space in between two words.Please tell me if I have misinterpreted the question ,because I can not find any such restriction in question where it says that there has to be a space in between consecutive words.On the other hand , it clearly mentions that " each line has exactly maxWidth characters ", see question is only talking about characters , no constraints given about compulsary word prefix/suffix . Please help

[@vinleous]

Thanks for uploading the dailies again!

[@mortal_coder4869]

Great Coding there, thank you!

[@ManishKumar-zt5sk]

saw your video and wrote the code in C++, ACC in 1st attempt

[@chirpy7961]

Is the space complexity of this is o(n) where n is the number of words for each line....? please correct me if I'm wrong....

[@shawnzhang528]

So elegant answer

[@uptwist2260]

Thanks for the daily

[@ax5344]

I tried to find python solution of this problem from your website, but it is not there. Could you verify?

[@akhma102]

Thanks Neet!

[@ruthlessogre2441]

This was one of the easiest hard questions.

[@Benstokes555]

yes but the edge cases are pretty confusing. therre isnt much logic to be applied in this.

[@anuragchoudhury365]

I have a question at line #27. In case the line contains one word with exactly the same number of characters as maxWidth, won't the last line contain maxWidth + 1 characters? Why is it not giving an error for exceeding the maxWidth. I'm not familiar with Python so if you/someone can help me understand this.

[@ArgonautJasonLoL]

It won't because #27 is the delimiter is what is put between words in this case. If there is only one word, then no delimiters are added.

[@ThefactMaster01]

Amazing explanation.

[@AlexErmashev]

How long did it take you to solve it?

[@ryanrenjith3504]

took me 1.5 hrs grinding it with a pen and paper

[@sanketatmaram]

Perfect 😊

[@classicmakersmusic6344]

This is an impossible problem

[@SrinivasNarayanamrocks]

you missed a case to handle the single word sentences which is not the last sentence: if len(line) == 1: line[0] += ' ' * extra_space this line would come in around line 13 of your code

[@jard8994]

thanks for the video

[@theja63]

This in itself is a microservice for sure.

[@Benstokes555]

saaari duniya see jeeth ke me aaya hu idhar🤓🤓

[@KaranVerma-pf5jw]

Does anybody watching this video calculated the time and space complexity , I think T.C is O(N^2) where N is the length of words , where max N = 300 and space complexity O(maxWidth)

[@kingfriizy5707]

im bouta crash out

[@dheerajgowda9208]

It’s starting to make me feel a bit dumb when everyone keeps saying it’s easy.

[@divyam1175]

i copied the exact solution and still it shows error

[@metarus208]

need mmmmmooorre