From f1dc33f2e5b1ac5d2374c9da44f3ee724b2f4dc0 Mon Sep 17 00:00:00 2001
From: darksoul-7 <110017411+darksoul-7@users.noreply.github.com>
Date: Tue, 11 Oct 2022 10:31:50 +0530
Subject: [PATCH] Check the new corrected code

The previous code have an error in it. so please check the new code
---
 Hashmaps:Longest consecutive Sequence | 121 ++++++++++++++++----------
 1 file changed, 74 insertions(+), 47 deletions(-)

diff --git a/Hashmaps:Longest consecutive Sequence b/Hashmaps:Longest consecutive Sequence
index ab7b6b5..a3aa4f0 100644
--- a/Hashmaps:Longest consecutive Sequence	
+++ b/Hashmaps:Longest consecutive Sequence	
@@ -5,61 +5,88 @@ import java.util.HashMap;
 import java.util.ArrayList;
 public class Solution {
 	public static ArrayList<Integer> longestConsecutiveIncreasingSequence(int[] arr) {
-		HashMap<Integer,Boolean> map = new HashMap<>();
-        ArrayList<Integer> output = new ArrayList<>();
-        
-        for(int i=0;i<arr.length;i++){
+	public static ArrayList<Integer> longestConsecutiveIncreasingSequence(int[] arr) {
+		ArrayList<Integer> output = new ArrayList<>();
+        HashMap<Integer, Boolean> map = new HashMap<>();
+        HashMap<Integer, Integer> lenMap = new HashMap<>();
+        for (int i=0 ; i < arr.length ; i++)
+        {
             map.put(arr[i],true);
         }
+        int maxStart=-1,maxLen=0;
+        boolean startCheck=true;
         
-        int maxlength = 0;
-        int start  = 0;
-        
-        for(int i=0;i<arr.length;i++){
-            if(map.get(arr[i])){
-                int length = 0;
-                int temp = arr[i];
-                while(map.containsKey(temp)){
-                    length++;
-                    map.put(temp,false);
-                    temp = temp+1;
-                }
-                int starttemp = arr[i];
-                temp = arr[i]-1;
-                while(map.containsKey(temp)){
-                    length++;
-                    map.put(temp,false);
-                    starttemp = temp;
-                    temp = temp-1;
-                }
+        for (int i: arr)
+        {
+            if (map.get(i))
+            {
+                int currStart=i,currLen=1;
+                
+                boolean flag=true;
+                map.put(i,false);
                 
-                if(length > maxlength){
-                    maxlength = length;
-                    start = starttemp;
-                }else if(length == maxlength){
-                    maxlength = length;
-                    //start = 10 starttemp = 4
-                    for(int j=0;j<arr.length;j++){
-                        if(arr[j] == start){
-                            start = start;
-                            break;
-                        }else if(arr[j] == starttemp){
-                            start = starttemp;
-                            break;
-                        }
+                int ahead=i+1;
+                
+                while(flag)
+                {
+                    if(map.containsKey(ahead))
+                    {
+                    
+                        currLen=currLen+1;
+                        map.put(ahead,false);
+                        ahead=ahead+1;
+                        
+                    }
+                    else
+                    {
+                     	flag=false;   
                     }
                 }
+               flag=true; 
+               int before=i-1;
+               
+                while(flag)
+                {
+                    if(map.containsKey(before))
+                    {
+                        
+                        currLen=currLen+1;
+                        currStart=before;
+                        map.put(before,false);
+                        before=before-1;
+                        
+                    }
+                    else
+                    {
+                     	flag=false;   
+                    }
+                }
+               
+               System.out.println();
+               if (currLen>=maxLen)
+               {
+                   maxLen=currLen;
+                   maxStart=currStart;   
+                   lenMap.put(maxStart,maxLen); 
+               }
             }
-            // else{
-            //     continue;
-            // }
+            
         }
         
-       for(int i = start;i<start+maxlength;i++){
-           output.add(i);
-       }
         
-        return output;
         
-	}
-    
+        
+        for (int i=0;i<arr.length;i++)
+        {
+            if (lenMap.containsKey(arr[i]) && lenMap.get(arr[i])>=maxLen)
+            {
+                maxStart=arr[i];
+                maxLen=lenMap.get(arr[i]);
+                break;
+            }
+        }
+        output.add(maxStart);
+        output.add(maxStart+maxLen-1);
+        return output;
+    }
+    }