CareerCup

Language - Java
private static int findCloseNumber(int[] input, int targetNumber) {
int minimumDistance = Integer.MAX_VALUE;
int nearNumber = 0;
for (int i = 0; i < input.length; i++) {
if (input[i] == targetNumber) {
nearNumber=input[i];
break;
}else{
int tmpMinimumDistance = Math.abs(targetNumber - input[i]);
if (tmpMinimumDistance < minimumDistance) {
minimumDistance = tmpMinimumDistance;
nearNumber=input[i];
}
}
}
return nearNumber;
}

Language Java
private static int findCloseNumber(int[] input, int targetNumber) {
int minimumDistance = Integer.MAX_VALUE;
int nearNumber = 0;
for (int i = 0; i < input.length; i++) {
if (input[i] == targetNumber) {
nearNumber=input[i];
break;
}else{
int tmpMinimumDistance = Math.abs(targetNumber - input[i]);
if (tmpMinimumDistance < minimumDistance) {
minimumDistance = tmpMinimumDistance;
nearNumber=input[i];
}
}
}
return nearNumber;
}

Language - Java
private static int InsertComma(String input, int i) {
StringBuilder sb = new StringBuilder();
int j = 0;
int size = input.length();
while (j < size) {
StringBuilder tmp = new StringBuilder();
for (int j2 = 0; j2 < i; j2++) {
if (j < size) {
tmp.append(input.charAt(j));
}
j++;
}
sb.append(tmp);
if (j < size) {
sb.append(",");
}
}
String []st=sb.toString().split(",");
int max=0;
for (int i1 = 0; i1 < st.length; i1++) {
int tmp=Integer.parseInt(st[i1]);
if(tmp>max){
max=tmp;
}
}
return max;
}

String []st=input.split(",");
List<String> list=new ArrayList<>();
boolean isDetected=false;
int l=0;
int r=st.length-1;
While(l<=r){
String temp=st[r];
if(temp.equalsIgnoreCase("&")){
isDetected=true;
r--;
continue;
}
if(isDetected){
temp=st[l];
list.add(temp);
l++;
}else{
list.add(temp);
r--;
}
}
System.out.println(list);