Given a list of integers, return a new list where each element is the sum of all the integers in the original list except the current element. Can you solve this in O(n) time complexity without using division?
Example:
Input:
[4, 5, 6, 7]
Output:
[18, 17, 16, 15]
Make sure you return your solution, don't print!
AI
Bot
Trying to solve my challenge? Ask if you must, or press the purple button so I can analyze your code.