Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 136 with 13 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 136 # by problem number
lcpy gen -s single_number # by problem name
nums, every element appears twice except for one. Find that single one.
You must implement a solution with a linear runtime complexity and use only constant extra space.
Input: nums = [2,2,1]
Output: 1
Input: nums = [4,1,2,1,2]
Output: 4
Input: nums = [1]
Output: 1
from functools import reduce
from operator import xor
class Solution:
# Time: O(n)
# Space: O(1)
def single_number(self, nums: list[int]) -> int:
return reduce(xor, nums)
| Time | Space |
|---|---|
| O(n) | O(1) |