Added 4 more implementation algorithms

Author: gabrielgiordan

README.md

@@ -62,6 +62,11 @@ HackerRank challenges solutions in *JavaScript* / *Node.js* by [Gabriel Giordano
 - [Beautiful Days at the Movies](algorithms/implementation/beautiful-days-at-the-movies.js)
 - [Viral Advertising](algorithms/implementation/strange-advertising.js)
 - [Save the Prisoner!](algorithms/implementation/save-the-prisoner.js)
+- [Circular Array Rotation](algorithms/implementation/circular-array-rotation.js)
+- [Sequence Equation](algorithms/implementation/permutation-equation.js)
+- [Jumping on the Clouds: Revisited](algorithms/implementation/jumping-on-the-clouds-revisited.js)
+- [Find Digits](algorithms/implementation/find-digits.js)
+
 
 ### Warmup
 - [Compare the Triplets](algorithms/warmup/compare-the-triplets.js)
@@ -71,4 +76,4 @@ HackerRank challenges solutions in *JavaScript* / *Node.js* by [Gabriel Giordano
 - [Staircase](algorithms/warmup/staircase.js)
 - [Mini-Max Sum](algorithms/warmup/mini-max-sum.js)
 - [Birthday Cake Candles](algorithms/warmup/birthday-cake-candles.js)
-- [Time Conversion](algorithms/warmup/time-conversion.js)
+- [Time Conversion](algorithms/warmup/time-conversion.js)

algorithms/implementation/circular-array-rotation.js

@@ -0,0 +1,13 @@
+function circularArrayRotation(a, k, queries) {
+
+  let r = []
+
+  for (let i = queries.length; i-- > 0;) {
+    r.unshift(a[(a.length - (k % a.length) + queries[i]) % a.length])
+  }
+
+  return r
+}
+
+console.log(circularArrayRotation([3,4,5], 2, [1,2])) // 5,3
+console.log(circularArrayRotation([1,2,3], 2, [0,1,2])) // 2,3,1

algorithms/implementation/find-digits.js

@@ -0,0 +1,15 @@
+function findDigits(n) {
+  let a = n.toString().split(''),
+      r = 0
+
+  for (let i = a.length; i-- > 0;) {
+    if (n % Number(a[i]) == 0)
+      ++r
+  }
+
+  return r
+}
+
+console.log(findDigits(111))
+console.log(findDigits(12))
+console.log(findDigits(1012))

algorithms/implementation/jumping-on-the-clouds-revisited.js

@@ -0,0 +1,14 @@
+function jumpingOnClouds(c, k) {
+
+  let e = 100
+
+  for (let i = c.length / k; i-- > 0;) {
+    e -= c[i * k] == 1 ? 3 : 1
+  }
+  
+  return e
+}
+
+console.log(jumpingOnClouds([0,0,1,0], 2)) // 96
+console.log(jumpingOnClouds([0,0,1,0,0,1,1,0], 2)) // 92
+console.log(jumpingOnClouds([1,1,1,0,1,1,0,0,0,0], 3)) // 94

algorithms/implementation/permutation-equation.js

@@ -0,0 +1,13 @@
+function permutationEquation(p) {
+  let r = []
+
+  for (let i = p.length + 1; i-- > 1;) {
+    r.unshift(p.indexOf(p.indexOf(i) + 1) + 1)
+  }
+
+  return r
+}
+
+console.log(permutationEquation([5,2,1,3,4])) // 4,2,5,1,3
+console.log(permutationEquation([2,3,1])) // 2,3,1
+console.log(permutationEquation([4,3,5,1,2])) // 1,3,5,4,2