For given list of numbers find out triplets with sum 0 using C? Input : arr[] = {0, -1, 2, -3, 1} Output : 0 -1 1 2 -3 1
using namespace std; // Prints all triplets in arr[] with 0 sum void findTriplets(int arr[], int n) { bool found = true; for (int i=0; i<n-2; i++) { for (int j=i+1; j<n-1; j++) { for (int k=j+1; k<n; k++) { if (arr[i]+arr[j]+arr[k] == 0) { cout << arr[i] << " " << arr[j] << " " << arr[k] <<endl; found = true; } } } } // If no triplet with 0 sum found in array if (found == false) cout << " not exist "<<endl; } // Driver code int main() { int arr[] = {0, -1, 2, -3, 1}; int n = sizeof(arr)/sizeof(arr[0]); findTriplets(arr, n); return 0; }
Array consist of -1 and 1, Find count of all sub-arrays where sum = 0. Input: [-1,1,-1,1]
Output: 4 [-1,1] [1,-1],[-1,1],[-1,1,-1,1]
Write your own rand function which returns random numbers in a given range(input) so that the numbers in the given range is equally likely to appear.
Given input as a string, return an integer as the sum of all numbers found in the string
Input: xyzonexyztwothreeeabrminusseven Output : 1 + 23 + (-7) = 17