How should I practice Minimum Operations to Make Binary Palindromic?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google online assessment problems in FastPrep.

Is Minimum Operations to Make Binary Palindromic associated with Google?

FastPrep tags this as a Google coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Math

Minimum Operations to Make Binary Palindromic

Learn this problem

● EasyGoogleINTERNOA

See Google hiring insights

Problem statement

You are given a number N (0<=N<=2*1e9) and you can do the following operation any number of times including zero. In one operation you can increase or decrease the number by 1. Your task is to find the minimum number of operations to make the binary form of the N palindromic.

Function

minOperationsToMakeBinaryPalindromic(N: int) → int

Examples

Example 1

N = 6return = 1

You need to decrease N by 1 to make it 5 as binary representation of 5 is Palindromic (101) or you can increase N by 1 to make it 7 as its binary is also palindromic (111).

Constraints

0 <= N <= 2 * 10⁹

Problem statement

Function

Examples

Example 1

Constraints

More Google problems