[Documentation Update]: Add LeetCode Solution for Problem (122) - Best Time to Buy and Sell Stock II

[NAVJOT-786]

Is there an existing issue for this?

• [X] I have searched the existing issues

Issue Description

The LeetCode problem "Best Time to Buy and Sell Stock II" (Problem 122) involves finding the maximum profit that can be achieved from multiple stock transactions. This problem is crucial for understanding dynamic programming and greedy algorithms.

Suggested Change

I suggest adding a detailed solution for this problem in multiple programming languages: C++, Python, Java, and JavaScript. The solution should include the algorithm, code, and comments to explain each step. This will help users understand different approaches to solve the problem and improve their coding skills.

Rationale

No response

Urgency

High

Acknowledgements

• [X] I have read the Contributing Guidelines
• [X] I'm a GSSOC'24 contributor
• [X] I have starred the repository
• [X] I have read and followed the Contribution Guidelines
• [X] I have followed the code style guidelines of this project
• [X] I have checked for any existing open issues that my pull request may address
• [X] I have ensured that my changes do not break any existing functionality
• [X] Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently
• [X] I have read the resources for guidance listed below
• [X] I have not used AI-generated content (e.g., ChatGPT, other AI tools)
• [X] I have not used content from existing sites (e.g., text, images)
• [X] I have followed all security rules and only shared trusted resources

[github-actions[bot]]

Hi @NAVJOT-786! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[github-actions[bot]]

Hello @NAVJOT-786! Your issue #3817 has been closed. Thank you for your contribution!