1)

vector<int> updateArrayPerRange(vector<int> &nums, vector<vector<int>> &operations)

// STUDENT ANSWER

for (size_t i = 0; i < operations.size(); i++)

for(int j = operations[i][0] ; j <= operations[i][1] ;j ++)

nums[j] += operations[i][2];

return nums;

2)

bool consecutiveOnes(vector<int>& nums) {

// STUDENT ANSWER

bool meetOne = false;

bool space = false;

for (int i = 0; i < nums.size(); ++ i) {

if (nums[i] == 1) {

if (space) return false;

meetOne = true;

} else {

if (meetOne) {

space = true;

}
 }

return true;

3)

int buyCar(int* nums, int length, int k) {

int count = 0, sum = 0;

// sort the cost array

sort(nums, nums + length);

for (int i = 0; i < length; i++) {

// Check if we can buy ith toy or not

if (sum +*(nums+i) <= k)

sum = sum + *(nums+i);

// Increment count

count++;

return count;

4)

int longestSublist(vector<string>& words) {

// STUDENT ANSWER

int l = words.size();

if (l == 0) return 0;

int i =1;
 int ans =1;

int p = 0;

while (i < l){

if (words[i][0] != words[p][0]) p = i;

else

ans = max(ans, i - p + 1);

i += 1;

return ans;

5)

int equalSumIndex(vector<int>& nums) {

// STUDENT ANSWER

for(size_t i = 0 ; i < nums.size() ; i++)

int sumL = 0;

for(int j = i -1; j >= 0; j--)

sumL += nums[j] ;

int sumR=0;

for(size_t j=i+1 ; j < nums.size() ; j ++)

sumR+= nums[j];

}
 if ( sumL == sumR) return i ;

return -1;