Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
O(n^2) solution in Clear category for Largest Rectangle in a Histogram by marcelllkoszticza
def largest_histogram(histogram):
max_val = 0
for i in range(len(histogram)):
for j in range(i, len(histogram)):
max_val = max(max_val, min(histogram[i:j + 1]) * (j - i + 1))
return max_val
if __name__ == "__main__":
# These "asserts" using only for self-checking and not necessary for auto-testing
assert largest_histogram([5]) == 5, "one is always the biggest"
assert largest_histogram([5, 3]) == 6, "two are smallest X 2"
assert largest_histogram([1, 1, 4, 1]) == 4, "vertical"
assert largest_histogram([1, 1, 3, 1]) == 4, "horizontal"
assert largest_histogram([2, 1, 4, 5, 1, 3, 3]) == 8, "complex"
print("Done! Go check it!")
July 31, 2019
