Last active
September 10, 2022 08:31
-
-
Save NhanKhangg98/97002df85869be4e45d6f9c1f6c3a9cf to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // 1 | |
| var fizzBuzz = function(n) { | |
| let output = []; | |
| for (let i = 1; i <= n; i++) { | |
| let temp = ""; | |
| if (i % 3 == 0 && i % 5 == 0) temp += 'FizzBuzz'; | |
| else if (i % 3 == 0) temp += 'Fizz'; | |
| else if (i % 5 == 0) temp += 'Buzz'; | |
| else temp += i; | |
| output.push(temp) | |
| } | |
| return output; | |
| }; | |
| // 2 | |
| var halvesAreAlike = function(s) { | |
| let vowels = 'aeiouAEIOU'; | |
| let counter = 0; | |
| for(let i = 0; i < s.length ; i++){ | |
| if(vowels.includes(s[i])){ | |
| if (i < s.length/2) counter += 1; | |
| else counter -= 1; | |
| } | |
| } | |
| return counter === 0; | |
| }; | |
| let a = 'baok' | |
| var b = halvesAreAlike(a); | |
| console.log(b) | |
| //3 | |
| var arrayStringsAreEqual = function(word1, word2) { | |
| let temp1 = ""; | |
| let temp2 = ""; | |
| for (let i = 0; i < word1.length; i++) { | |
| temp1 += word1[i]; | |
| } | |
| for (let i = 0; i < word2.length; i++){ | |
| temp2 += word2[i]; | |
| } | |
| return temp1 === temp2; | |
| }; | |
| // 4 | |
| var numIdenticalPairs = function(nums) { | |
| let counter = 0; | |
| for (let i = 0; i < nums.length; i++) { | |
| for (let j = 0; j < nums.length; j++) { | |
| if (nums[i] == nums[j] && i < j){ | |
| counter++; | |
| } | |
| } | |
| } | |
| return counter; | |
| }; | |
| // 5 | |
| var runningSum = function(nums) { | |
| var arr = []; | |
| var sum = 0; | |
| for (var i = 0; i < nums.length; i++) { | |
| sum += nums[i]; | |
| arr.push(sum); | |
| } | |
| return arr; | |
| }; | |
| console.log(runningSum([1,2,3, 4])) | |
| // 6 | |
| var shuffle = function(nums, n) { | |
| let arrxy = []; | |
| for (let i = 0; i < n; i++) { | |
| arrxy.push(nums[i]); | |
| arrxy.push(nums[i+n]); | |
| } | |
| return arrxy; | |
| }; | |
| console.log(shuffle([2,5,1,3,4,7], 3))\ | |
| // 7 | |
| var maxProduct = function(nums) { | |
| let max = 0; | |
| for (let i = 0; i < nums.length; i++) { | |
| for (let j = 0; j < nums.length - 1; j++){ | |
| if(max < (nums[i]-1)*(nums[j]-1) && i !== j){ | |
| max = (nums[i]-1)*(nums[j]-1); | |
| } | |
| } | |
| } | |
| return max; | |
| }; | |
| // 8 | |
| var kidsWithCandies = function(candies, extraCandies) { | |
| let max = 0; | |
| let arr = []; | |
| let temp= ""; | |
| for (let i = 0; i < candies.length; i++) { | |
| if(max < extraCandies + candies[i]) { | |
| arr[i]= "false"; | |
| }else arr[i] = "true"; | |
| arr.push(temp); | |
| } | |
| return arr; | |
| }; | |
| //9 | |
| var smallerNumbersThanCurrent = function(nums) { | |
| var arr =[]; | |
| for(var j = 0; j < nums.length;j++){ | |
| var counter = 0 | |
| for (var i = 0; i < nums.length; i++){ | |
| if (nums[j] > nums[i]){ | |
| counter++ | |
| } | |
| } | |
| arr.push(counter) | |
| } | |
| return arr | |
| }; | |
| // 11 | |
| var arraySign = function(nums) { | |
| let result = 1; | |
| for (let i = 0; i < nums.length; i++) { | |
| if (nums[i] == 0) return 0; | |
| if (nums[i] < 0) result *= -1; | |
| } | |
| return result; | |
| }; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
https://gist.github.com/NhanKhangg98/97002df85869be4e45d6f9c1f6c3a9cf#file-gistfile1-txt-L6
có thật sự phải cần tạo ra 1 biến
tempmới ?