Round - 1 Questions :
1. https://leetcode.com/problems/intersection-of-two-arrays/
2. https://leetcode.com/problems/intersection-of-two-linked-lists/
3. Given an Array, You have to partition the array so that sum of all the elements of every partition is the same. Return - Maximum of partitions that can be done and the sum of the elements of each partition.
Example 1 :
Input: n = 3 , nums = [2,6,8,0]
Output: partitions = 2, sum = 8
Example 2 :
Input: n = 10 , nums = [1,1,1,1,1,1,1,1,1,1] Output: partitions = 10, sum = 1
