int maxLen(int[] arr){ Set<Integer> set1=new HashSet<>(); for(int key:arr){ set1.add(key); } Set<Integer> set2=new HashSet<>(); int ans=1; for(int i=0;i<arr.length;i++){ if(!set2.contains(arr[i])){ int len=1; int count=1; while(set1.contains(arr[i]+count)){ set2.add(arr[i]+count); len++; count++; } count=1; while(set1.contains(arr[i]-count)){ set2.add(arr[i]-count); len++; count++; } ans=Math.max(ans,len); } } return ans; }