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).

def majority_element(nums) return nums.sort[nums.length/2] end

Can someone help me by explaining time and space complexities of this solution? Thanks!

Ruby Sorting is quick sort which has essentially O(nlogn) in time and O(logn) in space. While it's not the optimal solution, which is O(n), it's easy to understand.

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