Find sub-array sum of integer array
Given an unsorted array of integers, find a subarray which adds to a given number. If there are more than one subarrays with sum as the given number, print any of them.
Examples:
Input: arr[] = {1, 4, 20, 3, 10, 5}, sum = 33
Ouptut: Sum found between indexes 2 and 4
Input: arr[] = {10, 2, -2, -20, 10}, sum = -10
Ouptut: Sum found between indexes 0 to 3
Input: arr[] = {-10, 0, 2, -2, -20, 10}, sum = 20
Ouptut: No subarray with given sum exists
Видео Find sub-array sum of integer array канала Kolli Shravani
Examples:
Input: arr[] = {1, 4, 20, 3, 10, 5}, sum = 33
Ouptut: Sum found between indexes 2 and 4
Input: arr[] = {10, 2, -2, -20, 10}, sum = -10
Ouptut: Sum found between indexes 0 to 3
Input: arr[] = {-10, 0, 2, -2, -20, 10}, sum = 20
Ouptut: No subarray with given sum exists
Видео Find sub-array sum of integer array канала Kolli Shravani
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Find Next Greater Element of all elements in arrayFind non negative sub array sumGrocery List ManagerSnapostSort 0s 1s 2s in ascending orderFind largest sum of contiguous sub arrayPrint 2d array in spiral formPrint array in decreasing frequency by maintaining order of occuranceFind missing integerFind Leader in arrayFind Equilibrium index of an arrayFind leaders in an arrayFind kth smallest element in arrayWeather appInstagram models routesGrocery List ManagerWebDevC2Team2 Assignment1WebDevC2Team2 - Unit Testing