private static Node intersection(Node l1, Node l2){
		int len1=findLength(l1);
		int len2=findLength(l2);
		if(len1>len2){
			int diff = len1-len2;
			while(diff-->0){
				l1=l1.next;
			}
		} else {
			int diff = len2-len1;
			while(diff-->0){
				l2=l2.next;
			}
		}
		while(l1!=null && l2!=null){
			if(l1 == l2) return l1;
			l1=l1.next;
			l2=l2.next;
		}
		return null;
	}