LeetCode 136: Single Number Solution

Master LeetCode problem 136 (Single Number), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

136. Single Number

Easy

Array Bit Manipulation

Problem Explanation

Explanation

To solve this problem with linear runtime complexity and constant extra space, we can use the bitwise XOR operation. When we XOR all elements in the array, the duplicate numbers will cancel each other out, leaving only the single number.

Solution Code

public int singleNumber(int[] nums) {
    int result = 0;
    for (int num : nums) {
        result ^= num;
    }
    return result;
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 136 (Single Number)?

This page provides optimized solutions for LeetCode problem 136 (Single Number) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 136 (Single Number)?

The time complexity for LeetCode 136 (Single Number) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 136 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 136 in Java, C++, or Python.

Back to LeetCode Solutions