492. Construct the Rectangle LeetCode Solution

In this guide, you will get 492. Construct the Rectangle LeetCode Solution with the best time and space complexity. The solution to Construct the Rectangle problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Problem Statement
Complexity Analysis
Construct the Rectangle solution in C++
Construct the Rectangle solution in Java
Construct the Rectangle solution in Python
Additional Resources

492. Construct the RectangleLeetCode Solution image

Problem Statement of Construct the Rectangle

A web developer needs to know how to design a web page’s size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L and width W satisfy the following requirements:

The area of the rectangular web page you designed must equal to the given target area.
The width W should not be larger than the length L, which means L >= W.
The difference between length L and width W should be as small as possible.

Return an array [L, W] where L and W are the length and width of the web page you designed in sequence.

Example 1:

Input: area = 4
Output: [2,2]
Explanation: The target area is 4, and all the possible ways to construct it are [1,4], [2,2], [4,1].
But according to requirement 2, [1,4] is illegal; according to requirement 3, [4,1] is not optimal compared to [2,2]. So the length L is 2, and the width W is 2.

Example 2:

Input: area = 37
Output: [37,1]

Example 3:

Input: area = 122122
Output: [427,286]

Constraints:

1 <= area <= 107

Complexity Analysis

Time Complexity: O(n)
Space Complexity: O(1)

492. Construct the Rectangle LeetCode Solution in C++

class Solution {
 public:
  vector<int> constructRectangle(int area) {
    int width = sqrt(area);

    while (area % width)
      --width;

    return {area / width, width};
  }
};
/* code provided by PROGIEZ */

492. Construct the Rectangle LeetCode Solution in Java

class Solution {
  public int[] constructRectangle(int area) {
    int width = (int) Math.sqrt(area);

    while (area % width > 0)
      --width;

    return new int[] {area / width, width};
  }
}
// code provided by PROGIEZ