Find Common elements from two same sized Integer Arrays(Unsorted) in O(n) without sorting either of them.

Question

Anon · Accepted Answer

Hash 1 Array 1
Look up for each element in Array 2
Append to common element array if found.
O(N)

Slick · Answer

That is N*N complexity, cleverly disguised as single loop. Resetting i every time it reaches N and incrementing j does it.

V · Answer

#include

main()
{
	//take arrays of three elements for comparision
	int a[3]={1,2,3};
	int b[3]={1,4,2};
	
	int i,j;
	j=0;
	
	for(i=0;i<3;i++)
	{
		
		if(a[i]==b[j])
		{
			printf("common elements are:%d
",a[i]);
		}
		
		if(i==2&j!=2)
		{
			i=0;
			j++;
		}
	}
}

Amazon

Amazon Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches