SDE - 1

Given an array/list 'ARR' of integers and an integer ‘K’. You are supposed to return the length of the shortest subarray that has a sum greater than or equal to ‘K’. If there is no subarray with a sum greater than or equal to K, then return -1.

Note :

An array ‘B’ is a subarray of an array ‘A’ if ‘B’ that can be obtained by deletion of, several elements(possibly none) from the start of ‘A’ and several elements(possibly none) from the end of ‘A’. 

1. How to centre a div in HTML?
2. Define split function in JS

1. What is your biggest strength?
2. Examples of applications you have made?
3. Show / talk about your projects.

1. Tell me about yourself
2. Do you have any other job offers, if yes then why are you choosing Nagarro?
3. Where would you rank your coding skills in your class?
4. Tell me something about Nagarro, Why do you want to work here?