exactly-one-consecutive-set-bits-pair

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>.

Return <code>true</code> if its binary representation contains exactly one adjacent&nbsp;pair of&nbsp;set bits, and <code>false</code> otherwise.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 6

Output: true

Explanation:

<ul>
	<li>Binary representation of 6 is <code>110</code>.</li>
	<li>There is exactly&nbsp;one adjacent pair of set bits (<code>&quot;11&quot;</code>). Thus, the answer is <code>true</code>​​​​​​​.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: n = 5

Output: false

Explanation:

<ul>
	<li>Binary representation of 5 is <code>101</code>.</li>
	<li>There is no&nbsp;adjacent pair of set bits. Thus, the answer is <code>false</code>​​​​​​​.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= n &lt;= 105</code></li>
</ul>

Biweekly Contest 184

biweekly-contest-184

consecutiveSetBits

Mid Level

Exactly One Consecutive Set Bits Pair

Bit Manipulation

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs