Longest Increasing Subsequence | Dynamic Programming

preview_player
Показать описание

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we explain about subsequences and discuss the Longest Increasing Subsequence problem in dynamic programming, In this problem,

1. You are given a number n, representing the number of elements.
2. You are given n numbers, representing the contents of array of length n.
3. You are required to print the length of longest increasing subsequence of array.

  1. Pepcoding
  2. pepcoding
  3. longest increasing subsequence
  4. longest increasing subsequence dynamic programming
  5. longest increasing subsequence dp
  6. longest increasing subsequence recursion
Рекомендации по теме
Longest Increasing Subsequence 0:18:13

Longest Increasing Subsequence - Dynamic Programming - Leetcode 300

Longest Increasing Subsequence 0:07:09

Longest Increasing Subsequence

Find The Longest 0:19:21

Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals

Dynamic Programming | 0:06:36

Dynamic Programming | Set 3 (Longest Increasing Subsequence) | GeeksforGeeks

Longest Increasing Subsequence 0:28:25

Longest Increasing Subsequence (Dynamic Programming)

Number of Longest 0:22:12

Number of Longest Increasing Subsequence - Dynamic Programming - Leetcode 673 - Python

Longest increasing subsequence 0:20:44

Longest increasing subsequence

DP 41. Longest 0:24:35

DP 41. Longest Increasing Subsequence | Memoization

Longest Increasing Subsequence 0:17:18

Longest Increasing Subsequence Dynamic Programming

DP 43. Longest 0:16:27

DP 43. Longest Increasing Subsequence | Binary Search | Intuition

Longest Increasing Subsequence 0:12:03

Longest Increasing Subsequence in nlogn time

Longest Increasing Subsequence 0:08:32

Longest Increasing Subsequence - Leetcode 300 - Dynamic Programming (Python)

16. Dynamic Programming, 0:58:44

16. Dynamic Programming, Part 2: LCS, LIS, Coins

Longest Increasing Subsequence 0:34:55

Longest Increasing Subsequence + Dynamic Programming

Longest Increasing Subsequence 0:05:24

Longest Increasing Subsequence O(n log n) dynamic programming Java source code

Longest Increasing Subsequence 0:16:34

Longest Increasing Subsequence (LIS) | Dynamic Programming | CP Course | EP 92

Longest Increasing Subsequence 0:28:11

Longest Increasing Subsequence (LeetCode 300) | Detailed solution with animations and diagrams

The Longest Increasing 0:16:59

The Longest Increasing Subsequence

4.9 Longest Common 0:23:35

4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

Dynamic Programming #1: 0:09:58

Dynamic Programming #1: Longest Increasing Subsequence

Longest Increasing Subsequence 0:01:50

Longest Increasing Subsequence (LIS) - O(NlogN) | Searching - Animation - Solutions - inDepth

5 Simple Steps 0:21:27

5 Simple Steps for Solving Dynamic Programming Problems

Longest Increasing Subsequence 0:26:16

Longest Increasing Subsequence | Dynamic Programming

Number of Longest 0:00:11

Number of Longest Increasing Subsequence || LeetCode || 673 || Dynamic Programming || Live Solving

Комментарии
Автор

I have never commented on any channel but you are the mentor I was looking for years. I have watched many youtube videos on dp, no one explained the 'WHY'. Great explanation, great content...specially the way of teaching. JABRA FAN BANGYA DADA .

carpediem
Автор

The best lecture series available on youtube for DP

anchalpandey
Автор

Seriously, you guys have proved, that Indians have so much talent and some of the best explanations... Sincere thanks for the fantastic videos.

debbh
Автор

sir jis tarah se ap samjhate ho hr problem asan lgti h
yeh question pehli bar itna acche se samajh aya h

Codey_
Автор

I am watching tutorials from last couple of years, you are one of the best teacher. Amazing

kasifreza
Автор

I tried to look for the answer in many other channels but no one explained the way you did from scratch. Thank you sir it's really amazing

ayushiagarwal
Автор

I have watched several videos but have never seen such a detailed explanation. Hats off to you bro. Thanks a lot.

sandeepgampa
Автор

Your channel deserves Millions of followers 👍

sarangr
Автор

million dollar content. Thank you so much sir.

SonuKhan-mpyn
Автор

Hands down all other channels were jzt telling the algo but not the intimation and the reason but u xplained it well 🔥

abhinavshukla
Автор

You are guru of coding ...Best teacher ever

mansigoyal
Автор

the best explanation i got for this problem. Sir i have learnt a lot from you. You are really a bliss

gauravjha
Автор

I'm literally amazed sir ji! I watched this video at almost 3:50 am in the middle of the night when I was struggling to sleep, and I still can't believe I actually understood the whole approach and concept of this popular classical dp problem. Thankyou so much Sir ♥️ @pepcoding you simply rock! Can't wait to mark the submission for this question on your platform in the morning ⚡⚡

_HarshitSharma
Автор

Thank you sir for posting amazing content for free 😀😀. I am sure many students will get benefit from these videos.

rahulbhatia
Автор

explained it very well sir.... aapka style hi alg hai smjane ke.

adeshgangwar
Автор

Wow!! What else can be better than this explanation.

adityaojha
Автор

Very nice and crystal clear explanation. I loved the concept of answering the 'what' and 'how' and then answering the 'why' of the problem. Loved it!!

abhisheksharma
Автор

this is by far the best explanation according to me

omegzable
Автор

One thing that makes u different and beautiful is thinking about what ..why and how of problem.lots of love sir ji

Impromptu
Автор

you deserve million subscribers ... lots of love❤️❤️❤️

saisriangajala