import java.util.*; public class Solution { public int findKth(int[] a, int n, int K) { // write code here if (a == null || n == 0 || K < 1 || K > n){ return -1; } return partition(a, 0, n - 1, n - K); } private int partition(int[] a, i...