Added Happy Number

LeetcodeProblems/Algorithms/Happy_Number.js

@@ -0,0 +1,49 @@
+/**
+Happy Number
+https://leetcode.com/problems/happy-number/
+
+Write an algorithm to determine if a number n is happy.
+
+A happy number is a number defined by the following process:
+
+    Starting with any positive integer, replace the number by the sum of the squares of its digits.
+    Repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1.
+    Those numbers for which this process ends in 1 are happy.
+
+Return true if n is a happy number, and false if not.
+
+Example 1:
+Input: n = 19
+Output: true
+Explanation:
+1^2 + 9^2 = 82
+8^2 + 2^2 = 68
+6^2 + 8^2 = 100
+1^2 + 0^2 + 0^2 = 1
+
+Example 2:
+Input: n = 2
+Output: false
+
+
+ */
+
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var isHappy = function(n) {
+    return checkHappyNumber(n);
+};
+
+function checkHappyNumber(n){
+    strNumber = n.toString();
+    splitNumber = strNumber.split("");
+    if(splitNumber.length <= 1){
+      return (n <= 1)? true:false;
+    }
+    const digit = splitNumber.reduce((a,b)=> parseInt(a) + Math.pow(parseInt(b),2),0);
+    return checkHappyNumber(digit)
+}
+
+module.exports.isHappy = isHappy;

LeetcodeProblems/Algorithms/Shuffle_String.js

@@ -0,0 +1,33 @@
+/**
+ You are given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string.
+
+Return the shuffled string.
+
+
+
+Example 1:
+
+Input: s = "codeleet", indices = [4,5,6,7,0,2,1,3]
+Output: "leetcode"
+Explanation: As shown, "codeleet" becomes "leetcode" after shuffling.
+
+Example 2:
+
+Input: s = "abc", indices = [0,1,2]
+Output: "abc"
+Explanation: After shuffling, each character remains in its position.
+
+ */
+
+/**
+ * @param {string} s
+ * @param {number[]} indices
+ * @return {string}
+ */
+var restoreString = function(s, indices) {
+    let arrshuffle = [];
+    indices.forEach((sindex, index) => arrshuffle[sindex] = s.charAt(index))
+    return arrshuffle.join('')
+};
+
+module.exports.restoreString = restoreString;

LeetcodeProblemsTests/Algorithms/Happy_Number_Test.js

@@ -0,0 +1,9 @@
+const assert = require('assert');
+const isHappy = require('../../LeetcodeProblems/Algorithms/Happy_Number').isHappy;
+
+var test = function () {
+  assert.equal(isHappy(19),true);
+  assert.equal(isHappy(2),false);
+}
+
+module.exports.test = test;

LeetcodeProblemsTests/Algorithms/Shuffle_String_Test.js

@@ -0,0 +1,10 @@
+const assert = require('assert');
+const restoreString = require('../../LeetcodeProblems/Algorithms/Shuffle_String').restoreString;
+
+var test = function () {
+  assert.equal(restoreString('codeleet',[4,5,6,7,0,2,1,3]),'leetcode');
+  assert.equal(restoreString('abc',[0,1,2]),'abc');
+  assert.equal(restoreString('hacktoberfest',[9,10,11,12,4,5,6,7,8,0,1,2,3]),'festtoberhack');
+}
+
+module.exports.test = test;

README.md

@@ -85,6 +85,8 @@ To run a specific problem in your console run  `node <problem_file_path>` (e.g.
 | [Permutations With Duplicates ](/LeetcodeProblems/Algorithms/Permutations_With_Duplicates.js)                   |        | |
 | [Deletion Distance](/LeetcodeProblems/Algorithms/Deletion_Distance.js)                                          |        | |
 | [Award Budget Cuts](/LeetcodeProblems/Algorithms/Award_Budget_Cuts.js)                                          |        | |
+| [Happy Number](https://leetcode.com/problems/happy-number/)                                                     | Easy   | https://leetcode.com/problems/happy-number/ |
+| [Shuffle String](https://leetcode.com/problems/shuffle-string/)                                                 | Easy   | https://leetcode.com/problems/shuffle-string/ |
 
 ### Sorting Algorithms
 | Algoritmhs |