public class Solution {
    class Interval{
        int left;
        int right;
        Interval(int l,int r){
            left=l;
            right=r;
        }
    }
    public int longestConsecutive(int[] nums) {
        HashMap hm=new HashMap();
        int len=nums.length;
        if(len