https://github.com/t-kalv/longest-increasing-subsequence

Longest Increasing Subsequence
https://github.com/t-kalv/longest-increasing-subsequence

algorithm

Last synced: 10 days ago
JSON representation

Longest Increasing Subsequence

• Host: GitHub
• URL: https://github.com/t-kalv/longest-increasing-subsequence
• Owner: T-Kalv
• Created: 2020-12-27T14:57:27.000Z (about 4 years ago)
• Default Branch: main
• Last Pushed: 2020-12-27T14:59:58.000Z (about 4 years ago)
• Last Synced: 2023-07-16T13:28:39.061Z (over 1 year ago)
• Topics: algorithm
• Language: Python
• Homepage:
• Size: 2.93 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Longest-Increasing-Subsequence

Longest Increasing Subsequence

You are given an array of integers. Return the length of the longest increasing subsquence (does not have to be necessarily contiguous) in the array.

E.g. [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15]

The following input should return 6.