3778. Transform Array by Parity
My accepted Python solution to LeetCode problem 3778, Transform Array by Parity, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2025-12-31.
class Solution:
def transformArray(self, nums: List[int]) -> List[int]:
result = [0 if x % 2 == 0 else 1 for x in nums]
result.sort()
return result