These are my solutions to the programming challenges found on http://coderbyte.com/
My language of choice is Javascript
function FirstReverse(str) {
return str.split("").reverse().join("");
}
FirstReverse(readline());
function FirstFactorial(num) {
var product = 1;
for (var i = num; i > 0; i--) {
product *= i;
}
return product;
}
FirstFactorial(readline());
function LongestWord(sentence) {
sentence = sentence.replace(/[^a-zA-Z0-9]/g, "")
var words = sentence.split(" ");
var largestWord = "";
for (var i = 0; i < words.length; i++) {
if (words[i].length > largestWord.length) {
largestWord = words[i];
}
}
return largestWord;
}
LongestWord(readline());
function LetterChanges(str) {
var vowels = ["a", "e", "i", "o", "u"];
var stringAsArray = str.split("");
for (var i = 0; i < stringAsArray.length; i++) {
var pos = stringAsArray[i].charCodeAt(0);
if ((pos >= 97 && pos < 122) || (pos >= 65 && pos < 90)) {
stringAsArray[i] = String.fromCharCode(pos + 1);
} else if (pos == 122) {
stringAsArray[i] = String.fromCharCode(97);
} else if (pos == 90) {
stringAsArray[i] = String.fromCharCode(65);
}
if (vowels.indexOf(stringAsArray[i]) >= 0) {
stringAsArray[i] = stringAsArray[i].toUpperCase();
}
}
var newString = stringAsArray.join("");
return newString;
}
LetterChanges(readline());
function SimpleAdding(num) {
var totalSum = 0;
for (var i = 1; i <= num; i++) {
totalSum += i;
}
return totalSum;
}
SimpleAdding(readline());
function LetterCapitalize(line) {
var words = line.split(" ");
for (var i = 0; i < words.length; i++) {
var lettersInWord = words[i].split("");
lettersInWord[0] = lettersInWord[0].toUpperCase();
var newWord = lettersInWord.join("");
words[i] = newWord;
}
var newString = words.join(" ");
return newString;
}
LetterCapitalize(readline());
function SimpleSymbols(str) {
var letters = str.split('');
for (var i = 0; i < letters.length; i++) {
var letter = letters[i].toLowerCase();
var charCode = letter.charCodeAt(0);
if (charCode >= 97 && charCode <= 122) {
if (!((letters[i - 1] && letters[i - 1] === '+') && (letters[i + 1] && letters[i + 1] === '+'))) {
return false;
}
}
}
return true;
}
SimpleSymbols(readline());
function CheckNums(num1,num2) {
if (num2 > num1) {
return true;
} else if (num1 > num2) {
return false;
} else {
return -1;
}
}
CheckNums(readline());