Java Add Sliding Window Algorithm Implementations

What would you like to Propose?

I would like to propose adding a dedicated file, SlidingWindow.java, to this repository. This file will contain sliding window algorithms commonly used in competitive programming and interviews. These algorithms include solutions that demonstrate both fixed-length and variable-length sliding window techniques.

Issue details

Currently, the repository lacks sliding window algorithms, a core technique in solving many subarray or substring-related problems efficiently. This proposal aims to address that gap by adding a dedicated file for sliding window algorithms, complete with explanations and test cases.

Additional Information

The following well-known problems will be implemented:

Maximum Sum Subarray of Size KK: This problem is commonly found in coding interviews and challenges.
Longest Substring Without Repeating Characters: A classic problem on platforms like LeetCode, demonstrating the utility of sliding window techniques.
Smallest Subarray with Sum Greater Than SS: This problem is frequently encountered in competitive programming scenarios.

Can also add similar problems.

Oct 25 '24 13:10 Chiefpatwal

@Chiefpatwal can i work on this issue ?

Oct 27 '24 08:10 charu1110

@charu1110 sure you can, i have already created sliding window directory and have added two general problems for the same you can add others.

Oct 27 '24 09:10 Chiefpatwal

Can I add more problems in sliding window section?

Oct 28 '24 04:10 m-saurabh01

@m-saurabh01 sure

Oct 28 '24 04:10 Chiefpatwal

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!

Nov 28 '24 00:11 github-actions[bot]

Added common patterns of sliding window.

Nov 30 '24 04:11 Chiefpatwal