Adobe visited our campus for an on-campus internship. First-round they conducted an online test of which there are 16 MCQ’s and 2 coding. Both coding questions are easy to level.
1. Given an array A, you have to return an index such that the left sum of an index must be equal to the right sum of the index. For example, if array is [3,1,2,1] then output will be index 1 as 3==(2+1). So, here you have to return 1;
1<n<=105
1<a[i]<=1000
Same question:https://www.geeksforgeeks.org/find-element-array-sum-left-array-equal-sum-right-array/
2. Similar question: https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/