Hey\n\nGot a question similar to https://leetcode.com/problems/bricks-falling-when-hit/ for my coding interview round. I was able to think through that it is a connected component question and said it that it could be done through Union Find . I did not build my solution on top of it but went for DFS and built an adjacency matrix to get the connected component (was not necessary though) but nervousness got me. \n\nWhat do you think are the chances?

Hey\n\nGot a question similar to https://leetcode.com/problems/bricks-falling-when-hit/ for my coding interview round. I was able to think through that it is a 