Word break - leetcode 139 - Dynamic Programming

preview_player
Показать описание
Today we will solve "Word Break" problem from #leetcode. We will walk through a Dynamic programming solution for input string in order to solve this Problem.

This question has been asked by Facebook, Amazon, Apple, Google, Bloomberg, Microsoft, Adobe and so many other companies.

Please check the channel page for more #leetcode solution videos. Also don't forget to like, comment, and subscribe. Hope you enjoy the video!

Chapters:
0:00 Intro and question
0:16 Examples
1:34 DP solution walk through
5:58 Coding walk through
8:07 Time and Space Complexity
Рекомендации по теме
Комментарии
Автор

this one was nice, especially since in c# there's a BitArray class that makes this easy, interesting how just checking the match before consistently would ensure the solution to the problem. in hindsight its a little obvious.

MLGMilk
join shbcf.ru