2148. Count Elements With Strictly Smaller and Greater Elements Обновлено: 2024-03-12 1 мин Algorithms , LeetCode СодержаниеLeetCode problem 2148class Solution: def countElements(self, nums: List[int]) -> int: mi, mx = min(nums), max(nums) return sum(mi < num < mx for num in nums)