Week2 solutions

01-js/easy/anagram.js

@@ -4,8 +4,30 @@
   - A word, phrase, or name formed by rearranging the letters of another, such as spar, formed from rasp.
 */
 
+
+ // ALGO: If string1 and string2 are anagrams then they both should equal in the length and have same set of letters and SPACE as well
+// step1: iterate through each character of string1 and check if they are present in the string 2 
+// if the letter is found in the string 2, then we move on to the next letter
+//
+// r a s p     s p a r
+// 0 1 2 3     0 1 2 3
+  // Normalize: lowercase and remove spaces and special characters
+
+  // REGEX: Regular Expressions uses a sequence of charcaters to define a search pattern. But don't use here, just split the strings, sort and join them and compare both of the strings
+
+
 function isAnagram(str1, str2) {
 
-}
+
+   const normalize =(str) =>{
+
+   return str.toLowerCase().split("").sort().join("")
+
+   }
+
+  if (normalize(str1)== normalize(str2)) return true
+  else return false
+
+  }
 
 module.exports = isAnagram;

01-js/easy/findLargestElement.js

@@ -6,7 +6,14 @@
 */
 
 function findLargestElement(numbers) {
-
+    let MAX= numbers[0]
+    for (let i = 0; i < numbers.length; i++) {
+        if(numbers[i]>MAX) {
+            MAX= numbers[i];
+        }
+
+    }
+ return MAX
 }
 
 module.exports = findLargestElement;

01-js/medium/countVowels.js

@@ -1,12 +1,25 @@
 /*
-  Implement a function `countVowels` that takes a string as an argument and returns the number of vowels in the string.
-  Note: Consider both uppercase and lowercase vowels ('a', 'e', 'i', 'o', 'u').
+  Implement a function `countVowels` that takes a string as an argument and
+  returns the number of vowels in the string. Note: Consider both uppercase and
+  lowercase vowels ('a', 'e', 'i', 'o', 'u').
 
   Once you've implemented the logic, test your code by running
 */
 
+
 function countVowels(str) {
-    // Your code here
+  let countOfVowels = 0;
+  let cleaned = str.toLowerCase().replace(/[^a-z0-9]/g, '').split('')
+  for (let i = 0; i < cleaned.length; i++) {
+    if (cleaned[i] == 'a' || cleaned[i] == 'e' || cleaned[i] == 'i' ||
+        cleaned[i] == 'o' || cleaned[i] == 'u') {
+
+      countOfVowels++
+    }
+    else continue
+  }
+  return countOfVowels
 }
 
+
 module.exports = countVowels;

01-js/medium/palindrome.js

@@ -4,7 +4,22 @@
 */
 
 function isPalindrome(str) {
-  return true;
+  let check =0;
+  let cleaned = str.toLowerCase().replace(/[^a-z0-9]/g,"").split("").join()
+  let n =cleaned.length
+ for(let i=0; i<n; i++){
+   if(cleaned[i]!= cleaned[n-1-i]){
+    check=1;
+    break;
+   }
+   else continue;
+ }
+
+if(check==1) return false;
+ else return true;
+
+
+
 }
 
 module.exports = isPalindrome;

01-js/medium/times.js

@@ -9,5 +9,14 @@ There is no automated test for this one, this is more for you to understand time
 */
 
 function calculateTime(n) {
-    return 0.01;
-}
+   let sum=0;
+   let start = new Date()
+   for(let i=0; i<=n;i++){
+    sum+=i;
+   }
+ let end = new Date();
+ let elapsed = end-start;
+ return elapsed
+}
+
+console.log(calculateTime(10000));