Please Login To Continue

Introduction To Dynamic Programming

Lesson 10 of 15 • 8 upvotes • 7:06mins

Avatar

Sanket Kashyap

One of the most important techniques to have in your arsenal. This lesson lays the stepping stones for further Dynamic Programming problems by explaining the hallmarks, Optimal Substructure, and Overlapping Subproblems, with Fibonacci numbers.

Continue on app
1

Overview Of The Course: Ultimate Guide To Acing A Coding Interview

2:47mins

2

Starting With Linked Lists

6:30mins

3

Typical Problems On Linked Lists

8:54mins

4

Binary Trees: Meaning And Associated Terminology

6:03mins

5

Binary Search Trees: Writing, Traversing And Deleting

7:10mins

6

Heaps: Meaning, Types & Implementation

7:49mins

7

Importance Of Binary Search

6:42mins

8

Mergesort: Meaning & Implementation

8:03mins

9

Quicksort: Meaning & Coding

8:53mins

10

Introduction To Dynamic Programming

7:06mins

11

Levelling Up In Dynamic Programming

9:52mins

12

Learn The Greedy Programming Paradigm

5:46mins

13

Learn Bitwise Operations Tricks

8:23mins

14

Introduction To Graph Theory

6:04mins

15

Breadth First Search And Depth First Search

8:51mins

Crack Campus Placements with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

Similar Plus Courses

thumbnail
ENROLL
HinglishSecurity Issues

Comprehensive Course on Internal Security

Rakesh Verma

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app