Dynamic Programming for Competitions and Interviews
3.3 (2 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
142 students enrolled

Dynamic Programming for Competitions and Interviews

Master Dynamic Programming for your Coding Interviews and Competitive Programming.
3.3 (2 ratings)
Course Ratings are calculated from individual students’ ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately.
142 students enrolled
Created by Abhishek Kumar
Last updated 6/2020
English
English [Auto]
Current price: $139.99 Original price: $199.99 Discount: 30% off
5 hours left at this price!
30-Day Money-Back Guarantee
This course includes
  • 7.5 hours on-demand video
  • 5 downloadable resources
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
Training 5 or more people?

Get your team access to 4,000+ top Udemy courses anytime, anywhere.

Try Udemy for Business
What you'll learn
  • Dynamic Programming concepts
Requirements
  • Basic programming skills in any language.
Description

This course starts with explaining the need for applying Dynamic Programming, followed by the 2 approaches of Dynamic Programming namely Bottom-Up (Tabulation) and Top-Down (Memoization).

And finally explanation and codes for some of the major Dynamic Programming Problems are given.

Dynamic Programming is an important component of Programming Interviews at Big Software companies like Google, Facebook, Amazon, Microsoft, Adobe, etc. It's also useful for Competitive programming.

Who this course is for:
  • Programmers, software engineers
Course content
Expand all 23 lectures 07:33:55
+ Dynamic Programming Problems and Solutions
20 lectures 06:57:52
Fibonacci numbers using Dynamic Programming
13:35
Jumping on the Clouds - Hackerrank
13:08
Longest Increasing Subsequence
17:07
0/1 Knapsack Problem
17:59
Rod Cutting Problem
17:59
Ugly Numbers
20:58
Egg Dropping Puzzle
22:08
Egg Dropping Puzzle - C++ Code
13:29
Minimum Path Sum
17:49
Length of Longest Common Subsequence (LCS) - C++ Java Python
28:56
Maximal Square in Binary matrix
35:52
Uncrossed Lines
23:55
Counting Set Bits
15:05
Edit Distance
27:21
Coin Change 2 - Unlimited Coins
25:05
Largest Divisible Subset
37:10
Dungeon Game
23:58
Number of Unique BSTs with given numbers - Catalan Number
16:15
Perfect Squares sum to N
18:02
Unique Paths
12:01