Given an array nums, return how many times its largest value appears. Both solutions are O(n)Linear Time O(n)Work that grows in direct proportion to the input size: twice the data, about twice the time.: every element is looked at a fixed number of times, so doubling the array roughly doubles the work. Two passes cost 2n and one pass costs n, but Big-O ignores constant factors — both are linear. Linear time is usually the best possible when every element has to be inspected.