Skip to content

Instantly share code, notes, and snippets.

View ukd1's full-sized avatar

Russell Smith ukd1

View GitHub Profile
sample_data = [0, 1, 100, 99, 0, 10, 90, 30, 55, 33, 55, 75, 51, 49, 50, 51, 49, 51]
sample_output = [[1,99], [0,100], [10,90], [51,49], [50,50]]
var results = [];
for (var i = 0; i < sample_data.length; i++) {
for (var j = i + 1; j < sample_data.length; j++) {
if (sample_data[i] + sample_data[j] == 100) {
var combo = sample_data[i]
if (results.indexOf(sample_data[i]) == -1 && results.indexOf(100 - sample_data[i]) == -1) {
results.push(combo);
from __future__ import division
import urllib, json, string, datetime
from itertools import permutations
from math import log
def _bf(V, E, src):
# init
dist = dict(zip(V, [float('Inf') for v in V]))
pred = dict(zip(V, [None for v in V]))
@ukd1
ukd1 / jobs.md
Last active December 21, 2015 11:19

We're a 4 person product and engineering-focused startup based in sunny SoMa, San Francisco looking for our third hire. We are all hackers (1 designer / front-end guy, 3 full stack). We know testing software is broken - how is it that something so integral to developing great products is still so hard and time consuming?

We are fixing software QA; We need your help to execute on our vision of making QA simple, beautiful and accessible to all.

Us:

  • Reinventing how developers test software
  • Seed stage company based in SF (SoMa)
  • Backed by the best investors + accelerator program in the world
  • Currently 4 hackers