Previous Next
0 / 21
Module DEMO-32-106DEMO-C-32

Subarray with Given Sum

DEMO-C-32 • Programming in C

Browser-only practice

Problem Statement

Given an unsorted array of non-negative integers, find a continuous subarray which adds to a given number S. If found, print the 1-based start and end indices. If multiple exist, print the first one found. If none, print -1.

Example

Input:

5 12 1 2 3 7 5

Output:

2 4

(2+3+7 = 12. Indices 2 to 4)

Constraints

n <= 100

Input Format

n, S, array

Output Format

Indices or -1

Sample Testcases

Submit runs every public testcase in this browser. Results and code never leave this device.

Sample #1
Public sample
Input
5 12
1 2 3 7 5
Output
2 4
Explanation
2+3+7 = 12.
Sample #2
Public sample
Input
4 0
0 0 0 0
Output
1 1
Explanation
First zero matches sum 0.
Sample #3
Public sample
Input
6 9
1 2 3 4 5 6
Output
2 4
Explanation
Subarray [2,3,4] sums to 9.
Sample #4
Public sample
Input
1 7
7
Output
1 1
Explanation
Single element matches the target sum.
Sample #5
Public sample
Input
5 100
10 20 30 40 50
Output
1 4
Explanation
No subarray sums to 100.

Web terminal

C, C++, Java, and Python run locally in a browser VM. No worker or visualizer is used.

Saved in this browser
Editor settings