[Solution] 2148. Count Elements With Strictly Smaller and Greater Elements

Problem Problem_Link Solutions (time, space) O(n), O(1) class Solution { public int countElements(int[] nums) { int min = Integer.MAX_VALUE; int max = Integer.MIN_VALUE; int count = 0; for (int temp : nums) { ...