CareerCup

Complexity O(2*n/2) = O(n)

public String[] reverseArrayWithModification(String[] arr) {
        String[] out = new String[arr.length - 1];
        int middle = arr.length / 2;

        if (arr[middle].equals("&")) {
            for (int i = 0; i < middle; i ++) {
                out[i] = arr[arr.length - 1 - i];
            }
            for (int i = middle + 1; i <= 2 * middle; i ++) {
                out[i - 1] = arr[i - middle - 1];
            }
        } else {
            throw new IllegalArgumentException("Input array has no char '&'");
        }
        return out;
    }

Thanks Denis. Do you have java solution as well ?

Elegant Python Solution :)

def reverseAfterMiddle(nums):
  mid = len(nums) // 2
  return nums[mid+1:][::-1] + nums[0:mid]

print(reverseAfterMiddle([1,2,3,4,'&',12,13,14,15])) # prints [15, 14, 13, 12, 1, 2, 3, 4]
print(reverseAfterMiddle([33,34,'&',55,63])) # prints [64, 55, 33, 34]

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);

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);

{{
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);

}}

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);