Merge pull request #125 from MannyP31/manny

Added some more js solutions.

Author: smv1999

Hackerrank solutions/10 days of js/Arrays.js

@@ -0,0 +1,55 @@
+'use strict';
+
+process.stdin.resume();
+process.stdin.setEncoding('utf-8');
+
+let inputString = '';
+let currentLine = 0;
+
+process.stdin.on('data', inputStdin => {
+    inputString += inputStdin;
+});
+
+process.stdin.on('end', _ => {
+    inputString = inputString.trim().split('\n').map(string => {
+        return string.trim();
+    });
+    
+    main();    
+});
+
+function readLine() {
+    return inputString[currentLine++];
+}
+
+/**
+*   Return the second largest number in the array.
+*   @param {Number[]} nums - An array of numbers.
+*   @return {Number} The second largest number in the array.
+**/
+function getSecondLargest(nums) {
+    // Complete the function
+    let first=nums[0];
+    let second=-1;
+    for(let i=0;i<nums.length;i++)
+{
+       if(nums[i]>first)
+       {
+           second=first;
+           first=nums[i];
+       }
+       if(nums[i]>second && nums[i]<first)
+       {
+           second=nums[i];
+       }
+   }
+   return second;
+}
+
+
+function main() {
+    const n = +(readLine());
+    const nums = readLine().split(' ').map(Number);
+    
+    console.log(getSecondLargest(nums));
+}

Hackerrank solutions/10 days of js/Classes.js

@@ -0,0 +1,13 @@
+/*
+ * Implement a Polygon class with the following properties:
+ * 1. A constructor that takes an array of integer side lengths.
+ * 2. A 'perimeter' method that returns the sum of the Polygon's side lengths.
+ */
+class Polygon{
+    constructor(sides){
+        this.sides=sides
+    }
+    perimeter(){
+        return this.sides.reduce(function add(a,b){ return a+b;})
+    }
+}

Hackerrank solutions/10 days of js/Conditional_statement_switch.js

@@ -0,0 +1,46 @@
+'use strict';
+
+process.stdin.resume();
+process.stdin.setEncoding('utf-8');
+
+let inputString = '';
+let currentLine = 0;
+
+process.stdin.on('data', inputStdin => {
+    inputString += inputStdin;
+});
+
+process.stdin.on('end', _ => {
+    inputString = inputString.trim().split('\n').map(string => {
+        return string.trim();
+    });
+    
+    main();    
+});
+
+function readLine() {
+    return inputString[currentLine++];
+}
+
+function getLetter(s) {
+    
+    switch(s.charAt(0))
+    {
+        case('a'||'e'||'i'||'o'||'u'):
+          return 'A'
+        case('b'||'c'||'d'||'f'||'g'):
+          return 'B'
+        case('h'||'j'||'k'||'l'||'m'):
+          return 'C'
+         case('z'||'n'||'p'||'q'||'r'||'s'||'t'||'v'||'w'||'x'||'y'):
+          return 'D'
+          
+    }
+}
+
+
+function main() {
+    const s = readLine();
+    
+    console.log(getLetter(s));
+}

Hackerrank solutions/10 days of js/Loops.js

@@ -0,0 +1,54 @@
+'use strict';
+
+process.stdin.resume();
+process.stdin.setEncoding('utf-8');
+
+let inputString = '';
+let currentLine = 0;
+
+process.stdin.on('data', inputStdin => {
+    inputString += inputStdin;
+});
+
+process.stdin.on('end', _ => {
+    inputString = inputString.trim().split('\n').map(string => {
+        return string.trim();
+    });
+    
+    main();    
+});
+
+function readLine() {
+    return inputString[currentLine++];
+}
+
+/*
+ * Complete the vowelsAndConsonants function.
+ * Print your output using 'console.log()'.
+ */
+function vowelsAndConsonants(s) {
+    //for vowels
+    for(let ind=0; ind<s.length; ind++){
+     if(s.charAt(ind).match(/[aeiou]/)){
+         console.log(s.charAt(ind));
+     }
+}
+//for consonants
+    
+    for(let ind=0; ind<s.length; ind++){
+     if(s.charAt(ind).match(/[^aeiou]/)){
+         console.log(s.charAt(ind));
+     }
+  }
+}
+ 
+
+
+
+
+
+function main() {
+    const s = readLine();
+    
+    vowelsAndConsonants(s);
+}