Side Largest Square

Microsoft interviews problem: Given m 1x1 tiles and n 2x2 tiles, determine the side length of the largest fully filled square you can build without overlaps or gaps, or return 0 if impossible. Inputs may be as large as 1e9. This coding interview question checks your ability to reason about constraints and feasibility in an interview question setting.