Given a positive integer, write a function to find if it is

Given a positive integer, write a function to find if it is

a power of two or not.

**Naive solution**

In naive solution we just keep dividing the number by two

unless the number becomes`1` and every time we do so we

check that remainder after division is always`0`. Otherwise

the number can't be a power of two.

unless the number becomes`1` and every time we do so, we

check that remainder after division is always`0`. Otherwise, the number can't be a power of two.

**Bitwise solution**

So after checking that the number is greater than zero,

we can use a bitwise hack to test that one and only one

So after checking that the number is greater than zero,

we can use a bitwise hack to test that one and only one

bit is set.

[_Русский_](README.ru-RU.md),

[_日本語_](README.ja-JP.md),

[_Português_](README.pt-BR.md),

[_한국어_](README.ko-KR.md)

In computer science, a**linked list** is a linear collection

of data elements, in which linear order is not given by

their physical placement in memory. Instead, each

element points to the next. It is a data structure

consisting of a group of nodes which together represent

a sequence. Under the simplest form, each node is

composed of data and a reference (in other words,

[_한국어_](README.ko-KR.md),

[_Español_](README.es-ES.md),

In computer science, a**linked list** is a linear collection

of data elements, in which linear order is not given by

their physical placement in memory. Instead, each

element points to the next. It is a data structure

consisting of a group of nodes which together represent

a sequence. Under the simplest form, each node is

composed of data and a reference (in other words,

a link) to the next node in the sequence. This structure

allows for efficient insertion or removal of elements

from any position in the sequence during iteration.

More complex variants add additional links, allowing

efficient insertion or removal from arbitrary element

references. A drawback of linked lists is that access

time is linear (and difficult to pipeline). Faster

access, such as random access, is not feasible. Arrays

allows for efficient insertion or removal of elements

from any position in the sequence during iteration.

More complex variants add additional links, allowing

efficient insertion or removal from arbitrary element

references. A drawback of linked lists is that access

time is linear (and difficult to pipeline). Faster

access, such as random access, is not feasible. Arrays

have better cache locality as compared to linked lists.