Round 2:
1. Duplicate elements deletion without creating new array
2. Optimized Searching algorithm.
1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i
in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the array any number of times.
2.Activity lifestyle

Question

Round 2:
1. Duplicate elements deletion without creating new array
2. Optimized Searching algorithm.
1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i
 in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the array any number of times.
2.Activity lifestyle

ninjacart

ninjacart interview question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches