tag

#binary

5 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 927: Three Equal Parts

Problem Restatement We are given an array arr containing only 0 s and 1 s. We need to split it into three non-empty parts so that all three parts represent the same binary value. Return two indices [i, j] such that: arr[0] ... arr[i] first part arr[i + 1] ... arr[j - 1] second part arr[j] ... arr[n - 1] third part The split must satisfy: i + 1 <...
leetcode array binary greedy May 11, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 67: Add Binary

Problem Restatement We are given two binary strings, a and b . Each string contains only characters "0" and "1" . We need to return their sum as a binary string. The official constraints are 1 <= a.length, b.length <= 10^4 , both strings contain only binary digits, and neither string has leading zeroes except the string "0" itself. Input and Output Item Meaning Input Two binary strings a and...
leetcode string math simulation binary May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 231: Power of Two

Problem Restatement We are given an integer n . We need to determine whether n is a power of two. That means we must check whether there exists an integer x such that: $$ n = 2^x $$ where: x >= 0 Examples of powers of two: 1 = 2^0 2 = 2^1 4 = 2^2 8 = 2^3 16 = 2^4 Examples that are not powers of two: 3...
leetcode math bit-manipulation binary May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 476: Number Complement

Problem Restatement We are given a positive integer num . We need to flip every bit in its binary representation: Bit After flip 0 1 1 0 Then we return the decimal value of the flipped binary number. For example, 5 in binary is: 101 After flipping every bit: 010 010 in binary is 2 , so the answer is 2 . The problem uses the normal binary representation without...
leetcode bit-manipulation binary mask May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 201: Bitwise AND of Numbers Range

Problem Restatement We are given two integers left and right . They define an inclusive range: [left, left + 1, left + 2, ..., right] We need to return the bitwise AND of every number in that range. The official statement says: given two integers left and right representing the range [left, right] , return the bitwise AND of all numbers in this range, inclusive. The constraints are 0 <=...
leetcode bit-manipulation binary Medium May 10, 2026