MULTIPLIER AI Hiring Challenge | Online Assessment Interview Question | Off-Campus (2022)

Q1: Count Elements With Strictly Smaller and Greater Element Problem Statement You are given an integer array nums. Return the number of elements that have at least one strictly smaller element and at least one strictly greater element somewhere in the array. In other words, count all elements that are neither the minimum nor the maximum value in the array. Example Input nums = [11,7,2,15] Output 2 Explanation Minimum element = 2 Maximum element = 15 Elements 7 and 11 ...