<ul><li>The problem is about finding the discount on each candy by comparing it with the next candy with an equal or lower price.</li><li>A brute force solution is explained where each index is looped through to find a candy with a lower or equal price.</li><li>An alternative approach using a monotonic stack is recommended to find the next greater element for each candy.</li><li>The implementation of the monotonic stack approach is provided, which achieves a faster runtime.</li></ul>

Leet Code 101: How to Solve the “Final Price With a Special Discount” Problem

Discover more