Merge pull request #2 from 20pa5a1210/Arrays

[SudoSurya]

Arrays Branch - Sliding Window Technique Implementation

This pull request from the "arrays" branch introduces the implementation of the sliding window technique in Java. It includes a new SlidingWindow class with methods for solving array problems efficiently. The maximumSumSubarray function finds the subarray with the maximum sum using the sliding window technique, while the minimumSizeSubarraySum function determines the minimum length of a subarray with a sum greater than or equal to a given target value. Unit tests ensure the correctness of the implementation. These changes enhance the array manipulation code, providing optimized solutions for array-related problems

[SudoSurya]

Two Pointers Technique Implementation

Two pointers is a more general version of sliding window where the pointers can cross each other and can be on different array
When you are given two arrays to process, it is common to have one index per array (pointer) to traverse/compare the both of them, incrementing one of the pointers when relevant. For example, we use this approach to merge two sorted arrays.

• Sort Colors https://leetcode.com/problems/sort-colors/
• Palindrome Sub-Strings https://leetcode.com/problems/palindromic-substrings/