Here's a link I saw on Hacker News tonight with some interview tips:...



Here's a link I saw on Hacker News tonight with some interview tips:…

Here's a link I saw on Hacker News tonight with some interview tips: http://blog.palantir.com/2011/10/28/how-to-rock-a-systems-design-interview/

Google asks these types of interview questions too, especially in Site Reliability Engineering, and I've seen some candidates shine, and some candidates fall flat. I'm not going to give away my secret questions, but I do expect people I interview to at least have passing familiarity with:
* Latency constraints
* Synchronization constraints
* Bandwidth/throughput constraints
* Memory constraints
* Sharding
* Caching
* Master election vs. being fully distributed
* etc. etc.

If you're about to graduate, and haven't worked on a large system, don't panic. You can still study things like hadoop, cassandra, etc. and figure out why they were built the way they were, and get an idea of the idioms they use. And there is some tolerance built into the system for people who haven't had first-hand experience yet - a lot of this stuff can be reasoned from first principles on the fly if need be. And ask lots of questions about scope and constraints - they tend to make it easier to figure out what's possible and not possible.

And yes, it turns out that good large systems design abilities pay off when you become a SWE or an SRE. We sit in on design reviews frequently in order to make sure people are designing things sensibly. "No, bandwidth-throttled pull-based replication will not and cannot have a maximum guaranteed replication latency of under a minute. If you care about minute-level consistency, use a distributed write with a quorum (e.g. http://static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/en/us/pubs/archive/36971.pdf )." "No, you cannot expect your feature to flip from 0% to 100% instantly, you have to deploy in stages so you accept new requests load-balanced to you even if you aren't serving the new feature yet", etc. etc.

Read full article from Here's a link I saw on Hacker News tonight with some interview tips:…


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts