Company: Edgeverve_17_jan
Difficulty: medium
Cyclic Maximum Subarray Sum body { font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Helvetica Neue", "Arial", sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2 { border-bottom: 1px solid #eaecef; padding-bottom: 0.3em; } code { font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; background-color: #f6f8fa; padding: 0.2em 0.4em; margin: 0; font-size: 85%; border-radius: 3px; } pre { background-color: #f6f8fa; padding: 16px; overflow: auto; border-radius: 3px; } pre code { padding: 0; margin: 0; font-size: 100%; background-color: transparent; } ul { padding-left: 20px; } 1. Cyclic Maximum Subarray Sum Problem Description You are given an array a of length n . You can do the following operation on a any number of times: Delete the first element in a and append that element to the end of a . This operation effectively means you can treat the array as circular. Find the maximum su