Leetcode - Single Number Solution — The Poor Coder

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

Follow up: Could you implement a solution with a linear runtime complexity and without using extra memory?

Example 1:

Text

Input: nums = [2,2,1]
Output: 1

Example 2:

Text

Input: nums = [4,1,2,1,2]
Output: 4

Example 3:

Text

Input: nums = [1]
Output: 1

Constraints:

1 <= nums.length <= 3 * 10⁴
-3 * 10⁴ <= nums[i] <= 3 * 10⁴
Each element in the array appears twice except for one element which appears only once.

Solution in python#

Python

class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        return sum(set(nums))*2-sum(nums)

May 112021

Leetcode - Count Good Meals Solution

A good meal is a meal that contains exactly two different food items with a sum of deliciousness equal to a power of two. You can pick any two different foods to make a good meal. Given an array of integers…

leetcode array Hash Table2 min read

May 112021

Leetcode - Number of Good Pairs Solution

Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Example 2: Example 3: Constraints: 1 <= nums.length <= 100 1 <= nums[i] <= 100…

leetcode array Hash Table1 min read

May 112021

Leetcode - Making File Names Unique Solution

Given an array of strings names of size n. You will create n folders in your file system such that, at the ith minute, you will create a folder with the name names[i]. Since two files cannot have the same name, if you…

leetcode string Hash Table3 min read

Solution in python#

Related posts

Leetcode - Count Good Meals Solution

Leetcode - Number of Good Pairs Solution

Leetcode - Making File Names Unique Solution