Longest Increasing Subsequence

Find the length of the longest increasing subsequence in an array using dynamic programming.

Code

Algorithms

const dp = new Array(arr.length).fill(1);
for (let i = 1; i < arr.length; i++) {
  for (let j = 0; j < i; j++) {
    if (arr[i] > arr[j]) dp[i] = Math.max(dp[i], dp[j] + 1);
  }
}
return Math.max(...dp);

Parameters

arr(array)

Array of numbers

Browser·fetch() may be limited by CORS

More JavaScript Snippets

Array Difference

Find elements in the first array that are not present in the second array.

Array Frequencies

Count how many times each value appears in an array and return a frequency map.

Array Head

Get the first n elements of an array.

Array Intersection

Find common elements that exist in both arrays.

Array Tail

Get the last n elements of an array.

Array Union

Combine two arrays and remove duplicates to produce a union.