-
-
Notifications
You must be signed in to change notification settings - Fork 46.6k
Want to add sliding window algorithm #11517
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
can i try? |
I am willing to try in hactober fest |
I want to solve it |
I have created a pull request please review |
Hi @Shraman-jain, I hope you're doing well! I'm excited to participate in Hacktoberfest and contribute to this repository. I would like to work on implementing the Sliding Window Algorithm, particularly for solving the problem of finding the maximum sum of a subarray of size k in an array. This algorithm is widely used to optimize problems involving arrays and strings by reducing time complexity from brute force solutions. I believe adding this algorithm can be beneficial for enhancing the repository's collection of array-based algorithms and can serve as a useful resource for others. I am also open to working on other variations or problems where this technique can be applied efficiently, based on your suggestions. If this aligns with the current direction of the project, I’d be happy to share more specifics or discuss how we can tailor this contribution to meet the repository's needs. Looking forward to your feedback! Best regards, |
ci ca work on this please assign me this sir |
Signed-off-by: Muhammad Arshad <[email protected]>
Feature description
Want to add sliding window algorithm in DSA sub folder in array's algorithm
The text was updated successfully, but these errors were encountered: