Add next power of two algorithm

Bit-Manipulation/NextPowerOfTwo.js

@@ -0,0 +1,18 @@
+/**
+ *
+ *  This script will find next power of two
+ *    of given number.
+ *  More about it:
+ *   https://www.techiedelight.com/round-next-highest-power-2/
+ *
+ */
+
+export const nextPowerOfTwo = (n) => {
+  if (n > 0 && (n & (n - 1)) === 0) return n
+  let result = 1
+  while (n > 0) {
+    result = result << 1
+    n = n >> 1
+  }
+  return result
+}

Bit-Manipulation/test/IsPowerOfTwo.test.js

@@ -1,4 +1,4 @@
-import {IsPowerOfTwo} from '../IsPowerOfTwo'
+import { IsPowerOfTwo } from '../IsPowerOfTwo'
 
 test('Check if 0 is a power of 2 or not:', () => {
   const res = IsPowerOfTwo(0)

Bit-Manipulation/test/NextPowerOfTwo.test.js

@@ -0,0 +1,18 @@
+import { nextPowerOfTwo } from '../NextPowerOfTwo'
+
+describe('NextPowerOfTwo', () => {
+  it.each`
+    input    | result
+    ${0}     | ${1}
+    ${1}     | ${1}
+    ${2}     | ${2}
+    ${3}     | ${4}
+    ${5}     | ${8}
+    ${125}   | ${128}
+    ${1024}  | ${1024}
+    ${10000} | ${16384}
+  `('returns $result when is given $input', ({ input, result }) => {
+    const res = nextPowerOfTwo(input)
+    expect(res).toBe(result)
+  })
+})

Conversions/TemperatureConversion.js

@@ -40,8 +40,7 @@ const fahrenheitToRankine = (fahrenheit) => {
 const kelvinToCelsius = (kelvin) => {
   // Wikipedia reference: https://en.wikipedia.org/wiki/Kelvin
   // Wikipedia reference: https://en.wikipedia.org/wiki/Celsius
-  return Math.round((kelvin) - 273.15)
-
+  return Math.round((kelvin) - 273.15)
 }
 
 const kelvinToFahrenheit = (kelvin) => {
@@ -53,7 +52,7 @@ const kelvinToFahrenheit = (kelvin) => {
 const kelvinToRankine = (kelvin) => {
   // Wikipedia reference: https://en.wikipedia.org/wiki/Kelvin
   // Wikipedia reference: https://en.wikipedia.org/wiki/Rankine_scale
-  return Math.round(( (kelvin) * 9 / 5))
+  return Math.round(((kelvin) * 9 / 5))
 }
 
 const rankineToCelsius = (rankine) => {