Longest Square Streak In Array: Finding Squares And Tracking Lengths
Find longest square streak in array: sort nums, use set for quick lookup, iterate through array & track max length. Time complexity O(n log n), space complexity O(n).
2501. Longest Square Streak in an Array Difficulty: Medium Topics: Array, Hash Table, Binary Search, Dynamic Programming, Sorting 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, or return -1 if there is no square streak. A subsequence is an array that can be derived from another array by deleting some or no elements without changing the orde...