Complement of Base 10 Integer The complement of an integer is the integer you get when you flip all the 0’s to 1’s and all the 1’s to 0’s in its binary representation. For example, The integer 5...

Find All Possible Stable Binary Arrays I You are given 3 positive integers zero, one, and limit. A binary array arr is called stable if: The number of occurrences of 0 in arr is **exactly **zer...

Find Unique Binary String Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length *n that does not appear in nums. If there are multip...

Minimum Number of Flips to Make the Binary String Alternating You are given a binary string s. You are allowed to perform two types of operations on the string in any sequence: **Type-1: Remove*...

Check if Binary String Has at Most One Segment of Ones Given a binary string s ​​​​​without leading zeros, return true​​​ if *s contains at most one contiguous segment of ones*. Otherwise, return...

Minimum Changes To Make Alternating Binary String You are given a string s consisting only of the characters ‘0’ and ‘1’. In one operation, you can change any ‘0’ to ‘1’ or vice versa. The strin...

Special Positions in a Binary Matrix Given an m x n binary matrix mat, return the number of special positions in *mat.* A position (i, j) is called special if mat[i][j] == 1 and all other elemen...

Find Kth Bit in Nth Binary String Given two positive integers n and k, the binary string Sn is formed as follows: S1 = "0" Si = Si - 1 + "1" + reverse(invert(Si - 1)) for i > 1 Where + deno...

Minimum Swaps to Arrange a Binary Grid Given an n x n binary grid, in one step you can choose two adjacent rows of the grid and swap them. A grid is said to be valid if all the cells above the m...

Concatenation of Consecutive Binary Numbers Given an integer n, return the decimal value of the binary string formed by concatenating the binary representations of *1 to n in order, *modulo **109...