I hereby claim:
- I am kcoyner on github.
- I am kcoyner (https://keybase.io/kcoyner) on keybase.
- I have a public key ASBaBeH6o6xCnp2WYMdvLZ0TcwWadtnMPu1YyPUqd6p_OAo
To claim this, I am signing this object:
[uwsgi] | |
vhost = true | |
plugins = python | |
socket = /run/uwsgi/app/ilovenatalia.net/ilovenatalia.net.socket | |
master = true | |
enable-threads = true | |
processes = 2 | |
module = ilovenatalia.uwsgi:application | |
home = /home/kcoyner/.virtualenvs/ilovenatalia | |
chdir = /opt/django_apps/ilovenatalia |
# /etc/uwsgi/apps-available/lists.rustybear.com.ini | |
[uwsgi] | |
plugins = cgi | |
vhost = true | |
master = true | |
touch-reload = %p | |
pidfile = /run/uwsgi/app/lists.rustybear.com/pid | |
log-maxsize = 20971520 | |
socket = 127.0.0.1:14014 | |
chdir = / |
# Creates a new git sensitive prompt with different information based on | |
# whether you are in a schroot or python virtualenv or a | |
# regular bash session. | |
# | |
# Load it from your .bashrc with the following: | |
# | |
# if [ -f ~/bin/smartprompt.sh ]; then | |
# . ~/bin/smartprompt.sh | |
# fi |
#!/bin/bash | |
# Simple script to remount an already mounted SD card | |
# Also sets the readahead speed to 1024 | |
# Kevin Coyner | |
# 2016-02-26 | |
# # Parameters to be set | |
# #-------------------------------------------------------------------- |
var salesTeam = [{name: {first: 'aleen', last: 'atkins'}, age: 26, sales: '$2314'}, | |
{name: {first: 'alvaro', last: 'angelos'}, age: 55, sales: '$1668'}, | |
{name: {first: 'denese', last: 'dossett'}, age: 29, sales: '$9248'}, | |
{name: {first: 'douglas', last: 'denney'}, age: 53, sales: '$5058'}, | |
{name: {first: 'earline', last: 'erickson'}, age: 19, sales: '$18876'}, | |
{name: {first: 'herman', last: 'hazell'}, age: 25, sales: '$2746'}, | |
{name: {first: 'homer', last: 'hirth'}, age: 26, sales: '$474'}, | |
{name: {first: 'hwa', last: 'heidt'}, age: 53, sales: '$9607'}, | |
{name: {first: 'hyon', last: 'hampshire'}, age: 46, sales: '$13598'}, |
/* This is not my submitted version. That version can be found at: | |
https://gist.github.com/kcoyner/8ddc95ad78b022b1c58363b2ef90e080 | |
I wanted to upload this version as it is 100% complete. I was able to complete all problems, | |
just not in the allocated amount of time. I got hung up on Part 5 on a stupid mistake, and | |
Part 6 took me another 15 minutes or so. Thank you. Kevin.] | |
*/ | |
var salesTeam = [{name: {first: 'aleen', last: 'atkins'}, age: 26, sales: '$2314'}, | |
{name: {first: 'alvaro', last: 'angelos'}, age: 55, sales: '$1668'}, | |
{name: {first: 'denese', last: 'dossett'}, age: 29, sales: '$9248'}, |
curl -i -u "kcoyner:my_password" -X PUT -d '' 'https://api.github.com/repos/kcoyner/my_repo/collaborators/my_collaborator_id' |
I hereby claim:
To claim this, I am signing this object:
// https://jsfiddle.net/934umzan/2/ | |
var currentPages = []; | |
var backPages = []; | |
var forwardPages = []; | |
$('#submit').on('click', function(event) { | |
event.preventDefault(); | |
var text = $('#text').val(); | |
console.log(text); |
You may use a whiteboard or paper to sketch things out, but please write your code in an IDE so you can write tests to demonstrate that your code works, and you can paste that code into a Github Gist upon solution submission. | |
You may only use the Internet to remind yourself of syntax (e.g., on the MDN site), not to look up anything specifically about this problem. Be reasonable -- stay within the bounds of what would be permissible in a live industry interview. | |
## Largest level of tree? | |
You are given a binary tree whose nodes all have integer values (both positive and negative). | |
Determine which level of the tree is the "largest", i.e., you sum all the node values at that level, and determine which level has the largest sum. |