🚀

End of Year Sale: Use Coupon Code END2025 to Get Extra 25% Off.

10DAYS
:
01HOURS
:
55MINUTES
:
52SECONDS

Leetcode Problem 2483. Minimum Penalty for a Shop

2483. Minimum Penalty for a Shop

Leetcode Solutions

One Pass Approach to Find the Earliest Hour with Minimum Penalty

  1. Initialize cur_penalty, min_penalty, and earliest_hour to 0.
  2. Iterate over each character in the customers string: a. If the character is 'Y', decrement cur_penalty by 1. b. If the character is 'N', increment cur_penalty by 1. c. If cur_penalty is less than min_penalty, update min_penalty to cur_penalty and set earliest_hour to the current index plus 1.
  3. Return earliest_hour after completing the iteration over the string.
UML Thumbnail

Two Passes Approach to Find the Earliest Hour with Minimum Penalty

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...