18(June) Number of Rectangles in a Circle

18. Number of Rectangles in a Circle

The problem can be found at the following link: Question Link

Problem Description

Given a circular sheet of radius r, find the total number of rectangles with integral length and width that can be cut from the sheet and fit within the circle, one at a time.

Examples:

Input:

r = 1

Output:

1

Explanation: Only 1 rectangle of dimensions 1x1.

Input:

r = 2

Output:

8

Explanation: The 8 possible rectangles are: (1x1), (1x2), (1x3), (2x1), (2x2), (2x3), (3x1), (3x2).

My Approach

  1. Initialization:

    • Initialize a variable ans to store the count of rectangles that can fit within the circle.

    • Define a limit variable as 4 * R * R which represents the square of the diameter of the circle.

  2. Rectangle Calculation:

    • Use nested loops to iterate over possible rectangle dimensions (i, j) where i and j range from 1 to 2 * R.

    • For each pair (i, j), check if the sum of their squared dimensions is less than or equal to limit.

    • If the condition is satisfied, increment ans.

  3. Return:

    • Return the value of ans which contains the total count of rectangles that can fit within the circle.

Time and Auxiliary Space Complexity

  • Expected Time Complexity: O(R^2), as we iterate through all possible rectangle dimensions within the given range.

  • Expected Auxiliary Space Complexity: O(1), as we use a constant amount of additional space.

Code (C++)

Code (Java)

Code (Python)

Contribution and Support

For discussions, questions, or doubts related to this solution, feel free to connect on LinkedIn: Any Questions. Let’s make this learning journey more collaborative!

⭐ If you find this helpful, please give this repository a star! ⭐


📍Visitor Count

Last updated