30. Substring with Concatenation of All Words (Leetcode Hard)

preview_player
Показать описание
Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!

#leetcode #coding #programming
Рекомендации по теме
Комментарии
Автор

Indian students are busy in cheering their ipl teams

RAWATBOYZ
Автор

The bug is in line 10-12 in helper function implementation: change count -> counter

kayvan-shah
Автор

Really appreciate the snippets about the questions' interview reasonability in your videos.

zen
Автор

Dude, This channel is a diamond mine, you inspire me

josephfifstones
Автор

Hey Larry, thank you for the video mostly your thought process is very clear but could you explain one part of the code? why did you walk through each character in a word from words instead of just walking through each word in words? It is on line 15. This part is a bit unclear.

VileHint
Автор

I guess the complexity is n^2. Can somebody explain how it is not giving TLE?

raidsingh
Автор

with the first attempt) I do at least 5 times to just accept it. Well done and thank you!

rtnjo
Автор

Goddamn this a real hard one, i couldnt figure out how to keep track of the words such that we know when are good

proofhundred
Автор

Can you solve problems on codewars? I can't find anyone on youtube solving the hardest problems there. I bet you will find it more challenging than hard on leetcode

rtnjo
visit shbcf.ru