add 283, 292, 468, 595, 2621, 3079, 3467, modify 2621

Author: rustykitty

0283-move-zeroes.py

@@ -0,0 +1,16 @@
+"""
+283. Move Zeroes
+
+Submitted: May 20, 2025
+
+Runtime: 0 ms (beats 100.00%)
+Memory: 19.08 MB (beats 9.79%)
+"""
+
+class Solution:
+    def moveZeroes(self, nums: List[int]) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        # technically modifying in place...
+        nums[:] = [i for i in nums if i != 0] + [0] * nums.count(0)

0292-nim-game.cpp

@@ -0,0 +1,15 @@
+/*
+292. Nim Game
+
+Submitted: May 20, 2025
+
+Runtime: 0 ms (beats 100.00%)
+Memory: 7.80 MB (beats 53.38%)
+*/
+
+class Solution {
+public:
+    bool canWinNim(int n) {
+        return n % 4 != 0;
+    }
+};

0468-validate-ip-address.py

@@ -0,0 +1,30 @@
+"""
+468. Validate IP Address
+
+Submitted: May 20, 2025
+
+Runtime: 1 ms (beats 7.28%)
+Memory: 17.78 MB (beats 71.36%)
+"""
+
+import re
+
+RE_IPV4_LIKELY = re.compile(r'[0-9]{1,3}(?:\.[0-9]{1,3}){3}')
+RE_IPV6 = re.compile(r'(?:[0-9a-f]{1,4})(?::[0-9a-f]{1,4}){7}', re.I)
+NO_LEADING_ZEROES = re.compile(r'0|[1-9][0-9]*')
+
+def isIPv4(ip: str) -> bool:
+    if not RE_IPV4_LIKELY.fullmatch(ip):
+        return False
+    return all(0 <= int(n) <= 255 and NO_LEADING_ZEROES.fullmatch(n) for n in ip.split('.'))
+
+def isIPv6(ip: str) -> bool:
+    return bool(RE_IPV6.fullmatch(ip))
+
+class Solution:
+    def validIPAddress(self, queryIP: str) -> str:
+        return (
+            "IPv4" if isIPv4(queryIP) else (
+                "IPv6" if isIPv6(queryIP) else "Neither"
+            )
+        )

0595-big-countries.sql

@@ -0,0 +1,11 @@
+/*
+595. Big Countries
+
+Submitted: May 20, 2025
+
+Runtime: 260 ms (beats 86.70%)
+*/
+
+# Write your MySQL query statement below
+SELECT name, population, area FROM World 
+WHERE area >= 3000000 OR population >= 25000000

2621-sleep.ts

@@ -0,0 +1,18 @@
+/*
+2621. Sleep
+
+Submitted: May 5, 2025
+
+Runtime: 55 ms (beats 11.05%)
+Memory: 54.95 MB (beats 60.28%)
+*/
+
+async function sleep(millis: number): Promise<void> {
+    return new Promise(resolve => setTimeout(resolve, millis));
+}
+
+
+/** 
+ * let t = Date.now()
+ * sleep(100).then(() => console.log(Date.now() - t)) // 100
+ */

2723-add-two-promises.ts

@@ -0,0 +1,20 @@
+/*
+2723. Add Two Promises
+
+Submitted: May 20, 2025
+
+Runtime: 54 ms (beats 59.13%)
+Memory: 54.12 MB (beats 96.93%)
+*/
+
+async function addTwoPromises(
+                                promise1: Promise<number>, 
+                                promise2: Promise<number>
+                             ): Promise<number> {
+    return await promise1 + await promise2;
+};
+
+/**
+ * addTwoPromises(Promise.resolve(2), Promise.resolve(2))
+ *   .then(console.log); // 4
+ */

3079-find-the-sum-of-encrypted-integers.py

@@ -0,0 +1,16 @@
+"""
+3079. Find the Sum of Encrypted Integers
+
+Submitted: May 20, 2025
+
+Runtime: 54 ms (beats 61.66%)
+Memory: 17.88 MB (beats 34.20%)
+"""
+
+def encrypt(n: int):
+    s = str(n)
+    return int(len(s) * max(s))
+
+class Solution:
+    def sumOfEncryptedInt(self, nums: List[int]) -> int:
+        return sum(encrypt(n) for n in nums)

3467-transform-array-by-parity.py

@@ -0,0 +1,14 @@
+"""
+3467. Transform Array by Parity
+
+Submitted: May 20, 2025
+
+Runtime: 0 ms (beats 100.00%)
+Memory: 17.67 MB (beats 96.40%)
+"""
+
+class Solution:
+    def transformArray(self, nums: List[int]) -> List[int]:
+        return sorted(
+            n % 2 for n in nums
+        )