CareerCup

// the program returns the difference between the smallest and largest prime

import java.util.TreeSet;

public class Difference_Among_Prime {

	public static void main(String[] args) {
		int[] input = { 22, 3, 56, 73, 11, -7, 67, 98 };
		int output = PrimeNumbers(input);
		System.out.println(output);
	}

	static int PrimeNumbers(int[] input) {
		TreeSet<Integer> prime = new TreeSet<Integer>();
		for (int i = 0; i < input.length; i++) {
			if (IsPrime(input[i]))
				prime.add(input[i]);
		}

		int difference = (int) prime.last() - (int) prime.first();
		return difference;
	}

	private static boolean IsPrime(int p) {
		int count = 0;

		boolean flag = false;
		for (int j = 2; j < p / 2; j++) {
			if (p % j == 0)
				count++;
		}
		if (count == 0)
			flag = true;

		else
			flag = false;

		return flag;
	}
}

package career_cup;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class ListOfNumbers {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		System.out.println("enter the number of elements to be entered in the list");
		int count = sc.nextInt();

		List<Integer> al = new ArrayList<Integer>();
		System.out.println("enter the list");
		for (int i = 0; i < count; i++) {
			al.add(sc.nextInt());
		}

		Collections.sort(al, Collections.reverseOrder());

		Set<Integer> set = new TreeSet<Integer>(Collections.reverseOrder());

		int num1 = number(al);

		if (num1 % 3 == 0) {
			System.out.println("the result is " + num1);
		} else {
			subelements(al, set);
			int number = 0;
			int len = set.size();
			Iterator<Integer> itr = set.iterator();
			for (int i = 0; i < len; i++) {
				number = itr.next();
				if (number % 3 == 0) {
					System.out.println("the result is " + number);
					break;
				} else if (i == len - 1) {
					System.out.println("the result is  0");
					break;
				}
			}
		}
	}

	private static void subelements(List<Integer> al, Set<Integer> set) {
		int rem = 0, number;
		for (int i = 0; i < al.size(); i++) {
			rem = al.remove(i);
			number = number(al);
			if (number > 0)
				set.add(number);
			subelements(al, set);
			al.add(i, rem);
		}
	}

	public static int number(List<Integer> al) {
		int len = al.size(), sum = 0;
		for (int i = 0; i < len; i++) {
			sum += al.get(i) * Math.pow(10, len - 1 - i);
		}
		return sum;
	}

}

public class Employee {

	String name;
	Integer id;
	Employee manager;

	public Employee(String name, Integer id, Employee manager) {
		super();
		this.name = name;
		this.id = id;
		this.manager = manager;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public Integer getId() {
		return id;
	}

	public void setId(Integer id) {
		this.id = id;
	}

	public Employee getManager() {
		return manager;
	}

	public void setManager(Employee manager) {
		this.manager = manager;
	}

}

import java.util.ArrayList;
import java.util.Scanner;

public class Employee_Util {

	public static void main(String[] args) {

		Employee ceo = new Employee("CEO", 1, null);
		Employee e1 = new Employee("emp1", 1, ceo);
		Employee e2 = new Employee("emp2", 1, e1);
		Employee e3 = new Employee("emp3", 1, e1);
		Employee e4 = new Employee("emp4", 1, e2);

		ArrayList<Employee> al = new ArrayList<>();
		al.add(ceo);
		al.add(e1);
		al.add(e2);
		al.add(e3);
		al.add(e4);

		System.out.println("enter the manager");
		Scanner s = new Scanner(System.in);
		String name = s.nextLine();
		int count = 0;
		for (Employee i : al) {
			if (i.getName().equalsIgnoreCase(name)) {
				count++;
			}
		}
		if (count > 0)
			getReportees(name, al);
		else
			System.out.println("Invalid Input!! ");
	}

	private static void getReportees(String name, ArrayList<Employee> al) {

		for (Employee e : al) {

			if (e.getName().equalsIgnoreCase("ceo"))
				;

			else if (e.getManager().getName().equalsIgnoreCase(name)) {
				System.out.println(e.getName());
				getReportees(e.getName(), al);
			}

		}

	}

}