daniel's notebooks

  • node-beginner-requestHandlers - /daniel/node-beginner-requesthandlers
    Last edited 7 years ago
    var querystring = require("querystring"); function start(response, postData) { var body = '<html>'+ '<head>'+ '<meta http-equiv="Content-Type" content="text/html; '+ 'charset=UTF-8" />'+ '</head>'+ '<body>'+ '<form action="https://tonicdev.io/daniel/56c781b79b27fc0c00ea722a/branches/master/upload" method="post">'+ '<textarea name="text" rows="20" cols="60"></textarea>'+ '<input type="submit" value="Submit text" />'+ '</form>'+ '</body>'+ '</html>'; response.writeHead(200, {"Content-Type": "text/html"}); response.write(body); response.end(); } function upload(response, postData) { response.writeHead(200, {"Content-Type": "text/plain"}); response.write("You've sent the text: "+ querystring.parse(postData).text); response.end(); } exports.start = start; exports.upload = upload;
  • node-beginner-router - /daniel/node-beginner-router
    Last edited 7 years ago
    function route(handle, pathname, response, postData) { if (typeof handle[pathname] === 'function') { return handle[pathname](response, postData); } else { response.writeHead(404, {"Content-Type": "text/plain"}); response.write("404 Not found\nNo request handler found for " + pathname); response.end(); } } exports.route = route;
  • Password Strength Tester - /daniel/pass-strength-meter
    Last edited 7 years ago
    var zxcvbn = require('zxcvbn'); zxcvbn('passw0rd');
  • Function to classify a sequence of integers - /daniel/reddit-help-1
    Last edited 7 years ago
    function processData(input) { var result = 1; for(var i = 1; i <= input.length; i++) { if(input[i] <= input[i-1]) { result = 0; } } if (result == 1) { return "USEFUL" } else return "SOMETHING ELSE" } processData([1,2,2])
  • Challenge #235 [Easy] Ruth-Aaron Pairs - /daniel/challenge-235
    Last edited 7 years ago
    var inputText = '3\n(714,715)\n(77,78)\n(20,21)' function ruthAaron(input) { function factorSum(n) { var sum = 0; for (var i = 2; i <= n; i++) { if (n % i == 0) { sum += i; while (n % i == 0) n /= i; } } return sum; } var pairs = input.split('\n').slice(1), pair, p; while (pair = pairs.shift()) { p = pair.match(/\d+/g); console.log(pair + (factorSum(p[0]) == factorSum(p[1]) ? ' VALID' : ' NOT VALID')); } } ruthAaron(inputText);
  • BABY STEPS-learnyounode #1445 - /daniel/issue-1445
    Last edited 7 years ago
    var sum = 0; for(var i = 2; i < process.argv.length; i++){ sum += Number(process.argv[i]); } console.log(sum);
  • [Javascript] Pushing to array; help me - /daniel/pushing-to-array
    Last edited 7 years ago
    var text = "Pie pi epie pie pie pie Jalen pi epie Jalen piepi epiepiepie Jalen ppiepie Jalen"; var myName = "Jalen"; var hits = []; for (var currentNumber = 0; currentNumber < text.length; currentNumber++) { if (text[currentNumber] === myName[0]) { for (var currentPush = currentNumber; currentPush < (myName.length + currentNumber); currentPush++); { hits.push(currentPush); } } } hits
  • Project Euler - /daniel/project-euler
    Last edited 7 years ago
    Problem #1 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.