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

Given the share prices for i days.Maximise the profit if the shares can be sold twice

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas