Maximum Stock Price Buy Once, is a Array related problem and in this post we will see how we can solve this challenge in C++

Given an array of prices of shares.Give the maximum profit obtained by buying and selling a share for a day only once

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas