Udemy - Dynamic programming by Inside Code

seeders: 0
leechers: 0
Added 4 years ago by freecoursewb in Other

Download Fast Safe Anonymous
movies, software, shows...

Files

Udemy - Dynamic programming by Inside Code (Size: 852 MB)
  1. 0-1 knapsack (problem).html 2.3 KB
  1. Coin change (problem).html 1.6 KB
  1. Directed acyclic graphs in dynamic programming.mp4 30.5 MB
  1. Directed acyclic graphs in dynamic programming.srt 7.6 KB
  1. Edit distance (problem).html 819.2 B
  1. Gold mine (problem).html 2 KB
  1. House robber (problem).html 1.5 KB
  1. IMPORTANT.html 307.2 B
  1. Longest common subsequence (problem).html 819.2 B
  1. Longest increasing subsequence (problem).html 1 KB
  1. Minimum cost for tickets (problem).html 2.2 KB
  1. Minimum cost path problem.mp4 112.2 MB
  1. Minimum cost path problem.srt 36.4 KB
  1. Partition (problem).html 1.5 KB
  1. Paths in matrix (problem).html 2 KB
  1. Rod cutting (problem).html 2.1 KB
  1. Shortest common supersequence (problem).html 921.6 B
  1. Square matrix of ones (problem).html 2 KB
  1. Subset sum (problem).html 1.5 KB
  1. Top-down approach (memoization).mp4 44.1 MB
  1. Top-down approach (memoization).srt 15 KB
  1. Ways to climb (problem).html 2.1 KB
  1. Ways to decode (problem).html 2.6 KB
  1.1 minimum cost path.pptx 1.8 MB
  2. 0-1 knapsack (solution).mp4 76.6 MB
  2. 0-1 knapsack (solution).srt 23.8 KB
  2. Bottom-up approach (tabulation).mp4 27.5 MB
  2. Bottom-up approach (tabulation).srt 10.3 KB
  2. Coin change (solution).mp4 36 MB
  2. Coin change (solution).srt 11.5 KB
  2. Edit distance (solution).mp4 53.9 MB
  2. Edit distance (solution).srt 18 KB
  2. Gold mine (solution).mp4 52.2 MB
  2. Gold mine (solution).srt 15.4 KB
  2. House robber (solution).mp4 30.8 MB
  2. House robber (solution).srt 14 KB
  2. How to solve almost any dynamic programming problem.mp4 39.3 MB
  2. How to solve almost any dynamic programming problem.srt 12.7 KB
  2. Longest common subsequence (solution).mp4 41.8 MB
  2. Longest common subsequence (solution).srt 14 KB
  2. Longest increasing subsequence (solution).mp4 62.7 MB
  2. Longest increasing subsequence (solution).srt 27.6 KB
  2. Minimum cost for tickets (solution).html 8.7 KB
  2. Minimum cost path problem (code).html 1.9 KB
  2. Partition (solution).mp4 20.1 MB
  2. Partition (solution).srt 6.7 KB
  2. Paths in matrix (solution).mp4 45.9 MB
  2. Paths in matrix (solution).srt 19.2 KB
  2. Rod cutting (solution).html 10.2 KB
  2. Shortest common supersequence (solution).mp4 44.8 MB
  2. Shortest common supersequence (solution).srt 16.3 KB
  2. Square matrix of ones (solution).html 8.1 KB
  2. Subset sum (solution).html 9.3 KB
  2. Ways to climb (solution).mp4 33.8 MB
  2. Ways to climb (solution).srt 10.5 KB
  2. Ways to decode (solution).html 11.7 KB
  2. What is dynamic programming.mp4 44.7 MB
  2. What is dynamic programming.srt 13.5 KB
  2.1 0-1 knapsack.pptx 1.9 MB
  2.1 coin change.pptx 928.5 KB
  2.1 gold mine.pptx 1.1 MB
  2.1 house robber.pptx 791.7 KB
  2.1 lcsubsequence.pptx 1.4 MB
  2.1 longest increasing subsequence.pptx 1.4 MB
  2.1 min cost tickets.pptx 1.1 MB
  2.1 partition problem.pptx 590.4 KB
  2.1 paths in matrix.pptx 789 KB
  2.1 rod cutting.pptx 1.1 MB
  2.1 scs.pptx 935.7 KB
  2.1 square matrix of ones.pptx 1.2 MB
  2.1 subset sum.pptx 874.7 KB
  2.1 ways to climb.pptx 1.2 MB
  2.1 ways to decode.pptx 1.2 MB
  3. 0-1 knapsack (code).html 1.8 KB
  3. Coin change (code).html 1.4 KB
  3. Edit distance (code).html 1.8 KB
  3. Gold mine (code).html 1.8 KB
  3. House robber (code).html 921.6 B
  3. Longest common subsequence (code).html 1.3 KB
  3. Longest increasing subsequence (code).html 1.1 KB
  3. Minimum cost for tickets (code).html 1.6 KB
  3. Partition (code).html 716.8 B
  3. Paths in matrix (code).html 1.6 KB
  3. Reminder on recursion.mp4 25.8 MB
  3. Reminder on recursion.srt 10.3 KB
  3. Rod cutting (code).html 716.8 B
  3. Shortest common supersequence (code).html 2 KB
  3. Square matrix of ones (code).html 1.9 KB
  3. Subset sum (code).html 1.3 KB
  3. Top-down vs Bottom-up.mp4 10.7 MB
  3. Top-down vs Bottom-up.srt 3.9 KB
  3. Ways to climb (code).html 716.8 B
  3. Ways to decode (code).html 1.5 KB
  Bonus Resources.txt 307.2 B
  Get Bonus Downloads Here.url 204.8 B
  ▲ 95 total files

Description


Dynamic programming by Inside Code
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 42 lectures (4h 3m) | Size: 628.4 MB
Learn how to solve almost any dynamic programming problem with both its approaches (memoization and tabulation)
What you'll learn:
Importance of dynamic programming
How to use the top-down approach of dynamic programming (memoization)
How to use the bottom-up approach of dynamic programming (tabulation)
How to solve almost any dynamic programming problem

Requirements
Programming basics
Algorithms and data structures basics

Description
Dynamic programming is one of the most important and powerful algorithmic techniques that can be used to solve a lot of computational problems, it's a fundamental technique to learn to strengthen your algorithms and problem solving skills

But, a lot of students find hard times understanding dynamic programming and being able to apply it to solve problems, if you are in this situation, this course is made for you!

Related Torrents

torrent name size uploader age seed leech
0
0
0
0
0