largestRectangleArea = function(heights, left = 0, right = (heights.length - 1)) {
    const isBaseCase = right < left;
    if (isBaseCase) return 0;

    return divideAndConquer(heights, left, right);                  /* Time O(N^2) | Space O(N) */
}
https://leetcode.com/problems/largest-rectangle-in-histogram/solution/
Time O(N^2) | Space O(N)
@param {number[]} heights
@return {number}