Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5646 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4716 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@skj7 | 671 |

@gurshehzadsingh | 418 |

@swastik8750 | 411 |

@nishunishuraj18 | 405 |

@vedantvalsangkar | 390 |

@deepakchowdary | 380 |

@akashverma4 | 369 |

@satyamannsm | 353 |

@2018uec1603 | 333 |

@rkrupeshkumar345 | 331 |

@surajmamgai | 330 |

Complete Leaderboard |

Given an array **A[]** with **N** elements , you need to find the sum all sub arrays of array** A**. Since the sum could be very large print the sum modulo **(10 ^{9}+7)**.

**Example 1:**

**Input:**
N = 3
A[] = {1, 2, 3}
**Output: **20
**Explanation:**
All subarrays are [1], [2], [3],
[1,2], [2,3], [1,2,3].
Thus total sum is 20.

**Example 2:**

**Input:**
N = 2
A[] = {1, 3}
**Output: **8

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **subarraySum()** which takes the array **A[]** and its size **N**** **as inputs and returns the sum.

**Expected Time Complexity: **O(N)

**Expected Auxiliary Space: **O(1)

**Constraints :**

1 ≤ N ≤ 10^{5}

1 ≤ A[] ≤ 10^{9}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Sum of Subarrays

...