sudosurya / cs-fundamentals

This repository contains the implementation of various data structures and algorithms in Java, Go, JavaScript, Python, C. The purpose of this repository is to help myself to learn and understand the fundamentals of computer science.

cs-fundamentals's Issues

### Two Pointers Technique Implementation

          ###  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/

Originally posted by @20pa5a1210 in #3 (comment)

Do max possible Problems on Sliding window using java

Do array problems using sliding window technique in Java
/** References ** /
-> Eric Programming
-> Tech Interview HandBook
-> Refer Leetcode for problems

Todo Problems

• Minimum Size Subarray Sum https://leetcode.com/problems/minimum-size-subarray-sum/
• Longest Substring Without Repeating Charactershttps://leetcode.com/problems/longest-substring-without-repeating-characters/
• Two Sum
• Best Time to Buy and Sell Stock
• Product of Array Except Self
• Maximum Subarray
• Contains Duplicate
• Maximum Product Subarray
• Search in Rotated Sorted Array
• 3Sum
• Container With Most Water
• Sliding Window Maximum

GoLang Lessions

Start Doing Some Go While Learning C and DSA