Haneunhanlee.hashnode.devยทJul 22, 2022[Solution] 2148. Count Elements With Strictly Smaller and Greater ElementsProblem 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) { ...Algorithm Solving StudyleetcodeAdd a thoughtful commentNo comments yetBe the first to start the conversation.
![[Solution] 2148. Count Elements With Strictly Smaller and Greater Elements](https://cdn.hashnode.com/res/hashnode/image/unsplash/npxXWgQ33ZQ/upload/v1658523940178/i6PMXo4DUK.jpeg?w=1600&h=840&fit=crop&crop=entropy&auto=compress,format&format=webp)
