CareerCup

static int buyMaximumCards(List<Integer> sisCards, int amount) {
        if (amount == 0) {
            return 0;
        }
        int result = 0;
        int card = 1;
        while (amount > 0 && card <= amount) {
            if (!sisCards.contains(card) && amount >= card) {
                result++;
                amount -= card;
            }
            card++;
        }
        return result;
    }

Full java code

package org.sr;

class Node {
	Node left;
	Node right;
	int data;

	public Node(int data) {
		this.data = data;
		this.left = this.right = null;
	}
}

public class NthLargestNodeInBST {

	/*
	 * static int curr; static int nThSmallest;
	 * 
	 * static int getNthSmallestNumber( Node root, int n) { curr = n; helper(root);
	 * return nThSmallest; }
	 * 
	 * static void helper(Node root) { if (root != null) { helper(root.left);
	 * curr--; if (curr == 0) { nThSmallest = root.data; return; }
	 * helper(root.right); }
	 * 
	 * }
	 */

	static int curr;
	static int nThLargest;

	static int getNthSmallestNumber(Node root, int n) {
		curr = n;
		helper(root);
		return nThLargest;
	}

	static void helper(Node root) {
		if (root != null) {
			helper(root.right);
			curr--;
			if (curr == 0) {
				nThLargest = root.data;
				return;
			}
			helper(root.left);
		}

	}

	public static void main(String args[]) {

		Node root = new Node(5);
		root.left = new Node(3);
		root.right = new Node(7);
		root.left.left = new Node(2);
		root.left.right = new Node(4);
		root.right.left = new Node(6);
		root.right.right = new Node(8);

		System.out.println(getNthSmallestNumber(root, 1));
		System.out.println(getNthSmallestNumber(root, 2));
		System.out.println(getNthSmallestNumber(root, 3));

	}
}

I think this will work....
static int maxDistance(int[] arr) {
		if (arr == null || arr.length < 2)
			return -1;
		int start = 0;
		int end = arr.length - 1;

		while (start < end) {
			if (arr[start] < arr[end]) {
				return end - start;
			}
			end--;

		}
		return -1;
	}

static void union(int arr1[], int[] arr2) {
		int i = 0, j = 0, k = 0;
		List<Integer> list = new ArrayList<>();
		boolean flag = true;
		while (flag) {
			if (arr1[i] == arr2[j]) {
				list.add(arr1[i]);
				i++;
				j++;
			} else if (arr1[i] < arr2[j]) {
				list.add(arr1[i]);
				i++;
			} else {
				list.add(arr2[j]);
				j++;
			}

			if (j == arr2.length) {
				flag = false;
			}
		}
		if (arr1.length > arr2.length) {
			int min = arr2.length;
			for (int x = min; x < arr1.length; x++) {
				list.add(arr1[x]);
			}
		} else {
			int min = arr1.length;
			for (int x = min; x < arr2.length; x++) {
				list.add(arr2[x]);
			}
		}
		System.out.println();
		for (Integer x : list) {
			System.out.print(x + " ");
		}
	}

package Algorithm.Bit;

public class ElementAppearsOnce {
	
	static int getInteger(int arr[], int n){
		int result = 0;
		int x, sum;
		for(int i=0;i<32;i++){
			sum = 0;
			x = (1<<i);
			for(int j=0;j<n;j++){
				if((arr[j] & x) ==0)
					sum++;
			}
			if(sum%3==0)
				result = result|x;
		}
		
		return result;
	}
	
	public static void main(String args[]){
		int arr[] = {12, 1, 12, 3, 12, 1, 1, 2, 3, 2, 2, 3, 7};
		int n = arr.length;
		int res = getInteger(arr, n);
		System.out.println(res);
	}

}

package Algorithm.Bit;

public class ElementAppearsOnce {

static int getInteger(int arr[], int n){
int result = 0;
int x, sum;
for(int i=0;i<32;i++){
sum = 0;
x = (1<<i);
for(int j=0;j<n;j++){
if((arr[j] & x) ==0)
sum++;
}
if(sum%3==0)
result = result|x;
}

return result;
}

public static void main(String args[]){
int arr[] = {12, 1, 12, 3, 12, 1, 1, 2, 3, 2, 2, 3, 7};
int n = arr.length;
int res = getInteger(arr, n);
System.out.println(res);
}

}

5 sub

it will print [99]

#include<stdio.h>
int main(){

int n,sqroot,i,j;
printf("Enter the number: \n");
scanf("%d", &n);
if(n>10000){
printf("Invalid Entry number should be less than 10000\n");
//return ;
}
else{
for(i=1;i<=100;i++){

if(i *i == n){
sqroot = i;
break;
}
}
if(sqroot == i){
printf("Number is perfect square and square root is %d :", sqroot);
}else{
printf("Not perfect square");
}


}

return 0;
}