Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

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.

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