Skip to content

Instantly share code, notes, and snippets.

View layonthebeech's full-sized avatar

Pat Beecher layonthebeech

  • Chicago, IL
View GitHub Profile
function findEvenIndex(arr)
{
var left = 0, right = arr.reduce(function(pv, cv) { return pv + cv; }, 0);
for(var i = 0; i < arr.length; i++) {
if(i > 0) left += arr[i-1];
right -= arr[i];
if(left == right) return i;
}
function listSquared (m, n) {
var matches = [];
for (var i = m; i <= n; ++i) {
var sum = getDivisors(i).reduce((sum, n) => sum + n * n, 0);
var ok = Number.isInteger(Math.sqrt(sum));
if (ok) {
matches.push([i, sum]);
}
var sum_pairs=function(ints, s){
var arr = [];
for(var i = 0; i < ints.length; i++) {
for(var j = 0; j < ints.length; j++) {
if(ints[i] + ints[j] === s && j !== i) {
arr.push(ints[i],ints[j]);
return arr;
}
}
}
function isPangram(string){
string = string.toLowerCase();
return "abcdefghijklmnopqrstuvwxyz".split("").every(function(x){
return string.indexOf(x) !== -1;
});
}
arr.forEach(function(x) { counts[x] = (counts[x] || 0)+1; });
function validate(password) {
return /^(?=.*\d)(?=.*[a-z])(?=.*[A-Z])[a-zA-Z0-9]{6,}$/.test(password);
} //alphanumeric, one lowercase, one uppercase, one number, 6 or greater length
function validatePIN(pin) {
return /^(\d{4}|\d{6})$/.test(pin)
}
function listToArray(list) {
var array = [];
for (var node = list; node; node = node.next)
array.push(node.value);
return array;
}
function SeriesSum(n) {
for (var s = 0, i = 0; i < n; i++) {
s += 1 / (1 + i * 3)
}
return s.toFixed(2)
}
@layonthebeech
layonthebeech / Sum of two lowest numbers in array
Last active August 10, 2016 15:57
Sum of two lowest numbers in array
function sumTwoSmallestNumbers(numbers){
numbers = numbers.sort(function(a, b){return a - b; });
return numbers[0] + numbers[1];
};