Bit Manipulation - Let's Talk Algorithms

Single Number Leetcode

Problem Statement Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: Input: [2,2,1] Output: 1

Frequently Asked Questions

Calculate the Hamming Distance between two Integers

Problem Statement Given two integers, calculate the hamming distance between them. Solution Explanation Hamming Distance between integers is defined as the number of indexes where the two bits differ. For example, given integers x = 2 and y=5, the hamming distance between them is,

Interview Questions

Add Binary Leetcode

Problem Statement Given two binary strings, return their sum (also a binary string). For example,a = "11", b = "1" Return "100". Solution Explanation The question is very straightforward where you add two binary values in string form. Carry

Subscribe to Let's Talk Algorithms