qwew

Author: Vitalii Telychko

euler_project/even_fibonacci_numbers.js

@@ -0,0 +1,23 @@
+/*
+Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
+
+1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
+
+By considering the terms in the Fibonacci sequence whose values do not exceed nth term, find the sum of the even-valued terms.
+*/
+
+
+// function fiboEvenSum(n) {
+//   var fib = [], i, j, sum = 0;
+//   fib[0] = 1;
+//   fib[1] = 2;
+//   for(i = 2; i <= n; i += 1) {
+//     fib[i] = fib[i - 2] + fib[i - 1];
+//   }
+//   for(j = 0; j < fib.length; j += 1) {
+//     if(fib[j] % 2 === 0) sum += fib[j];
+//   }
+//   return sum;
+// }
+//
+// fiboEvenSum(10);

euler_project/multiples_of_3_and_5.js

@@ -0,0 +1,16 @@
+/*
+
+If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
+Find the sum of all the multiples of 3 or 5 below the provided parameter value number.
+
+*/
+
+// function multiplesOf3and5(number) {
+//   var i, arr = [];
+//   for(i = 0; i < number; i += 1) {
+//     if(i % 3 === 0 || i % 5 === 0) arr.push(i);
+//   }
+//   return arr.reduce((a, b) => a + b);
+// }
+//
+// multiplesOf3and5(1000);

freecodecamp/basic/factorialize.js

@@ -3,4 +3,14 @@
 //     return num * factorialize(num-1);
 // }
 //
-// factorialize(5);
+// factorialize(5);
+
+// function factorialize(num) {
+//   var i, acc = 1;
+//   for(i = num; i > 0; i -= 1) {
+//     acc *= i;
+//   }
+//   return acc;
+// }
+//
+// console.log(factorialize(5));

freecodecamp/basic/sliceAndSplice.js

@@ -0,0 +1,11 @@
+// function frankenSplice(arr1, arr2, n) {
+//   // It's alive. It's alive!
+//   let localArray = arr2.slice();
+//   for (let i = 0; i < arr1.length; i++) {
+//     localArray.splice(n, 0, arr1[i]);
+//     n++;
+//   }
+//   return localArray;
+// }
+//
+// frankenSplice([1, 2, 3], [4, 5, 6], 1);

index.html

@@ -10,6 +10,6 @@
 
 <div id="content"></div>
 
-<script src="others/promise_setTimeOut.js"></script>
+<script src="euler_project/even_fibonacci_numbers.js"></script>
 </body>
 </html>

rosetta_code/100_doors.js

@@ -0,0 +1,28 @@
+/*
+
+There are 100 doors in a row that are all initially closed. You make 100 passes by the doors.
+The first time through, visit every door and 'toggle' the door (if the door is closed, open it; if it is open, close it).
+The second time, only visit every 2nd door (i.e., door #2, #4, #6, ...) and toggle it.
+The third time, visit every 3rd door (i.e., door #3, #6, #9, ...), etc., until you only visit the 100th door.
+Implement a function to determine the state of the doors after the last pass.
+Return the final result in an array, with only the door number included in the array if it is open.
+
+*/
+
+// var doors = [];
+//
+// function getFinalOpenedDoors(numDoors, step) {
+//   var i, j;
+//   if(step > numDoors) {
+//     return doors.reduce((acc, curr, index) => {
+//       curr && acc.push(index);
+//       return acc;
+//     }, []);
+//   }
+//
+//   if(step === 1) for(i = 0; i < numDoors + 1; i += 1) doors.push(true);
+//   else for(j = 0; j <= doors.length; j += step) doors[j] = !doors[j];
+//   return getFinalOpenedDoors(numDoors, step + 1);
+// }
+//
+// getFinalOpenedDoors(100, 1);

rosetta_code/24_game.js

@@ -0,0 +1,50 @@
+/*
+Implement a function that takes a string of four digits as its argument, w
+ith each digit from 1 ──► 9 (inclusive) with repetitions allowed,
+and returns an arithmetic expression that evaluates to the number 24.
+If no such solution exists, return "no solution exists."
+
+Rules:
+
+Only the following operators/functions are allowed: multiplication, division, addition, subtraction
+
+Division should use floating point or rational arithmetic, etc, to preserve remainders.
+
+Forming multiple digit numbers from the supplied digits is disallowed. (So an answer of 12+12 when given 1, 2, 2, and 1 is wrong).
+
+The order of the digits when given does not have to be preserved.
+
+Example inputs:
+
+solve24("4878");
+
+solve24("1234");
+
+solve24("6789");
+
+solve24("1127");
+
+Example outputs (strings):
+
+(7-8/8)*4
+
+3*1*4*2
+
+(6*8)/(9-7)
+
+(1+7)*(2+1)
+
+*/
+
+
+function solve24(numStr) {
+  var array = numStr.split('').map(Number), tf = 24, i;
+  for(i = 0; i < array.length; i += 1) {
+    if(array[i]) {
+      array.splice(i, 1);
+    }
+  }
+  console.log(array);
+}
+
+solve24('4878');