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...

Maximum Sum After Exponentiation Meltwater - IIT Hyderabad 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

Maximum Sum After Exponentiation Meltwater - IIT Hyderabad

Mode: On-Campus OA Date: 2026-10-30

Maximum Sum After Exponentiation

You are given arrays, p and q of same size n. You can make arbitrary number of swaps between adjacent elements in p. You have to find the maximum sum of p[i] ^ q[i] (p[i] to the power of q[i]) from i = 0 to n-1. 1 <= n <= 10^5 1 <= p[i] <= 10^9 couldn't remember the constraints on q[i] but you have to use binary exponentiation for the solution.

solution.cpp

Loading code editor...

Run code to see test results

00:00 / 69:42

Maximum Sum After Exponentiation Meltwater - IIT Hyderabad

MediumMed•105 views•FTE

Mode: On-Campus OA Date: 2026-10-30

Maximum Sum After Exponentiation

MediumMed•105 viewsOn-CampusFTE

Time Complexity

Space Complexity

Asked at

Meltwater

Maximum Sum After Exponentiation Meltwater - IIT Hyderabad

Maximum Sum After Exponentiation

Maximum Sum After Exponentiation Meltwater - IIT Hyderabad

Maximum Sum After Exponentiation

Published by Codinzhub

More from Meltwater

Count Valid pairs Meltwater - IIT Hyderabad

Maximise the Product Meltwater - IIT Hyderabad

Subarray Average Frequency Queries Meltwater - IIT Hyderabad