Efficient method to check if a number is multiple of 3


In binary representation of a number, if difference between even set bit and odd set bit is a multiple of 3.

 For example:
12 = 0000 1100
difference = 0
since 0 is a multiple of any integer, 12 is  multiple of 3..

 Code:

 import java.util.*;

 public class Solution {
    
    static int ismultipleof3(int num){
        int evencount = 0;
        int oddcount = 0;
        
        if(num < 0)
            num = -num;
        if(num == 0) return 0;
        if(num == 1) return 1;
        
        
        while(num != 0){
            if((num & 1) != 0){
                oddcount++;
            }
            
            num = num>>1;
            if((num & 1) != 0){
                evencount++;
            }
            
            num = num>>1;
        }
        //System.out.println(Math.abs(oddcount-evencount));
        
        return ismultipleof3(Math.abs(oddcount-evencount));
        
        
    }
    
    public static void main(String[] args) {
        int num = 6;
        int result = ismultipleof3(num);
        if(result==0){
            System.out.print(num+" is a multiple of 3");
        }
        else{
            System.out.print(num+" is not a multiple of 3");
        }
     
    }
}

 Output:

 
6 is a multiple of 3

Comments

Post a Comment

Popular posts from this blog

Rearrange Array in Maximum-Minimum form

Given a sorted array of positive integers, rearrange the array alternately i.e first element should be the maximum value, second minimum value, third-second max, fourth-second min and so on. Naive Solution: Here we will use an auxiliary array to store the elements in correct order. For even indices of the array  Large numbers from the given array are added. For odd indices small numbers are added. Code: import java.util.*; public class Test{        public static void main(String[] args) {          Scanner in = new Scanner(System.in);     int[] a = {1,2,3,4,5,6,7,8,9};     int n = a.length;     int[] temp = new int[n];     int small = 0;     int large = n-1;     for(int i=0; i<n; i++){         if(i%2 == 0){             temp[i] = a[large--];         }  ...
Read more

Find Maximum in Binary Tree

Problem link Recursion Steps: If the node is null return Integers min value Maximum is the max of node data, left subtree and right subtree. Code: package may; public class MaximumInTree {         Node root;         int findMax(Node node){         if(node == null)             return Integer.MIN_VALUE;                 return Math.max(Math.max(node.data, findMax(node.left)), findMax(node.right));     }         public static void main(String args[])     {         MaximumInTree tree = new MaximumInTree();         tree.root = new Node(2);         tree.root.left = new Node(7);         tree.root.right...
Read more