Package g1201_1300.s1240_tiling_a_rectangle_with_the_fewest_squares

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1240 - Tiling a Rectangle with the Fewest Squares.

    Hard

    Given a rectangle of size n x m, return the minimum number of integer-sided squares that tile the rectangle.

    Example 1:

    Input: n = 2, m = 3

    Output: 3

    Explanation: 3 squares are necessary to cover the rectangle.

    2 (squares of 1x1)

    1 (square of 2x2)

    Example 2:

    Input: n = 5, m = 8

    Output: 5

    Example 3:

    Input: n = 11, m = 13

    Output: 6

    Constraints:

    • 1 <= n, m <= 13

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer tilingRectangle(Integer n, Integer m)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait