Unsorted array sum


  • 0
    Y

    You are given an array of distinct unsorted integers. Design O(n) algorithm to find the sum of the integers from the n-th index to the k-th index in the sorted form of the array.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.