from heapq import * | |
class A: | |
def __init__(self, val): | |
self.val = val | |
def __lt__(self, cmp): | |
"""Overwrite this to do the opposite of what's | |
expected""" |
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
#!/bin/bash | |
set -e | |
echo -e "Image Converter for Slack Emoji\nNOTICE: The image will be overwritten." | |
if [ $# -lt 1 ]; then | |
echo "USAGE:" | |
echo -e " ${0} IMG_FILE [IMG_FILE...]\n" | |
echo "IMG_FILE:" |
$ git pull
remote: Counting objects: 409, done.
remote: Compressing objects: 100% (66/66), done.
remote: Total 409 (delta 269), reused 248 (delta 247), pack-reused 96
Receiving objects: 100% (409/409), 82.91 KiB | 0 bytes/s, done.
Resolving deltas: 100% (273/273), completed with 61 local objects.
From github.com:alphagov/smart-answers
c71d9c3..6f9dbfe master -> origin/master
9f9ef5d..741945f benefit-cap-calculator-pre-autumn-changes -> origin/benefit-cap-calculator-pre-autumn-changes
Picking the right architecture = Picking the right battles + Managing trade-offs
- Clarify and agree on the scope of the system
- User cases (description of sequences of events that, taken together, lead to a system doing something useful)
- Who is going to use it?
- How are they going to use it?
import java.util.Arrays; | |
/** | |
* quickselect is a selection algorithm to find the kth smallest element in an | |
* unordered list. Like quicksort, it is efficient in practice and has good | |
* average-case performance, but has poor worst-case performance. Quickselect | |
* and variants is the selection algorithm most often used in efficient | |
* real-world implementations. | |
* | |
* Quickselect uses the same overall approach as quicksort, choosing one |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
I have moved this over to the Tech Interview Cheat Sheet Repo and has been expanded and even has code challenges you can run and practice against!
\