tag

#longest-increasing-subsequence

2 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 960: Delete Columns to Make Sorted III

Problem Restatement We are given an array strs of equal-length strings. We may delete any set of column indices. When we delete a column, that position is removed from every string. After deletions, every remaining row must be lexicographically sorted by itself: strs[row][0] <= strs[row][1] <= strs[row][2] <= ... Return the minimum number of deleted columns. Important: the array of strings does not need to be sorted. Each individual row...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 673: Number of Longest Increasing Subsequence

Problem Restatement We are given an integer array nums . We need to return the number of longest increasing subsequences. A subsequence is formed by deleting zero or more elements without changing the order of the remaining elements. The subsequence must be strictly increasing. Equal adjacent values do not count as increasing. The official problem statement asks for the number of longest increasing subsequences and notes that the sequence must...