Google | Intern OAs | 10th October

Question 1 <problem>112</problem> Given an array A of integers and an integer m. We can perform following operation of the array :- Choose an index i and change Ai to max(0,A[i]-k) Find the minimum value of k such that each element is changed to 0 and number of operations are atmost m. Constraints : 1<=N<=10^5 0<=A[i]<=10^13 m<=10^9 Question 2 <problem>71</problem> Given a list of strings S. Each string in S consist of characters from A-J. Find the minimum sum of ...