Skip to content

Instantly share code, notes, and snippets.

Suri sponnusa

Block or report user

Report or block sponnusa

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
sponnusa / The Technical Interview Cheat
Created Aug 11, 2017 — forked from augbog/The Technical Interview Cheat
This is my technical interview cheat sheet. Feel free to fork it or do whatever you want with it. PLEASE let me know if there are any errors or if anything crucial is missing. I will add more links soon.
View The Technical Interview Cheat

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics



  • Stores data elements based on an sequential, most commonly 0 based, index.
  • Based on tuples from set theory.

Keybase proof

I hereby claim:

  • I am sponnusa on github.
  • I am suri ( on keybase.
  • I have a public key whose fingerprint is B392 CFF3 EAE7 49CA D271 175B 3CCD 9B07 0E17 6132

To claim this, I am signing this object:


Build your own private, encrypted, open-source Dropbox-esque sync folder


  • One or more clients running a UNIX-like OS. Examples are given for Ubuntu 12.04 LTS, although all software components are available for other platforms as well (e.g. OS X). YMMV
  • A cheap Ubuntu 12.04 VPS with storage. I recommend Backupsy, they offer 250GB storage for $5/month. Ask Google for coupon codes.

Software components used:

  • Unison for file synchronization
  • EncFS for folder encryption
sponnusa /
Created Sep 10, 2016 — forked from naholyr/
Sample /etc/init.d script

Sample service script for debianoids

Look at LSB init scripts for more information.


Copy to /etc/init.d:

# replace "$YOUR_SERVICE_NAME" with your service's name (whenever it's not enough obvious)
sponnusa / why.markdown
Created Aug 22, 2016 — forked from egonSchiele/why.markdown
Why read Grokking Algorithms?
View why.markdown

If you have already taken a course in algorithms, why read Grokking Algorithms (

If you were learning graph algorithms, which approach would you prefer:

  1. Imagine you have to take public transit from your home to your office. How do you figure out the fastest route? Use graph algorithms! OR

  2. We can choose between two standard ways to represent a graph G = (V, E): as a collection of adjacency lists or as an adjacency matrix. Either way applies to both directed and undirected graphs.

I prefer the first way: lead with lots of examples, and clear writing. The second way is an excerpt from "Introduction to Algorithms"...that's how they start their section on graph algorithms.

You can’t perform that action at this time.