Disclaimer: This piece is written anonymously. The names of a few particular companies are mentioned, but as common examples only.
This is a short write-up on things that I wish I'd known and considered before joining a private company (aka startup, aka unicorn in some cases). I'm not trying to make the case that you should never join a private company, but the power imbalance between founder and employee is extreme, and that potential candidates would
| import bisect | |
| class NFA(object): | |
| EPSILON = object() | |
| ANY = object() | |
| def __init__(self, start_state): | |
| self.transitions = {} | |
| self.final_states = set() | |
| self._start_state = start_state |
| # Simple, scrappy UDP DNS server in Ruby (with protocol annotations) | |
| # By Peter Cooper | |
| # | |
| # MIT license | |
| # | |
| # * Not advised to use in your production environment! ;-) | |
| # * Requires Ruby 1.9 | |
| # * Supports A and CNAME records | |
| # * See http://www.ietf.org/rfc/rfc1035.txt for protocol guidance | |
| # * All records get the same TTL |
| #!/usr/bin/env ruby | |
| # A quick and dirty implementation of an HTTP proxy server in Ruby | |
| # because I did not want to install anything. | |
| # | |
| # Copyright (C) 2009 Torsten Becker <torsten.becker@gmail.com> | |
| require 'socket' | |
| require 'uri' | |
| # Ways to execute a shell script in Ruby | |
| # Example Script - Joseph Pecoraro | |
| cmd = "echo 'hi'" # Sample string that can be used | |
| # 1. Kernel#` - commonly called backticks - `cmd` | |
| # This is like many other languages, including bash, PHP, and Perl | |
| # Returns the result of the shell command | |
| # Docs: http://ruby-doc.org/core/classes/Kernel.html#M001111 |
| /* | |
| LANG: C++ | |
| */ | |
| #include <iostream> | |
| #include <cstdio> | |
| using namespace std; | |
| #define MAXN 512 |
| #include <iostream> | |
| #include <vector> | |
| #include <cmath> | |
| #include <cstring> | |
| #include <cstdlib> | |
| #include <cstdio> | |
| #include <cassert> | |
| using namespace std; |
| #!/usr/bin/env python | |
| # encoding: utf-8 | |
| """ | |
| TwitterEgoBuilder.py | |
| Created by Drew Conway on 2009-02-23. | |
| Copyright (c) 2009. All rights reserved. | |
| The purpose of this script is to generate a | |
| NetworkX DiGraph object based on the snowball |
The answer is the number of inversions in the array, which is the number of pairs i,j such that i < j and a[i] > a[j]. Counting this is a fairly classical problem with many solutions such as using data structures such as Balanced Trees or Binary Indexed Trees. Another particularly elegant solution involves modifying merge sort to count the number of inversions when merging the two sorted halves in the algorithm.
| #include <iostream> | |
| #include <string> | |
| #include <sstream> | |
| #include <vector> | |
| #include <set> | |
| #include <map> | |
| #include <list> | |
| #include <queue> | |
| #include <stack> | |
| #include <memory> |