The test had 2 coding question, and many MCQs on aptitute and cs fundametals(networking,Rest api stuff).

1. Give a binary matrix, each row represents a day and each cell is an hour.
   '1' : you have a class in that hour
   '0' : no class in that hour
   The total time spent attending the classes for a day is lenght of smallest subarray that contains all the '1's
   You can skip any $k$ classes.
   Find the minimum time to attend all classes if you can skip $k$ of them.
   constrain: $0<=rows,cols,k<=200$

2. Given a binary string, in one second you can do the follow:
   change every occurence of $"01"$ to $"10"$
   repeate the followin untill you cannot.
   Find out how many seconds it takes.
   lenght of string is uptill 10^5