Skip to content

Instantly share code, notes, and snippets.

Josh Sacks SirNeuman

Block or report user

Report or block SirNeuman

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

Keybase proof

I hereby claim:

  • I am sirneuman on github.
  • I am sirneuman ( on keybase.
  • I have a public key ASCFxQKbTq6ECv1ElPV62_DTINkigNbTXbw7GWKnVdZEfwo

To claim this, I am signing this object:

SirNeuman /
Last active Feb 28, 2017
Bastille Agency Test

All of the following code is written in Python.

Problem 1:

Data is just a dictionary, where the keys are user tokens. The value for each key is another dictionary, where the keys are the URLs. I could use a set instead of a dictionary for the URLs, but finding a matching value in a dictionary is O(1) as opposed to a set, which is O(n). This also would allow us in the future to add more data to each URL if we wanted to. E.G. data = {'john': {'': {'potential_future_bool': True}, '': {}}, 'aaron': {'': {}}}

You can’t perform that action at this time.