Calculate second max without second loop and sorting

Question

Accepted Answer

Find the second maximum value in an array without using a second loop or sorting.

Iterate through the array once, keeping track of the maximum and second maximum values.
Initialize the maximum and second maximum variables with the first and second elements of the array.
Compare each element with the maximum and second maximum variables, updating them if necessary.
At the end of the iteration, the second maximum variable will hold the second largest value.

Accepted Answer

Use a priority queue in C#. int[] nums = [3, 2, 1, 5, 6, 4]; int k = 2; // Use a min-heap with a fixed size of k PriorityQueue minHeap = new PriorityQueue(); foreach (int num in nums) { // Add the current number to the heap minHeap.Enqueue(num, num); // If the heap size exceeds k, remove the smallest element if (minHeap.Count > k) { minHeap.Dequeue(); } } // The root of the min-heap is the k-th largest element var result = minHeap.Dequeue();

Accepted Answer

import math
def solve(arr):
    if len(arr)<2:
        return False
    first = second =-math.inf
    for i in range(len(arr)):
        if arr[i]>first:
            second=first
            first=arr[i]
        elif arr[i]> second and arr[i]!=first:
            second=arr[i]
    if second!=-math.inf:
        return second
    else:return "not Found"
if __name__=="__main__":
    arr=list(map(int,input("enter the numbers: ").split()))
    print(solve(arr))

Calculate second max without second loop and sorting

Top Metacube Software Graduate Engineer Trainee (Get) interview questions & answers

Popular interview questions of Graduate Engineer Trainee (Get)