From bb1cf55192e3c45b1de8abea1eadf1737e5480dd Mon Sep 17 00:00:00 2001
From: chayan das <110921638+Chayandas07@users.noreply.github.com>
Date: Mon, 28 Oct 2024 22:28:26 +0530
Subject: [PATCH] Create 2501. Longest Square Streak in an Array

---
 2501. Longest Square Streak in an Array | 32 +++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 2501. Longest Square Streak in an Array

diff --git a/2501. Longest Square Streak in an Array b/2501. Longest Square Streak in an Array
new file mode 100644
index 0000000..113ed96
--- /dev/null
+++ b/2501. Longest Square Streak in an Array	
@@ -0,0 +1,32 @@
+class Solution {
+public:
+    int longestSquareStreak(vector<int>& nums) {
+        int longestStreak = -1,n;
+        n = nums.size();
+        vector<int> presenceChecker(100001,0);
+
+        // Keeping track of presence of each element of nums array in presenceChecker array.
+        for(int i=0;i<n;i++)
+            presenceChecker[nums[i]] = 1;
+
+        // Applying our algorithm for each element in nums array.
+        for(int i=0;i<n;i++){
+            long long int curr = nums[i];
+            int currLongestStreak = 1;
+            while(true){
+                if(curr*curr<100001 && presenceChecker[curr*curr] == 1){
+                    currLongestStreak++;
+                    curr = curr*curr;
+                }
+                else
+                    break;
+            }
+            // if there is atleat 1 next square present in the array then currLongestStreak will
+            // be always greater than 1.
+            if(currLongestStreak != 1)
+                longestStreak = max(longestStreak,currLongestStreak);
+        }
+
+        return longestStreak;
+    }
+};