diff --git a/Bit-Manipulation/BinaryCountSetBits.js b/Bit-Manipulation/BinaryCountSetBits.js
index b879f3bd67..b959caf062 100644
--- a/Bit-Manipulation/BinaryCountSetBits.js
+++ b/Bit-Manipulation/BinaryCountSetBits.js
@@ -16,7 +16,7 @@ function BinaryCountSetBits(a) {
let count = 0
while (a) {
- a &= (a - 1)
+ a &= a - 1
count++
}
diff --git a/Maths/AutomorphicNumber.js b/Maths/AutomorphicNumber.js
index d1b6608316..ba008271fc 100644
--- a/Maths/AutomorphicNumber.js
+++ b/Maths/AutomorphicNumber.js
@@ -35,6 +35,6 @@ export const isAutomorphic = (n) => {
n = Math.floor(n / 10)
n_sq = Math.floor(n_sq / 10)
}
-
+
return true
}
diff --git a/Maths/test/AutomorphicNumber.test.js b/Maths/test/AutomorphicNumber.test.js
index 19b963388c..57f40d27ee 100644
--- a/Maths/test/AutomorphicNumber.test.js
+++ b/Maths/test/AutomorphicNumber.test.js
@@ -9,19 +9,19 @@ describe('AutomorphicNumber', () => {
})
test.each([
- { n: -3 , expected: false },
- { n: -25 , expected: false },
+ { n: -3, expected: false },
+ { n: -25, expected: false }
])('should return false when n is negetive', ({ n, expected }) => {
expect(isAutomorphic(n)).toBe(false)
})
test.each([
- { n: 7 , expected: false },
- { n: 83 , expected: false },
- { n: 0 , expected: true },
- { n: 1 , expected: true },
- { n: 376 , expected: true },
- { n: 90625 , expected: true },
+ { n: 7, expected: false },
+ { n: 83, expected: false },
+ { n: 0, expected: true },
+ { n: 1, expected: true },
+ { n: 376, expected: true },
+ { n: 90625, expected: true }
])('should return $expected when n is $n', ({ n, expected }) => {
expect(isAutomorphic(n)).toBe(expected)
})
diff --git a/Project-Euler/Problem006.js b/Project-Euler/Problem006.js
index 474de2ae96..804b165558 100644
--- a/Project-Euler/Problem006.js
+++ b/Project-Euler/Problem006.js
@@ -1,8 +1,8 @@
// https://projecteuler.net/problem=6
export const squareDifference = (num = 100) => {
- let sumOfSquares = (num)*(num+1)*(2*num+1)/6
- let sums = (num*(num+1))/2
-
+ let sumOfSquares = (num * (num + 1) * (2 * num + 1)) / 6
+ let sums = (num * (num + 1)) / 2
+
return sums ** 2 - sumOfSquares // difference of square of the total sum and sum of squares
}
diff --git a/Project-Euler/test/Problem004.test.js b/Project-Euler/test/Problem004.test.js
new file mode 100644
index 0000000000..cd6a55ac98
--- /dev/null
+++ b/Project-Euler/test/Problem004.test.js
@@ -0,0 +1,11 @@
+import { largestPalindromic } from '../Problem004.js'
+
+describe('Largest Palindromic Number', () => {
+ test('if digit is 2', () => {
+ expect(largestPalindromic(2)).toBe(9009)
+ })
+ // Project Euler Condition Check
+ test('if digit is 3', () => {
+ expect(largestPalindromic(3)).toBe(906609)
+ })
+})
diff --git a/Recursive/test/BinaryEquivalent.test.js b/Recursive/test/BinaryEquivalent.test.js
index b79a455eed..ddabb7d477 100644
--- a/Recursive/test/BinaryEquivalent.test.js
+++ b/Recursive/test/BinaryEquivalent.test.js
@@ -1,29 +1,29 @@
-import { binaryEquivalent } from "../BinaryEquivalent";
+import { binaryEquivalent } from '../BinaryEquivalent'
const tests = [
- {
- test: 2,
- expectedValue: "10"
- },
- {
- test: 0,
- expectedValue: "0"
- },
- {
- test: 543,
- expectedValue: "1000011111"
- },
- {
- test: 4697621023,
- expectedValue: "100011000000000000000001000011111"
- }
+ {
+ test: 2,
+ expectedValue: '10'
+ },
+ {
+ test: 0,
+ expectedValue: '0'
+ },
+ {
+ test: 543,
+ expectedValue: '1000011111'
+ },
+ {
+ test: 4697621023,
+ expectedValue: '100011000000000000000001000011111'
+ }
]
-describe("Binary Equivalent", () => {
- test.each(tests)(
- "of $test should be $expectedValue",
- ({test, expectedValue}) => {
- expect(binaryEquivalent(test)).toBe(expectedValue);
- }
- )
+describe('Binary Equivalent', () => {
+ test.each(tests)(
+ 'of $test should be $expectedValue',
+ ({ test, expectedValue }) => {
+ expect(binaryEquivalent(test)).toBe(expectedValue)
+ }
+ )
})
diff --git a/Search/InterpolationSearch.js b/Search/InterpolationSearch.js
index e6deae496f..93f3b78b0e 100644
--- a/Search/InterpolationSearch.js
+++ b/Search/InterpolationSearch.js
@@ -36,4 +36,4 @@ export function interpolationSearch(arr, key) {
}
return -1
-}
\ No newline at end of file
+}
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy