Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6454 |

@blackshadows | 6380 |

@mb1973 | 5714 |

@Quandray | 5245 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5046 |

@sanjay05 | 3762 |

@kirtidee18 | 3709 |

@mantu_singh | 3556 |

@marius_valentin_dragoi | 3523 |

@sushant_a | 3459 |

Complete Leaderboard | |

Handle | Score |

@cfwong8 | 1285 |

@gurshehzadsingh | 1052 |

@pritsahkar2000 | 812 |

@satyamchhatrala | 804 |

@nithinreddy3210 | 801 |

@iib2019024 | 745 |

@mohanreddy8847 | 704 |

@iamchaitanyahegde | 662 |

@shafeeq3543 | 651 |

@workit | 646 |

@AkashLahoty | 642 |

Complete Leaderboard |

Given an array of integers of size N, for all, i's [1, N], the task is to find the minimum subarray sum in the subarray [i, N].

**Input: **

1. The first line of the input contains a single integer* * T denoting the number of test cases. The description of T test cases follows.

2. The first line of each test case contains a single integer N.

3. The second line contains N space-separated positive integers represents array.

**Output:** For each test case, print N space-separated integers

**Constraints:**

1. 1 <= T <= 10

2. 1 <= N <= 100000

3. -10000 <= arr[i] <= 10000

**Example:
Input:**

2

3

3 -1 -2

5

5 -3 -2 9 4

**Output:**

-3 -3 -2

-5 -5 -2 4 4

**Explanation:**

Test case 1:

1. i = 1, subarray is [3, -1, -2], all possible subarrays are [3], [-1], [-2], [3, -1], [-1, -2], [3, -1, -2]. Minnimum sum is -3 [-1, -2].

2. i = 2, subarray is [-1, -2], all possible subarrays are [-1], [-2], [-1, -2]. Minnimum sum is -3 [-1, -2].

3. i = 3, subarray is [-2], all possible subarrays are [-2]. Minnimum sum is -2[-2].

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?

YesLoading...

Minimum sum of subarray

...