Skip to content

Instantly share code, notes, and snippets.

Sean Pont seanpont

Block or report user

Report or block seanpont

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
View gist:3807ea2d4eafde8a972f
p0h+nMRcc+9eoqFm5vL0HduVfwsEiqo6qkHYf2g5qFS6UTpUv4f5tMHZSMkI2VDbHIqTy381Xs3fL0OGjRJEdQ8KvgVe915EL6qrvKmJ1xpK08kvtSRZwzUjwpKg/qyDFPeLftZF5dZemaZxMb8ugQTABbQtG7xLZYPXJ0ordMpJk7o15I5+ZAD80tj/w/5VX7hZHZ2YY7SU6BRNRaLg+enkaA22oE85mJk8cBuQcRTD7UYnxmyfaVnbdyh5t2kGetHmOlKME0052wcUKBVJWP+8PY5fuR0jUAfj2fxwgA1OFoYC+0zKj6basHnD9tbZJ2n2V0yVtYbX2JISAwJWOV2kReRoCLMlKCXYrWSmdPV7fYYPW7R2hHZUFrKKtl5mlz8uG1+y2qV4JvnFJ7ow00MHf3KNKhtsIeBET2QIIC/wYMVXvAUkwNRk4jtc1UmOZ25ifDml2Uj1ZC5LwXQDNs3jKYbTwccpDjeCV2WGcE5OgpY+isd2rnAwJTZVYOS9I0M9HCW8IpCXZanlda0M6xblQJMn1Xpu+1UqTe+oREKJcRsfh03wpiJ8SpPAmxA0uqHEjw7ZOCt2svj3aSRWJzu6eznxcVMKKpLbF425qpDAl0ISEI5v21jocXmseaXHj8frDPtww1v7tYA6zP0/iUaxsVfXUj0eGisMS1l6jprovCAyfmzncyfU3PUcd55kpZTE6mo87yAZ7s5hraUcUndI6sKlKvaZxgrz86ostbAPFlgRZepDDEQVfo6v5TkzEyxRsTQdwV8zswap7F3Ln9fjOba2GJU2SAFzOrOGjCfgGOlw9/E9si5lz9OjNbBw9G6+Rxc0GfVOqxde423aqLQ6+1XEWYU09rxAazOPcoL7fy0w8F8d+Hv4bD3+pzDqTs6uEHg1xft4i6zGFdoKbe/xdJNsaTAg0qg+oG77Ik5T13qNQkJyouL96znqkiHOm6asxj6Z8Kuj4r4g4kykMvpJk0+d1ur60rCc/bqpvlV+u3HHG8Az3XSj19DEzsjr
@seanpont
seanpont / InstrumentedArrayDeque.java
Last active Dec 21, 2015
MaxWithinWindowTest.java
View InstrumentedArrayDeque.java
package com.seanpont.structs;
import java.util.ArrayDeque;
/**
* User: spont200
* Date: 8/17/13
*/
public class InstrumentedArrayDeque<T> extends ArrayDeque<T> {
@seanpont
seanpont / MaxWithinWindow.java
Created Aug 18, 2013
MaxWithinWindow.java allows you to query for the maximum within the last n items added.
View MaxWithinWindow.java
package com.seanpont.structs;
import java.util.ArrayDeque;
import java.util.Deque;
/**
* Add items. Query which is the largest within the last n additions.
* User: spont200
* Date: 8/17/13
*/
@seanpont
seanpont / menuPicker.go
Last active Dec 19, 2015
A fun problem: given a menu with items and associated costs, and some desired combination of items, find the optimal choice of items on the menu to minimize the total cost. This is an optimization problem for which we may use boolean satisfiability. This solution is brute force, and there are clearly some optimizations one could take. In any cas…
View menuPicker.go
// menupicker.go
package main
import (
"fmt"
"strconv"
"strings"
)
const MAX_COST = 1 << 20
@seanpont
seanpont / Partition.java
Created May 24, 2013
Partition a number. For example, partition(5) = [ [5], [4,1], [3,2], [3,1,1], [2,2,1], [2,1,1,1], [1,1,1,1,1] ]. For more information on partions, see http://en.wikipedia.org/wiki/Partition_(number_theory)
View Partition.java
package com.seanpont.partition;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
@seanpont
seanpont / SaxRssHandler.java
Created Nov 14, 2012
Concise, effective SAX Parser for RSS Feeds
View SaxRssHandler.java
package com.seanpont.rss;
import java.util.Arrays;
import java.util.HashMap;
import org.xml.sax.Attributes;
import org.xml.sax.SAXException;
import org.xml.sax.helpers.DefaultHandler;
/**
You can’t perform that action at this time.