Write a program to remove the duplicate elements in an array and print Eg) Array Elements - 12, 34, 12, 45, 67, 89 O/P: 12,34,45,67,89
consider an example : if an array is: 2 -1 2 4 6 -5 then maximum sum of contiguous array is 13, from index 0 to index 4 constraints: complexity must not be greater than O(n).
Given an unordered array A of size n and integer x. What is the best complexity to find two elements in A whose sum is x? Share the algo, its complexity and if possible C code.
