xor | brain

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 268: Missing Number

Problem Restatement We are given an array nums containing n distinct numbers from the range: 0, 1, 2, ..., n Exactly one number from this range is missing. Return the missing number. For example, if: nums = [3, 0, 1] then n = 3 , so the full range should be: [0, 1, 2, 3] The missing number is: 2 The problem asks for an algorithm with linear runtime. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 136: Single Number

Problem Restatement We are given a non-empty integer array nums . Every element appears exactly twice except for one element. We need to return the element that appears only once. The solution must run in linear time and use constant extra space. LeetCode states this explicitly in the problem requirements. Examples Example 1: nums = [2, 2, 1] The number 2 appears twice. The number 1 appears once. Output: 1...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 260: Single Number III

Problem Restatement We are given an integer array nums . Exactly two numbers appear only once. Every other number appears exactly twice. We need to return the two numbers that appear only once. The answer may be returned in any order. The problem asks for: Linear runtime Constant extra space The constraints are 2 <= nums.length <= 3 * 10^4 , -2^31 <= nums[i] <= 2^31 - 1 . Input...

#xor

LeetCode 268: Missing Number

LeetCode 136: Single Number

LeetCode 260: Single Number III