Check if two numbers are equal without using arithmetic and comparison operators Last Updated : 04 Dec, 2023 Summarize Suggest changes Share Like Article Like Report Given two numbers, the task is to check if two numbers are equal without using Arithmetic and Comparison Operators or String functions. Method 1 : The idea is to use XOR operator. XOR of two numbers is 0 if the numbers are the same, otherwise non-zero. C++ // C++ program to check if two numbers // are equal without using arithmetic // and comparison operators #include <iostream> using namespace std; // Function to check if two // numbers are equal using // XOR operator void areSame(int a, int b) { if (a ^ b) cout << "Not Same"; else cout << "Same"; } // Driver Code int main() { // Calling function areSame(10, 20); } Java // Java program to check if two numbers // are equal without using arithmetic // and comparison operators class GFG { // Function to check if two // numbers are equal using // XOR operator static void areSame(int a, int b) { if ((a ^ b) != 0) System.out.print("Not Same"); else System.out.print("Same"); } // Driver Code public static void main(String[] args) { // Calling function areSame(10, 20); } } // This code is contributed by Smitha Python3 # Python3 program to check if two numbers # are equal without using arithmetic # and comparison operators def areSame(a, b): # Function to check if two # numbers are equal using # XOR operator if ((a ^ b) != 0): print("Not Same") else: print("Same") # Driver Code areSame(10, 20) # This code is contributed by Smitha C# // C# program to check if two numbers // are equal without using arithmetic // and comparison operators using System; class GFG { // Function to check if two // numbers are equal using // XOR operator static void areSame(int a, int b) { if ((a ^ b) != 0) Console.Write("Not Same"); else Console.Write("Same"); } // Driver Code public static void Main(String[] args) { // Calling function areSame(10, 20); } } // This code is contributed by Smitha JavaScript <script> // Javascript program to check if two numbers // are equal without using arithmetic and // comparison operators // Function to check if two // numbers are equal using // XOR operator function areSame(a, b) { if ((a ^ b) != 0) document.write("Not Same"); else document.write("Same"); } // Driver Code areSame(10, 20); // This code is contributed by shikhasingrajput </script> PHP <?php // PHP program to check if // two numbers are equal // without using arithmetic // and comparison operators // Function to check if two // numbers are equal using // XOR operator function areSame($a, $b) { if ($a ^ $b) echo "Not Same"; else echo "Same"; } // Driver Code // Calling function areSame(10, 20); // This code is contributed // by nitin mittal. ?> OutputNot SameTime Complexity: O(1)Auxiliary Space: O(1) Method 2 : Here idea is using complement ( ~ ) and bit-wise '&' operator. C++ // C++ program to check if two numbers // are equal without using arithmetic // and comparison operators #include <iostream> using namespace std; // Function to check if two // numbers are equal using // using ~ complement and & operator. void areSame(int a, int b) { if ((a & ~b) == 0) cout << "Same"; else cout << "Not Same"; } // Driver Code int main() { // Calling function areSame(10, 20); // This Code is improved by Sonu Kumar Pandit } Java // Java program to check if two numbers // are equal without using arithmetic // and comparison operators class GFG { // Function to check if two // numbers are equal using // using ~ complement and & operator. static void areSame(int a, int b) { if ((a & ~b) == 0 && (~a & b) == 0) System.out.print("Same"); else System.out.print("Not Same"); } // Driver Code public static void main(String args[]) { // Calling function areSame(10, 20); } } // This code is contributed // by Akanksha Rai Python3 # Python3 program to check if two numbers # are equal without using arithmetic # and comparison operators # Function to check if two # numbers are equal using # using ~ complement and & operator. def areSame(a, b): if ((a & ~b) == 0 and (~a & b) == 0): print("Same") else: print("Not Same") # Calling function areSame(10, 20) # This code is contributed by Rajput-Ji C# // C# program to check if two numbers // are equal without using arithmetic // and comparison operators using System; class GFG { // Function to check if two // numbers are equal using // using ~ complement and & operator. static void areSame(int a, int b) { if ((a & ~b) == 0 && (~a & b) == 0) Console.Write("Same"); else Console.Write("Not Same"); } // Driver Code public static void Main() { // Calling function areSame(10, 20); } } // This code is contributed // by Akanksha Rai JavaScript <script> // Javascript program to check if two numbers // are equal without using arithmetic // and comparison operators // Function to check if two // Numbers are equal using // using ~ complement and & operator. function areSame(a, b) { if ((a & ~b) == 0 && (~a & b) == 0) document.write("Same"); else document.write("Not Same"); } // Driver Code // Calling function areSame(10, 20); // This code is contributed by gauravrajput1 </script> PHP <?php // PHP program to check if two numbers // are equal without using arithmetic // and comparison operators // Function to check if two // numbers are equal using // using ~ complement and & operator. function areSame($a, $b) { if (($a & ~$b)==0 && (~$a & $b)==0) echo "Same"; else echo "Not Same"; } // Driver Code // Calling function areSame(10, 20); // This code is contributed by ita_c ?> OutputNot SameTime Complexity: O(1)Auxiliary Space: O(1) Using bit manipulation:Approach: Another approach is to use bit manipulation to compare each bit of the two numbers. We can use the bit-shift operators to extract each bit and compare them one by one. Define a function named is_equal that takes two arguments num1 and num2.Initialize a variable mask to 1.Loop through the range of 32 bits (assuming 32-bit integers).Use the bitwise AND operator (&) to extract the i-th bit of num1 and num2.Compare the extracted bits using the not equal to operator (!=).If the extracted bits are not equal, return False.Shift the mask left by one bit using the left shift operator (<<).Return True if all bits are equal. C++ // CPP code for the above approach #include <iostream> using namespace std; bool isEqual(int num1, int num2) { int mask = 1; for (int i = 0; i < 32; i++) { // assuming 32-bit integers if ((num1 & mask) != (num2 & mask)) { return false; } mask <<= 1; } return true; } int main() { // Example usage cout << (isEqual(10, 10) ? "True" : "False") << endl; // Output: 1 (true) cout << (isEqual(10, 20) ? "True" : "False") << endl; // Output: 0 (false) return 0; } // This code is contributed by Susobhan Akhuli Java // Java code for the above approach public class GFG { // Function to check if two numbers have equal binary // representation static boolean isEqual(int num1, int num2) { int mask = 1; for (int i = 0; i < 32; i++) { // assuming 32-bit integers if ((num1 & mask) != (num2 & mask)) { return false; } mask <<= 1; } return true; } // Main method to demonstrate the usage public static void main(String[] args) { // Example usage System.out.println(isEqual(10, 10) ? "True" : "False"); // Output: true System.out.println(isEqual(10, 20) ? "True" : "False"); // Output: false } } // This code is contributed by Susobhan Akhuli Python3 def is_equal(num1, num2): mask = 1 for i in range(32): # assuming 32-bit integers if (num1 & mask) != (num2 & mask): return False mask <<= 1 return True # Example usage print(is_equal(10, 10)) # Output: True print(is_equal(10, 20)) # Output: False C# using System; class Program { static bool IsEqual(int num1, int num2) { int mask = 1; for (int i = 0; i < 32; i++) // assuming 32-bit integers { // If the bits at the current position are different, return false if ((num1 & mask) != (num2 & mask)) { return false; } mask <<= 1; } // All corresponding bits are equal, return true return true; } static void Main() { // Example usage Console.WriteLine(IsEqual(10, 10) ? "True" : "False"); // Output: True Console.WriteLine(IsEqual(10, 20) ? "True" : "False"); // Output: False } } // This code is contributed by shivamgupta310570 JavaScript // Function to check if two numbers have equal binary representation function isEqual(num1, num2) { let mask = 1; for (let i = 0; i < 32; i++) { // assuming 32-bit integers if ((num1 & mask) !== (num2 & mask)) { return false; } mask <<= 1; } return true; } // Main method to demonstrate the usage console.log(isEqual(10, 10) ? "True" : "False"); // Output: true console.log(isEqual(10, 20) ? "True" : "False"); // Output: false OutputTrue FalseTime complexity: O(log n)Space complexity: O(1) Source: https://www.geeksforgeeks.org/count-of-n-digit-numbers-whose-sum-of-digits-equals-to-given-sum/ Advertise with us Next Article Detect if two integers have opposite signs K kartik Follow Similar Reads Bitwise Algorithms Bitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read Introduction to Bitwise Algorithms - Data Structures and Algorithms Tutorial Bit stands for binary digit. A bit is the basic unit of information and can only have one of two possible values that is 0 or 1. In our world, we usually with numbers using the decimal base. In other words. we use the digit 0 to 9 However, there are other number representations that can be quite use 15+ min read Bitwise Operators in C In C, bitwise operators are used to perform operations directly on the binary representations of numbers. These operators work by manipulating individual bits (0s and 1s) in a number.The following 6 operators are bitwise operators (also known as bit operators as they work at the bit-level). They are 6 min read Bitwise Operators in Java In Java, Operators are special symbols that perform specific operations on one or more than one operands. They build the foundation for any type of calculation or logic in programming.There are so many operators in Java, among all, bitwise operators are used to perform operations at the bit level. T 6 min read Python Bitwise Operators Python bitwise operators are used to perform bitwise calculations on integers. The integers are first converted into binary and then operations are performed on each bit or corresponding pair of bits, hence the name bitwise operators. The result is then returned in decimal format.Note: Python bitwis 5 min read JavaScript Bitwise Operators In JavaScript, a number is stored as a 64-bit floating-point number but bitwise operations are performed on a 32-bit binary number. To perform a bit-operation, JavaScript converts the number into a 32-bit binary number (signed) and performs the operation and converts back the result to a 64-bit numb 5 min read All about Bit Manipulation Bit Manipulation is a technique used in a variety of problems to get the solution in an optimized way. This technique is very effective from a Competitive Programming point of view. It is all about Bitwise Operators which directly works upon binary numbers or bits of numbers that help the implementa 14 min read What is Endianness? Big-Endian & Little-Endian Computers operate using binary code, a language made up of 0s and 1s. This binary code forms the foundation of all computer operations, enabling everything from rendering videos to processing complex algorithms. A single bit is a 0 or a 1, and eight bits make up a byte. While some data, such as cert 5 min read Bits manipulation (Important tactics) Prerequisites: Bitwise operators in C, Bitwise Hacks for Competitive Programming, Bit Tricks for Competitive Programming Table of Contents Compute XOR from 1 to n (direct method)Count of numbers (x) smaller than or equal to n such that n+x = n^xHow to know if a number is a power of 2?Find XOR of all 15+ min read Easy Problems on Bit Manipulations and Bitwise AlgorithmsBinary representation of a given numberGiven an integer n, the task is to print the binary representation of the number. Note: The given number will be maximum of 32 bits, so append 0's to the left if the result string is smaller than 30 length.Examples: Input: n = 2Output: 00000000000000000000000000000010Input: n = 0Output: 000000000000 6 min read Count set bits in an integerWrite an efficient program to count the number of 1s in the binary representation of an integer.Examples : Input : n = 6Output : 2Binary representation of 6 is 110 and has 2 set bitsInput : n = 13Output : 3Binary representation of 13 is 1101 and has 3 set bits[Naive Approach] - One by One CountingTh 15+ min read Add two bit stringsGiven two binary strings s1 and s2 consisting of only 0s and 1s. Find the resultant string after adding the two Binary Strings.Note: The input strings may contain leading zeros but the output string should not have any leading zeros.Examples:Input: s1 = "1101", s2 = "111"Output: 10100Explanation: "1 1 min read Turn off the rightmost set bitGiven an integer n, turn remove turn off the rightmost set bit in it. Input: 12Output: 8Explanation : Binary representation of 12 is 00...01100. If we turn of the rightmost set bit, we get 00...01000 which is binary representation of 8Input: 7 Output: 6 Explanation : Binary representation for 7 is 0 7 min read Rotate bits of a numberGiven a 32-bit integer n and an integer d, rotate the binary representation of n by d positions in both left and right directions. After each rotation, convert the result back to its decimal representation and return both values in an array as [left rotation, right rotation].Note: A rotation (or cir 7 min read Compute modulus division by a power-of-2-numberGiven two numbers n and d where d is a power of 2 number, the task is to perform n modulo d without the division and modulo operators.Input: 6 4Output: 2 Explanation: As 6%4 = 2Input: 12 8Output: 4Explanation: As 12%8 = 4Input: 10 2Output: 0Explanation: As 10%2 = 0Approach:The idea is to leverage bi 3 min read Find the Number Occurring Odd Number of TimesGiven an array of positive integers. All numbers occur an even number of times except one number which occurs an odd number of times. Find the number in O(n) time & constant space. Examples : Input : arr = {1, 2, 3, 2, 3, 1, 3}Output : 3 Input : arr = {5, 7, 2, 7, 5, 2, 5}Output : 5 Recommended 12 min read Program to find whether a given number is power of 2Given a positive integer n, the task is to find if it is a power of 2 or not.Examples: Input : n = 16Output : YesExplanation: 24 = 16Input : n = 42Output : NoExplanation: 42 is not a power of 2Input : n = 1Output : YesExplanation: 20 = 1Approach 1: Using Log - O(1) time and O(1) spaceThe idea is to 12 min read Find position of the only set bitGiven a number n containing only 1 set bit in its binary representation, the task is to find the position of the only set bit. If there are 0 or more than 1 set bits, then return -1. Note: Position of set bit '1' should be counted starting with 1 from the LSB side in the binary representation of the 8 min read Check for Integer OverflowGiven two integers a and b. The task is to design a function that adds two integers and detects overflow during the addition. If the sum does not cause an overflow, return their sum. Otherwise, return -1 to indicate an overflow.Note: You cannot use type casting to a larger data type to check for ove 7 min read Find XOR of two number without using XOR operatorGiven two integers, the task is to find XOR of them without using the XOR operator.Examples : Input: x = 1, y = 2Output: 3Input: x = 3, y = 5Output: 6Approach - Checking each bit - O(log n) time and O(1) spaceA Simple Solution is to traverse all bits one by one. For every pair of bits, check if both 8 min read Check if two numbers are equal without using arithmetic and comparison operatorsGiven two numbers, the task is to check if two numbers are equal without using Arithmetic and Comparison Operators or String functions. Method 1 : The idea is to use XOR operator. XOR of two numbers is 0 if the numbers are the same, otherwise non-zero. C++ // C++ program to check if two numbers // a 8 min read Detect if two integers have opposite signsGiven two integers a and b, the task is to determine whether they have opposite signs. Return true if the signs of the two numbers are different and false otherwise.Examples:Input: a = -5, b = 10Output: trueExplanation: One number is negative and the other is positive, so their signs are different.I 9 min read Swap Two Numbers Without Using Third VariableGiven two variables a and y, swap two variables without using a third variable. Examples: Input: a = 2, b = 3Output: a = 3, b = 2Input: a = 20, b = 0Output: a = 0, b = 20Input: a = 10, b = 10Output: a = 10, b = 10Table of ContentUsing Arithmetic OperatorsUsing Bitwise XORBuilt-in SwapUsing Arithmeti 6 min read Russian Peasant (Multiply two numbers using bitwise operators)Given two integers a and b, the task is to multiply them without using the multiplication operator. Instead of that, use the Russian Peasant Algorithm.Examples:Input: a = 2, b = 5Output: 10Explanation: Product of 2 and 5 is 10.Input: a = 6, b = 9Output: 54Explanation: Product of 6 and 9 is 54.Input: 4 min read Article Tags : Bit Magic DSA Practice Tags : Bit Magic Like