public class Solution {       public int longestConsecutive(int[] num) {        HashSet
      
        hash=new HashSet
       
        ();        int max=1;        for(int n:num)        {            hash.add(n);        }        int j=0;        while(!hash.isEmpty()&&j
        
         max) max=count;            j++;                                    }                        return max;                                            }}