aliezzahn / longest-subsequence-with-decreasing-adjacent-difference

Your task is to find the length of the longest subsequence seq of nums, such that the absolute differences between consecutive elements form a non-increasing sequence of integers. In other words, for a subsequence seq0, seq1, seq2, ..., seqm of nums, |seq1 - seq0| >= |seq2 - seq1| >= ... >= |seqm - seqm - 1|.
10Updated last month

Alternatives and similar repositories for longest-subsequence-with-decreasing-adjacent-difference:

Users that are interested in longest-subsequence-with-decreasing-adjacent-difference are comparing it to the libraries listed below