2501. Longest Square Streak in an Array

Medium

374

7

You are given an integer array `nums`

. A subsequence of `nums`

is called a **square streak** if:

- The length of the subsequence is at least
`2`

, and **after**sorting the subsequence, each element (except the first element) is the**square**of the previous number.

Return* the length of the longest square streak in *

`nums`

`-1`

A **subsequence** is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

**Example 1:**

Input:nums = [4,3,6,16,8,2]Output:3Explanation:Choose the subsequence [4,16,2]. After sorting it, it becomes [2,4,16]. - 4 = 2 * 2. - 16 = 4 * 4. Therefore, [4,16,2] is a square streak. It can be shown that every subsequence of length 4 is not a square streak.

**Example 2:**

Input:nums = [2,3,5,6,7]Output:-1Explanation:There is no square streak in nums so return -1.

**Constraints:**

`2 <= nums.length <= 10`

^{5}`2 <= nums[i] <= 10`

^{5}

Accepted

20.1K

Submissions

51K

Acceptance Rate

39.5%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved