Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай Dynamic programming, а также все другие курсы, прямо сейчас!
Премиум
  • Урок 1. 00:08:31
    What is dynamic programming
  • Урок 2. 00:06:56
    Reminder on recursion
  • Урок 3. 00:09:41
    Top-down approach (memoization)
  • Урок 4. 00:06:58
    Bottom-up approach (tabulation)
  • Урок 5. 00:02:20
    Top-down vs Bottom-up
  • Урок 6. 00:05:00
    Directed acyclic graphs in dynamic programming
  • Урок 7. 00:07:47
    How to solve almost any dynamic programming problem
  • Урок 8. 00:24:53
    Minimum cost path problem
  • Урок 9. 00:12:24
    Paths in matrix (solution)
  • Урок 10. 00:09:22
    House robber (solution)
  • Урок 11. 00:09:34
    Longest common subsequence (solution)
  • Урок 12. 00:10:30
    Gold mine (solution)
  • Урок 13. 00:12:32
    Edit distance (solution)
  • Урок 14. 00:07:55
    Ways to climb (solution)
  • Урок 15. 00:11:05
    Shortest common supersequence (solution)
  • Урок 16. 00:07:42
    Coin change (solution)
  • Урок 17. 00:16:40
    0-1 knapsack (solution)
  • Урок 18. 00:10:28
    Subset sum (solution)
  • Урок 19. 00:17:47
    Longest increasing subsequence (solution)
  • Урок 20. 00:13:51
    Ways to decode (solution)
  • Урок 21. 00:04:22
    Partition (solution)
  • Урок 22. 00:12:36
    Rod cutting (solution)
  • Урок 23. 00:09:13
    Square matrix of ones (solution)
  • Урок 24. 00:09:42
    Minimum cost for tickets (solution)
  • Урок 25. 00:20:07
    Interleaving string (solution)
  • Урок 26. 00:19:09
    Count sorted vowel strings (solution)
  • Урок 27. 00:21:52
    Word break (solution)
  • Урок 28. 00:40:56
    Matrix chain problem (solution)