Description

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most prominent and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following property: At every step, we can make a choice that looks best at the moment, and we get the optimal solution to the complete problem.

Problem Statement

You are given an array of prices where prices$[$i$]$ are the price of a given stock on the ith day, and an integer fee represents a transaction fee. Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction $($for selling only$).$

Note: You may not engage in multiple transactions simultaneously $($i$.$e$.,$ you must sell the stock before you buy again$).$

Test Cases:

prices $=[1,3,2,8,4,9],$ fee $=2$

$->$ Should get $8$ as the maximum profit

prices $=[1,3,7,5,10,3],$ fee $=3$

$->$ Should get $6$ as the maximum profit