GATE CS 2019 Set 1 — Question 35

NAT+1 / -0MediumD&C ParadigmDivide & ConquerAlgorithms

Algorithms → Divide & Conquer → D&C Paradigm

Last updated 5 September 2026

Question

A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]

A[i..j]

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

A[i..j]

$k$	$A[k]$	$cur$	best
0	$-5$	$-5$	$-5$
1	$-10$	$-10$	$-5$
2	6	6	6
3	3	9	9
4	$-1$	8	9
5	$-2$	6	9
6	13	19	19
7	4	23	23
8	$-9$	14	23
9	$-1$	13	23
10	4	17	23
11	12	29	29
12	$-3$	26	29
13	0	26	29

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.