How should I practice Longest Sorted Adjacent-Difference Subsequence?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Atlassian online assessment problems in FastPrep.

Is Longest Sorted Adjacent-Difference Subsequence associated with Atlassian?

FastPrep tags this as a Atlassian online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Longest Sorted Adjacent-Difference Subsequence

Learn this problem

● Medium

AtlassianINTERNFULLTIMEOA

Problem statement

Select a subsequence, then sort its values. In the sorted result, every adjacent difference must be either 0 or 1. Return the maximum possible subsequence length.

Function

longestAdjacentDifferenceSubsequence(arr: int[]) → int

Examples

Example 1

arr = [4,2,1,3,2,3]return = 6

After sorting all values become [1,2,2,3,3,4], whose adjacent differences are 0 or 1.

Constraints

1 <= arr.length <= 100000
Values fit in a signed 32-bit integer.