There were 3 questions in the coding challenge to be completed in 90 minutes.

1. https://leetcode.com/problems/partition-to-k-equal-sum-subsets/

2. A string was given and that is consisting of only opening braces and closing braces. We have to find out the minimum number of replacement of characters so that it will become valid parenthesis.

3. There was a matrix and now it is converted into its n rows and n columns. We have given these 2n lists and are shuffled. We have to reconstruct the matrix from these 2n lists so that the sum of elements of the above rows will always be greater than the sum of elements of lower rows.

I was able to solve 2 of them.