Solve the 'surrounded regions' in leetcode using BFS with O(n^2) time and O(1) space. One of the test case can pass randomly depending on the mood of leetcode's online judge server, and sometimes it gets time limit exceeded. It seems the allowed time for this test case is pretty close to what I can achieve.