CareerCup

A bad application is one which does not take proper care of :
1)memmory usage,
2)allocation and deallocation of resourse,
3)and where a non UI thread tries to access a UI toolkit.
also for example if we are desging a android based application and we try to call a "implicit intent" without checking getPackageManager().

public static boolean detectcycle(int array[]){
		int startindex= 0;
		int count=1;
		for(int i=1;i<=array.length/2;i++){
			//detect cycle
			if(array[i]==array[startindex]){
				//store lastIndex or one cycle
				int lastIndex=i-1;
				//System.out.println(lastIndex);
				while(startindex<=lastIndex&&i<array.length){
					if(array[i]==array[startindex]){
						i++;
						startindex++;
					}
					else {
						System.out.println("no cycle found");
						return false;
					}
					
				}
				
				System.out.println("cycle length is : "+count);
				
			}
			else{
				count++;
			}
		}
		return true;
	}

modify the inorder traversal and at each recursive call instead of printing the root, add the root.key into a array with constraint that this root.key> array[lastIndex].

Use TreeSet as dictinary to hold all the possible valid strings, and for each word typed by user invoke a webservices, which return all the string with prefix typed by user.

int[] array = new int[10];
		Arrays.fill(array, 0);
		array[0]++;
		int N= 12;
		for(int i=1;i<=N;i++){

			int temp=i;
			while(temp>0){
				int rem= temp%10;
				array[rem]++;
				temp=temp/10;
			}

		}
		for(int k=0;k<10;k++){
			System.out.println(array[k]);	
		}

if(row%2!=0&&col%2!=0){// if odd number of element
			int midRow= row/2;
			int midCol=col/2;
			System.out.println("median is : "+matrix[midRow][midCol]);
		}
		else //if even number of elements
		{
			int midrow1=0,midrow2=0,midcol1=0,midcol2=0;
			if(row%2==0){
				midrow1=row/2;
				midrow2=midrow1-1;
			}
			if(row%2!=0){
				midrow1=row/2;
				midrow2=midrow1;
			}
			if(col%2==0){
				midcol1=col/2;
				midcol2=midcol1-1;
			}
			if(col%2!=0){
				midcol1=col/2;
				midcol2=midcol1;
			}
			int median = matrix[midrow1][midcol1]+matrix[midrow2][midcol2];
			System.out.println("median is elseloop :"+median/2);
		}