Problem Description You need to write the following function: int ProductOfSums(int arr[], int n); The function takes an integer array arr of size n as input, where: 1. The first portion of the array (starting from index 0 up to some index i) is sorted in ascending order. 2.

Problem Description Write a function: int MinSizeArray(int* arr, int n, int k); Parameters: * The function takes in an array arr of n positive integers and a positive integer k as inputs. Task: Remove elements from the array based on the following rules: 1. In one turn, exactly three consecutive

Problem Description You are provided with a string str of length n. Your task is to find and print the largest integer found within the string. An integer is formed by consecutive digit characters in the string. Note: * If no integer is present in the string, print -1. * If the

Problem Description You are provided with two arrays, arr1 and arr2, with sizes N and M respectively. Your task is to perform the following operations: 1. Intersection: Find all elements that appear in both arrays. 2. Union: Find all unique elements from both arrays, combining them while removing any duplicates.

Problem Description Ram and Shyam are two hackers engaged in a game. They are given a list of non-empty strings, where each string represents a round of the game. For each round, return the name of the winner as an array of strings. Game Rules: * Ram always takes the first

Problem Description You are given a string s that consists only of the characters 'X' and 'Y'. In one move, you can delete either the substring 'XY' or 'YY' and concatenate the remaining parts of the string. Objective: Return the minimum possible