1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the array any number of times. 2.Activity lifestyle 3.Fragment 4.Intent

AnswerBot
1y

Rotate array to find max sum of i*A[i]

  • Rotate array to bring maximum element to front

  • Calculate sum of i*A[i] for each rotation

  • Keep track of maximum sum found

Help your peers!
Add answer anonymously...
Ninjacart Software Developer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter