Single Number 3 LeetCode Solution - The Coding Shala

Home >> LeetCode >> Single Number 3

 In this post, we will learn how to solve LeetCode's Single Number 3 problem and will implement its solution in Java.

Single Number 3 Problem

Given an integer array nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in any order.

Example 1:
Input: nums = [1,2,1,3,2,5]
Output: [3,5]
Explanation:  [5, 3] is also a valid answer.

Example 2:
Input: nums = [-1,0]
Output: [-1,0]

Example 3:
Input: nums = [0,1]
Output: [1,0]

Practice this problem on LeetCode.

LeetCode - Single Number 3 Java Solution

Approach 1

Using HashMap [ Extra Space].

Java Program: 

class Solution {
    public int[] singleNumber(int[] nums) {
        Map<Integer, Integer> map = new HashMap<>();
        int[] ans = new int[2];
        for(int num : nums) {
            if(map.containsKey(num)) map.put(num, map.get(num)+1);
            else map.put(num, 1);
        }
        ArrayList<Integer> arr = new ArrayList<>();
        for(int num : nums) {
            if(map.get(num) == 1) arr.add(num);
        }
        ans[0] = arr.get(0);
        ans[1] = arr.get(1);
        return ans;
    }
}

Approach 2

Using Bit Manipulation.

We will follow the below steps:

  • step 1: XOR all the numbers, the result will be res1 ^ res2.
  • step 2: Now our result contains both single numbers xor if a bit is zero in xor that means both the bit in res1 and res 2 is the same so we can't determine with that. We need to find the 1 bit index. Traverse all the 32-bit indexes of the XOR result, once we find there exists 1 bit on the index, break the loop.
  • Step 3: Now we have an index that has 1 bit so one of our numbers has 1 bit at that index so we will traverse all the numbers in the input array, if we find a number with a bit index that is not 0 then we can use res1 XOR current num to iteratively fill out an effective bit in res1.For example res1 ^ n1 ^ n1 = res1. [n1 appears twice]
  • Step 4: we have res1 so by doing res1 ^ allnNumberoXor we will get res2.
Java Program: 

class Solution {
    public int[] singleNumber(int[] nums) {
        int allNumberXor = 0;
        //single1 ^ single2
        for(int num : nums) {
            allNumberXor ^= num;
        }
        
        //find ith bit as 1;
        int bitIndex;
        for(bitIndex = 0; bitIndex < 32; bitIndex++) {
            if((allNumberXor & (1 << bitIndex)) != 0) break;
        }
        
        //check this bitIndex for every number to find single1
        int single1 = 0;
        int single2 = 0;
        for(int num : nums) {
            if((num & (1 << bitIndex)) !=0) {
                single1 ^= num;
            }
        }
        
        //get single2
        single2 = single1 ^ allNumberXor;
        
        return new int[] {single1, single2};
    }
}


Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Home >> Scripting >> Sum, product and average Shell Script to find the sum, product, and the average of given numbers Read four integer numbers from the user and find the sum, product, and average of these four numbers? Code:  #! / bin / bash echo "enter four integers" read a b c d sum =$(echo "$a + $b + $c + $d" | bc - l) average=$(echo "$sum / 4" | bc - l) product=$(echo "$a * $b * $c * $d" | bc - l) echo "sum = $sum" echo "Average = $average" echo "Product = $product" Other Posts You May Like Shell script to print sum of the digits of a number Shell Script to print number in descending order Shell script to find out biggest number from three numbers Shell script to find out factorial of a number Shell Script to create a simple calculator Please leave a comment below if you like this post or found some error, it will help me to improve my content.
Read more

Add two numbers in Scala - The Coding Shala

Home >> Learn Scala >> Add Two Numbers  In this post, we will learn how to write a Scala program to Add Two Numbers. Add Two Numbers in Scala The following is the Scala program to Add two Numbers. Scala Program:  //add two numbers in scala //the coding shala object Main { def main ( args : Array [ String ]){ //we can take user input also val num1 = 10 ; val num2 = 20 ; //add both numbers val result = num1 + num2 ; println ( "Sum of " + num1 + " + " + num2 + " = " + result ); } } Other Posts You May Like Scala - Hello World Program Java - Hello World Program Power of Two Simple XML Validator Fibonacci Series Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y
Read more

Goal Parser Interpretation LeetCode Solution - The Coding Shala

Home >> LeetCode >> Goal Parser Interpretation  In this post, we will learn how to solve LeetCode's Goal Parser Interpretation Problem and will implement its solution in Java. Goal Parser Interpretation Problem You own a Goal Parser that can interpret a string command. The command consists of an alphabet of "G", "()", and/or "(al)" in some order. The Goal Parser will interpret "G" as the string "G", "()" as the string "o", and "(al)" as the string "al". The interpreted strings are then concatenated in the original order. Given the string command, return the Goal Parser's interpretation of the command. Example 1: Input: command = "G()(al)" Output: "Goal" Explanation: The Goal Parser interprets the command as follows: G -> G () -> o (al) -> al The final concatenated result is "Goal". Example 2: Input: command = "G()()()()(al)&qu
Read more

Check If N and Its Double Exist in an array - The Coding Shala

Home >> Programming Questions >> N and its double Check if N and its Double Exist in an array In this post, we will learn how to check if N and its double exist in an array and will implement its solution in Java. Given an array arr of integers, check if there exist two integers N and M such that N is the double of M ( i.e. N = 2 * M). More formally check if there exists two indices i and j such that: i != jk 0 <= i, j < arr.length arr[i] == 2 * arr[j] Example 1: Input: arr = [10,2,5,3] Output: true Explanation: N = 10 is the double of M = 5,that is, 10 = 2 * 5. Example 2: Input: arr = [7,1,14,11] Output: true Explanation: N = 14 is the double of M = 7,that is, 14 = 2 * 7. Example 3: Input: arr = [3,1,7,11] Output: false Explanation: In this case does not exist N and M, such that N = 2 * M. Check N and its double exist Solution Approach: We can check this using HashSet. Check every number's double and if its divisible by two then check its half in the set.
Read more