tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.0 KiB
1.0 KiB
TODO 0084. Largest Rectangle In Histogram hard
Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram.
Example 1:
Input: heights = [2,1,5,6,2,3]
Output: 10
Explanation: The above is a histogram where width of each bar is 1.
The largest rectangle is shown in the red area, which has an area = 10 units.Example 2:
Input: heights = [2,4]
Output: 4Constraints:
1 <= heights.length <= 10^{5}0 <= heights[i] <= 10^{4}
TODO Approach
Write your approach here.
TODO Python
class Solution:
def largestRectangleArea(self, heights: List[int]) -> int:TODO C++
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
}
};