LargestRectangleInHistogram (Linear DS)

Topic: 08. Linked Lists & Stacks

1. Strategy

• Pattern: (Fast/Slow Pointers? Monotonic Stack?)
• Edge Cases: Head is null?

2. Complexity

• Time: O(N)
• Space: O(1) or O(N)

3. Code

package com.dsa.linked_lists_and_stacks;

import com.dsa.utils.ListNode;
import java.util.*;

public class LargestRectangleInHistogram {
    public void solve() {
        // TODO: Implementation
    }
}