📃: Best Time to Buy and Sell Stock using Greedy Approach => LeetCode Problems

[Saiharitha3]

🟢 Title : Best Time to Buy and Sell Stock - Optimize for Large Inputs
🟢 Programming language : Python
🟢 Objective :
Implement an efficient algorithm to maximize profit from buying and selling a stock on different days
🟢 Summary :
The naive solution with O(n²) time complexity results in Time Limit Exceeded (TLE) errors on larger datasets. The goal is to replace the nested loops with an O(n) greedy algorithm

---

✅ Details to Include When Taking the Issue:
Name : Sai Haritha Sardena

---

Happy Contributing! 🚀

Wishing you all the best on your open source journey😍.
Enjoy! 😎

[github-actions]

👋 Thanks for opening this issue! First please star the repository and follow me in github. We appreciate your feedback and will look into it as soon as possible.

[Saiharitha3]

Hi @abhisek247767

I like to provide solution for this problem please assign to me and please add hacktoberfest label to this one,
Thank You.

[abhisek247767]

Assigned

[Saiharitha3]

please review PR #115

[Saiharitha3]

please review #116

[github-actions]

Hello @Saiharitha3! Your issue #109 has been successfully closed. ✅ Thank you for your contribution and helping us improve the project! If you have any more ideas or run into other issues, feel free to open a new one. Happy coding! 🚀