Skip to content

Instantly share code, notes, and snippets.

@binury
Last active June 27, 2017 02:47
Show Gist options
  • Save binury/3b7f1207b09e08ebf566fcd8f199ed08 to your computer and use it in GitHub Desktop.
Save binury/3b7f1207b09e08ebf566fcd8f199ed08 to your computer and use it in GitHub Desktop.
reto de mayo
// Solutions in Javascript for the Chillin & Grillin
// coding event @ Geekdom
function numword (num) {
const numwords = [
'Zero','One','Two','Three','Four',
'Five','Six','Seven','Eight','Nine'
];
return numwords[num]
}
// no worky :(
function excelCol (num) {
const KEY = 'abcdefghijklmnopqrstuvwxyz'.toUpperCase().split('');
let result = [];
const places = [729, 27, 1];
if (!num) return 'A';
for (const place of places) {
let val = Math.floor(num / place); /*?*/
if (val >= 1) {
num -= place * val;
result.push(KEY[ val - 1])
} else { result.push(' ') }
}
while (result[0] === ' ') {
console.log('poppin');
result.shift();
}
return result.map( (val,idx,arr) => {
return val === ' ' ? 'A' : val;
}).join('');
}
function isPalindrome (num) {
let numStr = String(num);
return numStr === numStr.split('').reverse().join('');
}
function countFours (num) {
let count = 0;
for (let i = 0; i <= num; i++) {
if (String(i).includes('4')) {
count++;
}
}
return count;
}
function countFactorials (low, high) {
function factorial(num)
{
if (num < 0) {
return -1;
}
else if (num == 0) {
return 1;
}
let tmp = num;
while (num-- > 2) {
tmp *= num;
}
return tmp;
}
count = 0;
for (let i = 1; factorial(i) <= high; i++) {
const test = factorial(i);
if (test < low) {
continue;
}
count++;
}
return count;
}
console.log(excelCol(28));
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment