Dynamic Programming For Competitions And Interviews

Master Dynamic Programming for your Coding Interviews and Competitive Programming.

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.

Overview

Section 1: Introduction

Lecture 1 Introduction

Section 2: Dynamic Programming - Concepts and Approaches

Lecture 2 Introduction to Dynamic Programming

Lecture 3 Dynamic Programming Approaches - Tabulation and Memoization

Section 3: Dynamic Programming Problems and Solutions

Lecture 4 Fibonacci numbers using Dynamic Programming

Lecture 5 Climbing Stairs

Lecture 6 Jumping on the Clouds - Hackerrank

Lecture 7 Longest Increasing Subsequence

Lecture 8 0/1 Knapsack Problem

Lecture 9 Rod Cutting Problem

Lecture 10 Ugly Numbers

Lecture 11 Egg Dropping Puzzle

Lecture 12 Egg Dropping Puzzle - C++ Code

Lecture 13 Minimum Path Sum

Lecture 14 Length of Longest Common Subsequence (LCS) - C++ Java Python

Lecture 15 Maximal Square in Binary matrix

Lecture 16 Uncrossed Lines

Lecture 17 Counting Set Bits

Lecture 18 Edit Distance

Lecture 19 Coin Change 2 - Unlimited Coins

Lecture 20 Largest Divisible Subset

Lecture 21 Dungeon Game

Lecture 22 Number of Unique BSTs with given numbers - Catalan Number

Lecture 23 Perfect Squares sum to N

Lecture 24 Unique Paths

Lecture 25 Best time to Buy and Sell Stocks with Cooldown

Lecture 26 Best time to Buy and Sell Stocks (2 Transactions)

Lecture 27 Cost for Train Tickets

Lecture 28 House Robber

Programmers, software engineers