Loading Company...
Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.
Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.
This is a verified interview question from Meltwater. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "Maximum Sum After Exponentiation Meltwater - IIT Hyderabad" covers key patterns like Other.
"**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."
Join thousands of developers practicing for Meltwater.