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

preview_player
Показать описание
#DataStructures #Animation #Sorted #LIS #Nlgn
Watch this amazing short animation which will give you an overview of how to find the LIS of a given array by applying binary search and reducing the time from O(N^2) to O(NlogN).
Enjoy!

0:00 Problem Statement
0:20 Simulation
  1. inDepth
  2. #animations
  3. #system_design
  4. #data_structures
  5. #algorithms
  6. #graphics
Рекомендации по теме
Longest Increasing Subsequence 0:18:13

Longest Increasing Subsequence - Dynamic Programming - Leetcode 300

Longest Increasing Subsequence 0:07:09

Longest Increasing Subsequence

Longest Increasing Subsequence 0:01:50

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

DP 43. Longest 0:16:27

DP 43. Longest Increasing Subsequence | Binary Search | Intuition

DP 41. Longest 0:24:35

DP 41. Longest Increasing Subsequence | Memoization

Longest Increasing Subsequence 0:16:34

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

16. Dynamic Programming, 0:58:44

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

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:05:24

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

Longest Increasing Sub-sequence(LIS). 0:08:43

Longest Increasing Sub-sequence(LIS).

Longest Increasing Subsequence 0:28:11

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

Longest Increasing Subsequence 0:12:03

Longest Increasing Subsequence in nlogn time

Longest increasing subsequence 0:20:44

Longest increasing subsequence

Longest Increasing Subsequence 0:08:32

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

DP 42. Printing 0:25:57

DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm

Longest Increasing Subsequence 0:28:25

Longest Increasing Subsequence (Dynamic Programming)

Longest Increasing Subsequence 0:21:00

Longest Increasing Subsequence NlogN | Leetcode #300 | LIS

LIS in O(nlogn) 0:41:10

LIS in O(nlogn) with printing solution | Day 4 Part 1 | Dynamic Programming workshop | Vivek Gupta

Longest Increasing Subsequence 0:16:07

Longest Increasing Subsequence LIS (DP) - Algorithm - Online Class - JnU - (Bangla)

The Longest Increasing 0:16:59

The Longest Increasing Subsequence

5 Simple Steps 0:21:27

5 Simple Steps for Solving Dynamic Programming Problems

Number of Longest 0:22:12

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

Longest Increasing Subsequence 0:00:51

Longest Increasing Subsequence LIS

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

It will not work.

What if the input was changed to
[10, 9, 2, 5, 3, 7, 101, 6]?

Your algorithm will traverse [10, 9, 2, 5, 3, 7, 101] and find
LIS = [2, 3, 7, 101]

Then it will reach the last element of 6, find 7 in the tail, and replace it with 6.
LIS = [2, 3, 6, 101]

This is not a subsequence.

codyw
Автор

why I am so confusing about this algorithm, it 's will not work probably/
maybe I am wrong!!

hanyK_