TomoLink
TCS NQT GuideTCS NQT Coding Capability & AlgorithmsClassic Array Problems (Rotation, Kadane's Algorithm, Subarrays)

Classic Array Problems (Rotation, Kadane's Algorithm, Subarrays)

Learn core concepts, essential formulas, and attempt practice questions designed on the latest TCS NQT testing patterns.

Key Concepts & Formulas

  • 1Array Rotation: Shift elements left/right by k positions.
  • 2Kadane's Algorithm: Tracks max subarray sum by resetting local sums below 0.

TCS NQT Style Practice Questions

Practice Question 1

What is the maximum subarray sum in array: [-2, 1, -3, 4, -1, 2, 1]?

A) 6
B) 4
C) 5
D) 3

Correct Answer: A) 6

Step-by-step Solution: Subarray [4, -1, 2, 1] yields maximum sum = 4 - 1 + 2 + 1 = 6.

Practice Question 2

What does Kadane's algorithm reset current sum to if it drops below zero?

A) 0
B) Current element
C) Previous element
D) Minimum integer

Correct Answer: A) 0

Step-by-step Solution: If the running sum becomes negative, adding it to next elements decreases their sum. Kadane's resets it to 0.

Study Pro-Tip

Kadane's algorithm runs in linear O(N) time complexity, whereas brute-force search takes O(N^2).

Back to TCS NQT Coding Capability & Algorithms Master Guide
PreviousNext