https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/\n\nGiven a rectangle with `height` and `width`, find the minimum number of integer-sided squares that tile the rectangle.\n\n**Example 1:**\n```\nInput: height = 11, width = 13\nOutput: 6\nExplanation:\n```\n![](https://i.imgur.com/jBsvOca.png)\n\n**Example 2:**\n```\nInput: height = 4, width = 5\nOutput: 5\nExplanation:\n```\n![](https://i.imgur.com/K8oy3BJ.png)\n\n**Example 3:**\n```\nInput: height = 36, width = 30\nOutput: 5\nExplanation:\n```\n![](https://i.imgur.com/qRES4Iq.png)\n\n[More examples](http://int-e.eu/~bf3/squares/view.html)

https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/\n\nGiven a rectangle with height and width, find the minimum number of integer-sided s