This file contains 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
function boo(bool) { | |
// What is the new fad diet for ghost developers? The Boolean. | |
if (typeof(bool) === 'boolean') { | |
var isBoolean = true; | |
} else { | |
isBoolean = false; | |
} | |
return isBoolean; | |
} |
This file contains 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
function fearNotLetter(str) { | |
var missing = ''; | |
var isMissing = false; | |
for (var i = 0; i < str.length-1; i++) { | |
if (str.charCodeAt(i+1) - str.charCodeAt(i) !== 1 && !isMissing) { | |
missing = String.fromCharCode(str.charCodeAt(i)+1); | |
isMissing = true; | |
} else if (!isMissing) { | |
missing = undefined; | |
} |
This file contains 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
function pair(str) { | |
var dnaPair = []; | |
var result = []; | |
str = str.split(''); | |
for (var i in str) { | |
if (str[i] === 'A') { | |
dnaPair.push('A'); | |
dnaPair.push('T'); | |
} else if (str[i] === 'T') { | |
dnaPair.push('T'); |
This file contains 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
function translate(str) { | |
var vowel = ['a', 'e', 'i', 'o', 'u']; | |
var stop = false; | |
var numberOfConsonant = 0; | |
str = str.split(''); | |
length = str.length; | |
strNew = str; | |
for (var i = 0; i < length; i++) { | |
if (vowel.indexOf(str[0]) !== -1 && !stop){ | |
strNew.push('way'); |
This file contains 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
function replace(str, before, after) { | |
var newStr = str.replace(before, after); | |
if (before[0] === before[0].toUpperCase()) { | |
var afterArray = after.split(''); | |
afterArray.splice(0, 1, after[0].toUpperCase()); | |
var newAfter = afterArray.join(''); | |
console.log(newAfter); | |
newStr = str.replace(before, newAfter); |
This file contains 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
function convert(num) { | |
//I V X L C D M | |
var roman = ''; | |
var counter = num; | |
while (counter !== 0) { | |
console.log(counter); | |
if (counter >= 1000) { | |
for (var i = 0; i < Math.floor(counter/1000); i++) { |
This file contains 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
function diff(arr1, arr2) { | |
function getDiff(arr1, arr2) { | |
var newArr = []; | |
for (var i = 0; i < arr2.length; i++) { | |
if (arr1.indexOf(arr2[i]) === -1) { | |
newArr.push(arr2[i]); | |
} | |
} | |
return newArr; |
This file contains 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
/*function sumAll(arr) { | |
function getMaxOfArray(numArray) { | |
return Math.max.apply(null, numArray); | |
} | |
function getMinOfArray(numArray) { | |
return Math.min.apply(null, numArray); | |
} | |
var max = getMaxOfArray(arr); | |
var min = getMinOfArray(arr); | |
var n = max - min +1; //quantity of numbers to be added. |
This file contains 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
function where(arr, num) { | |
newArr = arr.sort(); | |
finalArr = []; | |
for (var i = 0; i < newArr.length; i++) { | |
if (num > newArr[i] && num < newArr[i+1]) { | |
finalArr.push(newArr[i]); | |
finalArr.push(num); | |
} else { | |
finalArr.push(newArr[i]); | |
} |
This file contains 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
function destroyer(arr) { | |
var args = Array.prototype.slice.apply(arguments).slice(1); | |
for (var i in arr) { | |
for (var j in args) { | |
if (arr[i] === args[j]) { | |
arr.splice(i, 1); | |
} | |
} | |
} | |
return arr; |
NewerOlder