Skip to content

Instantly share code, notes, and snippets.

Dustin King dmoney

Block or report user

Report or block dmoney

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
#!/usr/bin/env python3
import sys, os
def alert():
os.system('say -v Tessa "Your task has been completed."')
def alert_on_pipe_close():
while True:
View groupcities.js
// groupcities.js
// An alternative solution to:
// Given an array of city names, group the ones that are rotations of
// each other together. e.g.:
// input: ['Tokyo', 'London', 'Rome', 'Donlon', 'Kyoto', 'Paris']
// output:
// [
# python 3.6+
# written for:
import sys, random, argparse
parser = argparse.ArgumentParser(
description='Print the numbers from 0000 to 9999 in random order.')
View neurochromohexonics.html
<meta content="text/html;charset=utf-8" http-equiv="Content-Type">
<meta content="utf-8" http-equiv="encoding">
<!-- Synaptic neural net library -->
<script src=""></script>
<!-- fight me -->
from itertools import islice
def ints_from(start=2, step=1):
next = start
while True:
next += step
yield next
def take(n, iterable):
"""Return first n items of the iterable as a list
View _div.html.erb
View bitsnake.rb
# bitsnake.rb
# A solution to the Ancient City Ruby 2016 programming challenge:
# Dustin King ( / @cathodion )
# Counts the number of paths through an 10x10 grid of city blocks
# moving only East and South.
# A hack to enable calling functions as if they were methods
# Author: Dustin King (
# Grown from this tweet by Zygmunt Zając:
# Superseded by:
class Funverted:
'''Streaming pickle implementation for efficiently serializing and
de-serializing an iterable (e.g., list)
Created on 2010-06-19 by Philip Guo
Mostly rewritten 2015-01-16 by Dustin King for Python 3.4
Not backwards compatible.
2.7 version here:
import unittest
TREE = (1, (2, None, None), (3, (4, None, None), (5, None, None)))
EXPECTED_REVERSED = (1, (3, (5, None, None), (4, None, None)), (2, None, None))
def reversed(tree):
if tree is None:
return None
val, left, right = tree
You can’t perform that action at this time.