CareerCup

public static int getDivisors(int[] arr) {//2,4,5,8
		//traverse in reverse
		int j=0;
		int count=0;
		Arrays.sort(arr);
		//System.out.println(arr[3]);
		for(int i=arr.length-1;i>0 ;i--) {//i=3
			j=i-1;//j=2
			//System.out.println(j);
			while(j>=0) {
			// System.out.println(j);
			if (arr[i]%arr[j]==0 && arr[j]!=arr[i]) {
				count++;
				//System.out.println(arr[j] + "," + arr[i]);
			
				j--;
				
			}
			else {
				j--;
			}
			//System.out.println(i + "," + j);
			//j--;
			
			
		}

public static boolean findTriplet(int[] arr,int sum) {
		int l,r;
		
		 //sum=9;
		Arrays.sort(arr);//2,3,4,6
		for(int i=0;i<arr.length-2;i++) {
			l=i+1;
			r=arr.length-1;
			
			while(l<r) {
				if(arr[i]+arr[l]+arr[r]==sum)
					return true;
				else if(arr[i]+arr[l]+arr[r] < sum)
					l++;
				else
					r--;
					
			}
			
			
		}
		
		return false;
	}

public class MergeLists {
	
	Node root;
	Node root2;
	
	class Node{
		int data;
		private Node next;
		
		public Node(int data) {
			this.data=data;
			
		}
	}
	
	public void buildFirstList() {
		
		root=new Node(1);
		
		Node n1=new Node(2);
		root.next=n1;
		Node n2=new Node(3);
		n1.next=n2;
		Node n3=new Node(4);
		n2.next=n3;
		
		
		
		
		
	}
	
	public void buildSecondList() {
		root2=new Node(10);
		Node n1=new Node(20);
		root2.next=n1;
		Node n2=new Node(30);
		n1.next=n2;
		Node n3=new Node(40);
		n2.next=n3;
		
		
	}
	
	public void traverseAlt(Node n,Node n2) {
		n=root;
		n2=root2;
		while(n!=null && n2!=null) {
			System.out.println(n.data);
			System.out.println(n2.data);
			n=n.next;
			n2=n2.next;
		}
		
		if(n==null && n2!=null) {
			
			return;
			
	}
		
		else if(n2==null && n!=null){
			
			return;
			
		}
		

}
	
	public void traverse(Node n) {
		while(n!=null) {
			System.out.println(n.data);
			n=n.next;
		}
	}
	
	public static void main(String args[]) {
		MergeLists ml=new MergeLists();
		ml.buildFirstList();
		ml.buildSecondList();
		
		ml.traverseAlt(ml.root, ml.root2);
		//ml.traverse(ml.root2);
	}

}