Practice Final Prices With a Special Discount in a Shop
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an integer array prices where prices[i] is the price of the ith item in a shop. There is a special discount for items in the shop. If you buy the ith item, then you will receive a discount equivalent to prices[j] where j is the minimum index such that j > i and prices[j] <= prices[i]. Otherwise, you will not receive any discount at all. Return an integer array answer where answer[i] is the final price you will pay for the ith item of the shop, considering the special discount.
Source: Final Prices With a Special Discount in a Shop on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
prices = [8,4,6,2,3]
[4,2,4,2,3]
# Example 2
prices = [1,2,3,4,5]
[1,2,3,4,5]
# Example 3
prices = [10,1,1,6]
[9,0,1,6]
Constraints
Related LeetCode Problems
Practice more problems similar to Final Prices With a Special Discount in a Shop.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.