1. Arrays and Slices

Arrays and Slices

1. Pair Sum Problem.
   Question
   Solution
   Command:-

   $ go run 1.pair-sum-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   Using Sets	O(N)	O(N)	Link

2. Triplets Sum Problem.
   Question
   Solution
   Command:-

   $ go run 2.triplets-sum-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   Using Sorting and 3 pointers	O(Nlog(N))	O(1)	Link

3. Highest Mountain Peak Problem.
   Question
   Solution
   Command:-

   $ go run 3.highest-length-mountain-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   2 pointers	O(N)	O(1)	Link

4. Longest Band of Consecutive Number Problem.
   Question
   Solution
   Command:-

   $ go run 4.longest-band-length-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   set and 2 pointers	O(N)	O(N)	Link

5. Max Rain Water Trap Problem.
   Question
   Solution
   Command:-

   $ go run 5.maximum-rain-water-trap-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   Left and Right to store max height wall	O(N)	O(N)	Link

6. Sub Array Sorted Problem.
   Question
   Solution
   Command:-

   $ go run 6.smallest-sub-array-sort-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   ----	O(N)	O(1)	Link

7. Minimum Swap to Sort Array Problem.
   Question
   Solution
   Command:-

   $ go run 7.minimum-swap-to-sort-array-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   sorting	O(NLogN)	O(1)	Link

8. Maximum SubArray Sum Problem.
   Question
   Solution
   Command:-

   $ go run 8.maximum-sub-array-sum-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   Kadane Algorithm	O(N)	O(1)	Link

9. Minimum Difference between two Arrays element Problem.
   Question
   Solution
   Command:-

   $ go run 9.minimum-difference-pair-of-arrays-element-solution.go

   Method	TimeComplexity	SpaceComplexity	Source
   sorting	O(NLogN)	O(1)	Link

10. Product Array Elements Without Division Problem.
    Question
    Solution
    Command:-

    $ go run 10.array-products-without-division-solution.go

    Method	TimeComplexity	SpaceComplexity	Source
    Left and Right Product	O(N)	O(N)	Link

11. Count Activities Problem.
    Question
    Solution
    Command:-

    $ go run 11.count-maximum-number-of-activites-solution.go

    Method	TimeComplexity	SpaceComplexity	Source
    Sorting	O(N)	O(N)	Link