The coding questions were not very hard! There were four questions with increasing difficulty at least for me! But was able to solve them! A question that I remember was: A lot of non-essential info, essentially it boiled down to: I had to mimic the distribution center according to the conditions provided! Given an array CenterCapacity that contains a center's capacity between 1 to 5 and a String Array dailyLogs! It contains info in the form of strings, like "Packages" and "Closed ". If it is a package, then I will keep using a center until it hits its capacity given by centerCapacity[j]! and then sequentially move on to the other. If we complete a cycle, then the capacity gets restored! However, if we encounter a "closed " entry, it means that this jth center is now closed until otherwise said so, and we cannot use it to store the packages! Then we continue until all the packages we reach the end of the daily logs! And finally, I had to return the index of the Center that stores the most packages.( in case of same count return the bigger index )