Simple Haskell solution. Uses the property that the maximum difference of two items in a list will be the difference between the maximum and minimum elements.
maxProfit :: (Ord a, Num a) => [a] -> a maxProfit [] = 0 maxProfit xs = maximum xs - minimum xs
If max comes before min, then this solution would show a wrong result.
Oh, I misunderstood the challenge. Didn't notice that order requirement.
Don‘t worry... just wanted to point out to you, that you are not done yet. 😬 Keep at it
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Simple Haskell solution. Uses the property that the maximum difference of two items in a list will be the difference between the maximum and minimum elements.
If max comes before min, then this solution would show a wrong result.
Oh, I misunderstood the challenge. Didn't notice that order requirement.
Don‘t worry... just wanted to point out to you, that you are not done yet. 😬
Keep at it