LogFAQs > #960861796

Day 10

Weekends are required, but less pressure to do 2 plus system design. I did https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/ was was just sort and get the difference.

Question two is https://leetcode.com/problems/largest-submatrix-with-rearrangements/. Currently struggling with this. Looked at the hint and it says to sort, which is what I suspected, but I think the running time would still be long. I assume it's referring to sort each row in decreasing order, so that you have all the 1s close together. But then you'll have to puck and choose which of the 1s need to be arranged to get the largest submatrix. I'm thinking you would have to sort them again based on the 1s above and below the row. Taking a break from this for now, and will tackle it tomorrow.