Software Engineer

Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1, 2, 3, 4, 5] and if he rotates it by 2, then the array becomes: [4, 5, 1, 2, 3].

After rotating a sorted array, Aahad needs to answer Q queries asked by Harshit, each of them is described by one integer Q[i]. which Harshit wanted him to search in the array. For each query, if he found it, he had to shout the index of the number, otherwise, he had to shout -1.

For each query, you have to complete the given method where 'key' denotes Q[i]. If the key exists in the array, return the index of the 'key', otherwise, return -1.

Note:

Can you solve each query in O(logN) ?

Implement polyfill of compose (Learn)

Implement currying for a given function that takes a random number of arguments.
```
// Problem statement
const multiply=(x,y,z) => x*y*z;

const res0 = curried(1)(2)(3); // should print 6
const res1 = curried(1, 2)(3); // should print 6
const res2 = curried(1, 2, 3); // should print 6
const res3 = curried(1)(2, 3); // should print 6

// Solution 
const curry = fn =>{
   return curried = (...args) => {
       if (fn.length !== args.length){
           return curried.bind(null, ...args)
       }
   return fn(...args);
   };
}
const curried = curry(totalNum);
```
 

Implement useMemo hook polyfill (Learn)

Data Fetching in React. (Learn)

This was a follow-up to the previous question where you are supposed to keep on fetching until it returns a successful response.

Followup 2: Stop trying after a certain count (provided to you e.g. 5 attempts). You can think of it as a restricted polling type of thing.

Salary Negotiation.