LeetCode 3000: Maximum Area of Longest Diagonal Rectangle Solution

Master LeetCode problem 3000 (Maximum Area of Longest Diagonal Rectangle), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3000. Maximum Area of Longest Diagonal Rectangle

Easy

Array

Problem Explanation

Explanation

To solve this problem, we need to iterate through each rectangle, calculate the diagonal length for each rectangle, and keep track of the rectangle with the longest diagonal. If there are multiple rectangles with the longest diagonal, we then select the one with the maximum area.

Iterate through each rectangle.
Calculate the diagonal length using the formula sqrt(length^2 + width^2).
Keep track of the rectangle with the longest diagonal and the maximum area.
Return the area of the rectangle with the longest diagonal or maximum area.

Time Complexity: O(n) where n is the number of rectangles. Space Complexity: O(1)

Solution Code

class Solution {
    public int maxArea(List<List<Integer>> dimensions) {
        int maxArea = 0;
        double maxDiagonal = 0;
        
        for (List<Integer> dim : dimensions) {
            int length = dim.get(0);
            int width = dim.get(1);
            
            double diagonal = Math.sqrt(length * length + width * width);
            int area = length * width;
            
            if (diagonal > maxDiagonal || (diagonal == maxDiagonal && area > maxArea)) {
                maxDiagonal = diagonal;
                maxArea = area;
            }
        }
        
        return maxArea;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3000 (Maximum Area of Longest Diagonal Rectangle)?

This page provides optimized solutions for LeetCode problem 3000 (Maximum Area of Longest Diagonal Rectangle) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3000 (Maximum Area of Longest Diagonal Rectangle)?

The time complexity for LeetCode 3000 (Maximum Area of Longest Diagonal Rectangle) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3000 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3000 in Java, C++, or Python.

Back to LeetCode Solutions