Longest Even-Spaced Increasing Subsequence | Dataford Interview Questions

Implement a function to find the longest evenly spaced increasing subsequence in an array. The function receives a list of integers and returns the length of the longest subsequence whose elements are strictly increasing and have the same positive difference between consecutive values. Elements must remain in their original order, and return 0 for an empty array.

Constraints

0 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
A subsequence must preserve the original array order
The common difference must be positive

Function Signature

def longest_evenly_spaced_subsequence(nums):

Your question is Longest Even-Spaced Increasing Subsequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

0 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
A subsequence must preserve the original array order
The common difference must be positive

Function Signature

def longest_evenly_spaced_subsequence(nums):

Your question is Longest Even-Spaced Increasing Subsequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.