Create maximum_subarray.py

[MeloveGupta]

This PR adds an implementation of the Maximum Subarray Problem (also known as Kadane’s Algorithm) in Python.
The algorithm efficiently finds the contiguous subarray within a one-dimensional array of numbers which has the largest sum.

Key Details:

Algorithm Used: Kadane’s Algorithm

Time Complexity: O(n)

Space Complexity: O(1)

Approach:

Iterates through the array once.

At each step, decides whether to extend the current subarray or start a new one.

Keeps track of the maximum sum encountered so far.

Files Added:

max_subarray.py → Core algorithm implementation with documentation and example usage.

[github-actions]

🎉 Welcome to Hacktoberfest 2025, @MeloveGupta! 🎃

Thank you for your first contribution to our DSA repository! Here's what happens next:

🔍 Automatic Checks

• ✅ Code Validation: Passed
• 🧪 Compilation Tests: Passed

📋 Next Steps

🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon.

🎁 What You Get

• 🏆 Hacktoberfest Credit: This PR counts toward your 6 PR goal for exclusive T-shirt + Tree!
• 🌟 Hall of Fame: You'll be featured in our contributors list
• 📚 Learning: Code review feedback from experienced developers

💡 Tips for Success

• Follow our Contributing Guidelines
• Add comments explaining your algorithm
• Include time/space complexity analysis
• Test your code before submitting

Welcome to the community! 🚀

[github-actions]

🤖 Automated PR Status

🔍 Code Validation

✅ Passed - File naming and structure look good!

🧪 Compilation Tests

✅ Passed - All code compiles successfully!

📋 Overall Status

🎉 Ready for Review - Your PR has passed all automated checks!
👥 Maintainers have been notified for review.

---

This comment was generated automatically. Checks will re-run when you push new commits.