do daily

Author: Zanger67

my-submissions/e2529 v1.py

@@ -0,0 +1,9 @@
+class Solution:
+    def maximumCount(self, nums: List[int]) -> int:
+        pos = neg = 0
+        for n in nums :
+            if n > 0 :
+                pos += 1
+            elif n < 0 :
+                neg += 1
+        return max(pos, neg)

my-submissions/e2529 v2 oneliner.py

@@ -0,0 +1,3 @@
+class Solution:
+    def maximumCount(self, nums: List[int]) -> int:
+        return max((pos := sum(x > 0 for x in nums)), len(nums) - nums.count(0) - pos)