concatenation-of-consecutive-binary-numbers

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an integer <code>n</code>, return the decimal value of the binary string formed by concatenating the binary representations of <code>1</code> to <code>n</code> in order, modulo <code>109 + 7</code>.

&nbsp;
Example 1:

<pre>
Input: n = 1
Output: 1
Explanation: &quot;1&quot; in binary corresponds to the decimal value 1. 
</pre>

Example 2:

<pre>
Input: n = 3
Output: 27
Explanation: In binary, 1, 2, and 3 corresponds to &quot;1&quot;, &quot;10&quot;, and &quot;11&quot;.
After concatenating them, we have &quot;11011&quot;, which corresponds to the decimal value 27.
</pre>

Example 3:

<pre>
Input: n = 12
Output: 505379714
Explanation: The concatenation results in &quot;1101110010111011110001001101010111100&quot;.
The decimal value of that is 118505380540.
After modulo 109 + 7, the result is 505379714.
</pre>

&nbsp;
Constraints:

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