feat: add maximum circular subarray sum

[sumanbmondal]

Description of Change

Added the Maximum Circular Subarray Sum under Dynamic Programming

Checklist

• [x] Added description of change
• [x] Added file name matches File name guidelines
• [x] Added tests and example, test must pass
• [x] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• [x] Relevant documentation/comments is changed or added
• [x] PR title follows semantic commit guidelines
• [x] Search previous suggestions before making a new one, as yours may be a duplicate.
• [x] I acknowledge that all my contributions will be made under the project's license.

Notes: Added the Maximum Circular Subarray Sum problem which uses Kadane's algorithm.

[sumanbmondal]

Can someone please review the PR?

[sumanbmondal]

@Panquesito7 I've made the changes you required. Can you please review it now?

[sumanbmondal]

Awesome work. Thank you! 🚀

Thank YOU for helping me out so much. I would be so happy if this algorithm came in my question paper 😋.

[sumanbmondal]

@tjgurwara99 can you approve the running workflows and merge this as well? Thanks a lot.

[Panquesito7]

Will be merging for now. If there are any objections/changes needed, feel free to create another PR. 🙂