Round 1: DSA 1. We have a function minOp, which gives us the minimum missing non-negative number in an array. ex: for [1,2,3] minOp will give 0 [0,2,4] -> minOP(array) = 1 You are given an array of numbers, you want to divide the array into k sub-arrays such that the value returned by the minOp is maximized. Basically we want to maximize the min value we get from all differentt k subarrays. 2. You have a keyboard with only 1s and 0s. it takes one second to press a key. It takes 1 second to move your hand from one key to another. We have to reverse any substring in the given string sequence of 1s and 0s, such that the total time it would take to type-out all the 1s and 0s is reduced. Round2 : System Design: I was asked to design a data/file storage system. (LLD) I wrote down how we will be storing the different directories and files. Verdict: Mixed Feedback (For DSA round the feedback was not strong enough )