2501. Longest Square Streak in an Array | Leetcode Daily (POTD) 28 Oct 2024 | Java

[@vaibhavgade8573]

Space for hash map can be saved using binary search for every iterative square number. For a streak starting with 2, search for 2, 4, 16.

[@Axel.Blazer]

yes class Solution: def longestSquareStreak(self, nums: List[int]) -> int: nums = set(nums) streak = -1 for num in sorted(nums): cur = 1 nxt = num * num while nxt in nums: cur += 1 nxt = nxt * nxt if cur >= 2: streak = max(streak, cur) return streak if streak!=1 else -1

[@algorithmsbyaditi]

Great work

[@harishbehera7812]

thanx for the video. Radhe Radhe

[@algorithmsbyaditi]

Glad it was helpful !

[@Sumanth2803]

nice explanation. Radhe Radhe

[@algorithmsbyaditi]

Thank you

[@KedarBhawthankar]

nice explaination

[@algorithmsbyaditi]

Thank you

[@rahulsingh-sc1hg]

Hello Ma'am I am beginner in DSA, Would you create a playlist for beginners? Thank you.

[@algorithmsbyaditi]

Will try soon, Thanks.

[@kthamim7552]

post a video in english also mam

[@chad._life]

nice efforts but you could do much better if you invest some more energy and time

[@algorithmsbyaditi]

I will keep improving my solutions. Thank you