CareerCup

here is my solution in c++"

void solution(int n, vector<int> positions, int d) {
		vector<int> spreads;
		for(int i = 0; i < n; i++) {
			int spread = 0;
			for(int j = 0; j < n; j++) {
				if(i != j ) {
					if(abs(positions[j] - positions[i]) <= d) {
						spread++;
					}
				}
			}
			res.push_back(spread);
		}
		
		int minSpread = n;
		int maxSpread = 0;
		int minSpreadIndex = 0;
		int maxSpreadIndex = 0;
		
		for(int i = 0; i < n; i++) {
			if(minSpread < res[i]) {
				minSpread = res[i];
				minSpreadIndex = i;
			}
			
			if(maxSpread > res[i]) {
				maxSpread  = res[i];
				maxSpreadIndex = i;
			}
		}

		cout << "max spread happened when person at position" << positions[maxSpreadIndex] << "get contaminated" << endl;
		cout << "min spread happened when person at position" << positions[minSpreadIndex] << "get contaminated" << endl;

	}

import java.util.ArrayList;
import java.util.Stack;

public class T1 {

	private static int totalNum = 5;
	private static int distance = 5;
	private static int[] position = { 1, 3, 5, 9, 14 };

	public static void main(String[] args) {

		ArrayList<ArrayList<Integer>> spreading = new ArrayList<>();

		for (int i = 0; i < totalNum; i++) {
			ArrayList<Integer> inside = new ArrayList<>();
			for (int j = 0; j < totalNum; j++) {

				if (i == j) {
					continue;
				} else {
					if (position[i] < position[j])
						if (position[i] >= (position[j] - distance)) {
							inside.add(position[j]);
						}
					if (position[i] > position[j])
						if (position[i] <= (position[j] + distance)) {
							inside.add(position[j]);
						}
				}
			} // end for j

			spreading.add(inside);
		} // end for i

		// result
		System.out.println(spreading);

		// Analyze the result
		int max = 0;
		int min = totalNum;

		Stack<Integer> minSpreading = new Stack<>();
		Stack<Integer> maxSpreading = new Stack<>();

		int positionCount = 0;
		for (ArrayList<Integer> inside : spreading) {
			positionCount++;
			int count = 0;
			for (Integer getInside : inside) {
				count++;
			}
			if (count > max) {
				max = count;
				maxSpreading.add(positionCount);

			}
			if (count < min) {
				min = count;
				minSpreading.add(positionCount);
			}
		}

		System.out.println("max : " + maxSpreading.peek());
		System.out.println("min : " + minSpreading.peek());

	}

}