CareerCup

Answer is - 20
# of process type - 1 = 10
# of process type - 2 = 8

+ one parent and one grand-child from parent.

with temp_view as (
select *,ROW_NUMBER() over(partition by a1,a2 order by a2 desc) as row_no from test2
)
delete from temp_view where row_no<>1;

firefox driver is already present as the default selenium package. Hence, you dont need to provide the path explicitly. And yes, chrome and firefox drivers work in the same way!

There is no concept of client mode / server mode as provided above.

3 step solution:
1. build the 1st hashmap with <word,occurrence> pair.
2. build the 2nd hashmap with <occurrence,array of words> pair.
3. Print 2nd hashmap on increasing order of occurrence.

static objects use the heap area , which is common access to all threads. We need to apply synchronization techniques (semaphore,mutex,lock etc) to deal with it.

synchronized keyword in java is also very handy to use.

switch 1 - switch on then switch off. -> corresponding bulb will be off but warm
switch 2 - switch on -> corresponding bulb will be on and warm
switch 3 - switch off -> corresponding bulb will be cool and off.

int sum(int a,int b)
{

	if(a>=0 && b>=0)
	{
		for(int i=0;i<b;i++)
			a++;
		return a;
	}
	else if(a<0)
	{
		for(int i=a;i<0;i++)
			b--;
		return b;
	}
	else
	{
		for(it i=b;i<0;i++)
			a--;
		return a;
	}

}

1. buy a book with a valid credit card with different payment gateways.
2. proceed to buy a book with wrong credit card details.
3. failed transaction cases. fails (wrong password,otp) , authorization fails(over limit, over transaction frequency, security issues ), page time out cases.
4. save to cart. And checkout in the next login.

public static void main(String []args)
	{
		int a[] = {2,5,8,9};
		int b[] = {6,3,4,7,1};
		
		int c[] = new int[a.length+b.length];
		
		//copy both a,b to c
		int i=0;
		for(int j=0;j<a.length;j++)
			c[i++] = a[j];

		for(int j=0;j<b.length;j++)
			c[i++] = b[j];

		//now merge sort
		Arrays.sort(c);
		System.out.println(Arrays.toString(c));
	}

public int[] getTriangleSides(int[] segments)
	{
		int []output={};
		List<Integer> out = new ArrayList<Integer>();
		
		
		for(int i=0;i<segments.length;i++)
		{
			out.add(segments[i]);
		}
		
		out.sort(null);
		
		//the tripplet will come in order if exists after sorting
		int i=0,j=1;
		for(int k=2;k<segments.length;i++,j++,k++)
		{
			//assume segments[i],segments[j],segments[k] are three sides of a triangle
			if( segments[i]+segments[j]>segments[k] && 
					segments[j]+segments[k]>segments[i] &&
						segments[k]+segments[i]>segments[j])
			{
				output[0]=segments[i];
				output[1]=segments[j];
				output[2]=segments[k];
				break;
			}
		
		}
		
		return output;
	}

BufferedReader br  = new BufferedReader(new InputStreamReader(System.in));
		System.out.println("Text:");
		String text = br.readLine();
		
		System.out.println("Prefix:");
		String prefix = br.readLine();
		System.out.println("Suffix:");
		String suffix = br.readLine();
		
		String output = "";
		int max_prefix_count = 0, prefix_count = 0,
			max_suffix_count = 0, suffix_count = 0, 
			sstr_start = 0, sstr_end = 0,
			i=0,j=0;
		
		while(i<text.length())
		{
			int k=i,start=-1,end=-1;
			j=0;prefix_count = 0;
			
			while((k<text.length() && j<prefix.length()) 
					&& (text.charAt(k) != prefix.charAt(j)))
			j++;
			
			while((k<text.length() && j<prefix.length()) 
					&& (text.charAt(k) == prefix.charAt(j)))
			{
				if(start == -1)
					start = k;
				
				prefix_count++;
				k++; j++;
			}

			//update prefix index as we get the new string.
			if(prefix_count > max_prefix_count)
			{
				max_prefix_count = prefix_count;
				sstr_start = start;
			}

			k=i;j=0;
			suffix_count = 0;

			while((k<text.length() && j<suffix.length()) 
					&& (text.charAt(k) != suffix.charAt(j)))
				j++;
			
			while((k<text.length() && j<suffix.length()) 
					&& (text.charAt(k) == suffix.charAt(j)))
			{
				suffix_count++;
				k++; j++;
			}

			end = k;
			
			//update prefix index as we get the new string.
			if(suffix_count > max_suffix_count)
			{
				max_suffix_count = suffix_count;
				sstr_end = end;
			}
			i++;
		}
		if(sstr_end>sstr_start)
			System.out.println("output:"+text.substring(sstr_start, sstr_end));
		else
			System.out.println("output:"+text.substring(sstr_start));