CareerCup

int calc(int left, int right){
		int n = right-left;
		return n*(n+1)/2;
	}
	int findSubArrays(int[] arr, int k){
		int ans=0;
		int ptr=0;
		while(ptr<arr.length){
			if(arr[ptr] < k){
				int ptrForward = ptr;
				while(arr[ptrForward] < k)
					ptrForward++;
				sum+=calc(ptr, ptrForward);
			}else{
				ptr++;
			}
		}	
	}

you dont need to throw error when k is greater than array size, since its the number of rotations you want to perform

l1=[1,3,4,12,24,45]
l2=[1,2,3,4,5,6,7,None,None,None,None,None,None]
def merge_into_l2(l1,l2):
    i=len(l1)-1
    j=len(l2)-len(l1)-1
    k=len(l2)-1
    while(i>=0 and j>=0 and k>=0):
        if(l1[i]>=l2[j]):
            l2[k]=l1[i]
            i-=1
            k-=1
        else:
            l2[k]=l2[j]
            j-=1
            k-=1
    return l2
print(merge_into_l2(l1,l2))
Thank You
-Nikhilkumar Kekan

def fun(temp,k,i,l):
	#swap l[i] and temp
	swap_val=l[i]
	l[i]=temp
	temp=l[i]
	if(temp==None):
		return l
	else:
		return fun(temp,k,(i+k)%len(l),l)

l=[8,3,2,[5,6,[9]],6]
count=1
ans=0
def fun(l,count,ans):
    for e in l:
        if(type(e) is list):
            ans=fun(e,count*(count+1),ans)
        else:
            ans+=count*e
    return ans
ans=fun(l,count,ans)
print(ans)

I think the input is not given as a string its rather list of lists