Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
finding the slice with the minimum sum from an array algorithm
lets say that i have an array of integers, both negative and positive mixed up. now i need to get the low and high bounds of a slice in that array that has the minimum sum of elements
i can only think of a O^2 complicity algorithm, but as the max elements can be 1,000,000 i cant use my algorithm
0 · ·