There were three questions : \n1. Easy/Medium\n2. Given N horizontal bars (numbered 1,2,...,N) and M vertical bars (1,2,...,M). There are list of X horizontal bars and Y vertical bars given which needs to be removed. After removal of given list of bars, we need to return the maximum gap which has been formed.\n3. Find maximum value of k such that each kXk submatrix has sum less than or equal to givenSum.\n\nAny idea how Roblox interviews are like for new-grad software engineer?

There were three questions : \n1. Easy/Medium\n2. Given N horizontal bars (numbered 1,2,...,N) and M vertical bars (1,2,...,M). There are list of X horizontal b