Jobra

HackerRank:LeetCode is dead.→Codinzhub:

🐞Step 1 of Jobra:AI Debugging RoundsAI-based coding roundsReal-world codebasesAI-powered debugging

DSA+AIPreparing you for both.Coming soon.

COMING SOON

JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp

// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}

A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition

Tap 'Let Jobra fix it' below to simulate AI debugging...

CodinzHub

Loading Question...

Partition Array into K Sectors – Minimum and Maximum Cost Microsoft - Indian Institute of Technology, Guwahati Online Assessment | Codinzhub

Jobra

HackerRank:LeetCode is dead.→Codinzhub:

🐞Step 1 of Jobra:AI Debugging RoundsAI-based coding roundsReal-world codebasesAI-powered debugging

DSA+AIPreparing you for both.Coming soon.

COMING SOON

JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp

// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}

A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition

Tap 'Let Jobra fix it' below to simulate AI debugging...

CodinzHub

Partition Array into K Sectors – Minimum and Maximum Cost Microsoft - Indian Institute of Technology, Guwahati

Mode: On-Campus Exam Pattern: 2 coding OA Date: 2026-08-10

Partition Array into K Sectors – Minimum and Maximum Cost

You are given an array A of size N and an integer K.

You need to partition the array into exactly K non-empty, contiguous, non-overlapping sectors.

The cost of each sector is defined as: [ \text{Cost}(L,R)=A[L]+A[R] ]

where A[L] and A[R] are the first and last elements of that sector.

Calculate:

The minimum possible total cost among all valid partitions.
The maximum possible total cost among all valid partitions. The total cost of a partition is the sum of the costs of all its sectors.

Example: N = 5 K = 2 A = [1, 5, 3, 4, 2]

solution.cpp

Loading code editor...

Run code to see test results

00:00 / 69:42

Partition Array into K Sectors – Minimum and Maximum Cost Microsoft - Indian Institute of Technology, Guwahati

MediumMed•190 views•FTE

Mode: On-Campus Exam Pattern: 2 coding OA Date: 2026-08-10

Partition Array into K Sectors – Minimum and Maximum Cost

You are given an array A of size N and an integer K.

You need to partition the array into exactly K non-empty, contiguous, non-overlapping sectors.

The cost of each sector is defined as: [ \text{Cost}(L,R)=A[L]+A[R] ]

where A[L] and A[R] are the first and last elements of that sector.

Calculate:

The minimum possible total cost among all valid partitions.
The maximum possible total cost among all valid partitions. The total cost of a partition is the sum of the costs of all its sectors.

Example: N = 5 K = 2 A = [1, 5, 3, 4, 2]

MediumMed•190 viewsOn-CampusFTE

Partition Array into K Sectors – Minimum and Maximum Cost Microsoft - Indian Institute of Technology, Guwahati

Partition Array into K Sectors – Minimum and Maximum Cost

Partition Array into K Sectors – Minimum and Maximum Cost Microsoft - Indian Institute of Technology, Guwahati

Partition Array into K Sectors – Minimum and Maximum Cost

Published by Codinzhub

More from Microsoft

Total Cost Based on First Smaller Element to the Right Microsoft - Indian Institute of Technology, Guwahati

Special Node Classification in a General Tree Microsoft - IIT (ISM) Dhanbad

Counting Valid Domino Colourings Microsoft - IIT (ISM) Dhanbad

SDE

Microsoft Sde-Intern Interview Experience - IIT Guwahati On Campus 2026