fix: standard style problems

Project-Euler/Problem025.js

@@ -4,11 +4,11 @@
 * @see {@link https://projecteuler.net/problem=25}
 *
 * The Fibonacci sequence is defined by the recurrence relation:
-* 
+*
 * Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
-* 
+*
 * Hence the first 12 terms will be:
-* 
+*
 * F1 = 1
 * F2 = 1
 * F3 = 2
@@ -28,18 +28,18 @@
 
 // brute force method
 
-function fibonacciIndex(t = 1000) {
-  let digits = 10n**BigInt(t-1),
-      fib0 = BigInt(0),
-      fib1 = BigInt(1),
-      index = 1
-  while (fib1 < digits) {  // using this to compare number of digits instead of .toString() significantly improved run time
+function fibonacciIndex (t = 1000) {
+  const digits = 10n ** BigInt(t - 1)
+  let fib0 = BigInt(0)
+  let fib1 = BigInt(1)
+  let index = 1
+  while (fib1 < digits) { // using this to compare number of digits instead of .toString() significantly improved run time
     const tempfib = fib1
     fib1 = fib1 + fib0
     fib0 = tempfib
     index += 1
   }
-  return(index)
+  return (index)
 }
 
 export { fibonacciIndex }