Leetcode 2128 remove all ones with row and column flips. Took me a while to get this and eventually just was able to guess it after a while of guessing optimal solutions. Would an interviewer really expect someone to figure out this though? Even as someone who frequently attends cp contests (2200 rating on leetcode and 1600 on cf) the optimal for this one seems a bit hard to figure out/prove. I only mention this because it’s high on the google list for frequently asked.
1600 on cf is relatively weak, not sure this is a good indicator that you are strong cp
Google interviews are pretty random and become less complex over time, I don’t expect anything tricky anymore
I don’t have the link but this sounds like simple dfs/bfs
No. You had to figure out that the matrix must be either of 2 below forms: All rows must be exactly same OR exact opposite of row 1. (Or any row of your choosing)
Yeah if they accept dfs solution that’s fine though, just wondering if they want the math solution as Microsoft pointed out