Goals

• Obtain an offer in 3-6 months time
• Master Algorithms/DS & System Design

Pre-Requisite Reading List (Books)

• System Design (THEORY) (Est. Total Time - 3 Weeks)
  1. Designing Data Intensive Applications (Est. Reading Time : 1 Week)
     1. Day1:C1-C2, Day2:C3-C4, Day3:C5-C6, Day4:C7-C8, Day5:C9-C10, Day6:C11-C12
  2. Distributed Systems Concepts & Design (Est. Reading Time : 2 Week)
     1. Week 1 | Day1:C1-C2, Day2:C3, Day3:C4-C5, Day4:C6-C7, Day5:C8-C9, Day6:C10-C11
     2. Week 2 | Day7:C12-C13, Day8:C14-C15, Day9:C16-C17, Day10:C18, Day11:C19-C20, Day12:C21
  3. Distributed Systems: An Algorithmic Approach (Optional)
• Algorithms & Data Structures (THEORY) (Est. Total Time - 3 Weeks)
  1. Algorithm Design Manual - Steven Skiena (Est. Reading Time: 1 Week)
     1. Day1:C1-C2, Day2:C3-C4, Day3:C5-C6, Day4:C7-C8, Day5:C9-C12, Day6:C13-C14, Day7:C15-C16, Day8:C17-C18
  2. Introduction to Algorithms - by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein (Est. Reading Time: 2 Week)
     1. Day1:C1-C3, Day2:C4-C5, Day3:C6-C8, Day4:C9-C11, Day5:C12-C14, Day6:C15-C16, Day7:C17-C19, Day8:C20-C22, Day9:C23-C25, Day10:C26-C27, Day11:C28-C29, Day12:C30-C31, Day13:C32-C33, Day14:C34-C35

Pre-Requisite Reading List (Academic Papers)

• Distributed Systems (Papers) (Est. Total Time - 3 Weeks)

  The goal here is to read each paper (4x in the week allowed for it)

  1. Set 1 (Est. Reading Time: 1 Week)
     1. BigTable - https://research.google/pubs/pub27898/ : Day 1-2 (Read 2x Each Day)
     2. HDFS - https://storageconference.us/2010/Papers/MSST/Shvachko.pdf : Day 3-4 (Read 2x Each Day)
     3. GFS - https://research.google/pubs/pub51/ : Day 5-6 (Read 2x Each Day)
     4. Chubby - https://research.google/pubs/pub27897/ : Day 7 (Read 2x Each Day)
  2. Set 2 (Est. Reading Time: 1 Week)
     1. Dynamo DB - http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/decandia07dynamo.pdf Day 1-2 (Read 2x Each Day)
     2. Spanner - https://www.usenix.org/system/files/conference/osdi12/osdi12-final-16.pdf Day 3-4 (Read 2x Each Day)
     3. Cassandra - https://www.cs.cornell.edu/projects/ladis2009/papers/lakshman-ladis2009.pdf Day 5-6 (Read 2x Each Day)
     4. Dryad - https://www.microsoft.com/en-us/research/wp-content/uploads/2007/03/eurosys07.pdf Day 7 (Read 2x Each Day)
  3. Set 3 (Est. Reading Time: 1 Week)
     1. Azure Data Lake Store - https://dl.acm.org/doi/pdf/10.1145/3035918.3056100 Day 1-2 (Read 2x Each Day)
     2. Paxos - https://www.cs.utexas.edu/users/lorenzo/corsi/cs380d/papers/paper2-1.pdf Day 3-4 (Read 2x Each Day)
     3. Dapper - http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/36356.pdf Day 5-6 (Read 2x Each Day)
     4. F1 - http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/41344.pdfDay 7 (Read 2x Each Day)

Coding Preparations

1. Elements Of Programming Interviews

   1. Week 1
      1. (Arrays) Day 1: P1-P4, Day2: P5-9, Day3: P10-P14, Day4: P15-P19, Day5:P20
      2. (Strings) Day5: P1-P3, Day6: P4-P8, Day7: P9-P12 + Review Weeks Solutions
   2. Week 2
      1. (Linked List) Day 1: P1-4, Day 2: P5-8, Day 3: P9-12, Day 4: P13
      2. (Stacks & Queues) Day 5: P1-4, Day 6: P5-8, Day 7: P9 + Review Weeks Solutions
   3. Week 3
      1. (Binary Trees) Day 1: P1-4, Day 2: P5-8, Day 3: P9-12, Day 4: P13-15
      2. (Heaps) Day 5: P1-4, Day 6: P5-6, Day 7: Review Weeks Solutions

   d. Week 4

   1. (Searching) Day 1: P1-4, Day 2: P5-8, Day 3: P9-10
   2. (Hash Tables) Day 3: P1-2, Day 4: P3-P6, Day 5: P7-P10, Day 6: P11 - P12, Day 7: Review Weeks Solutions

   e. Week 5

   1. (Sorting) Day 1: P1-4, Day 2: P5-8, Day 3: P9-12
   2. (Binary Search Trees) Day 4: P1-4, Day 5: P5-8, Day 6: P9-11, Day 7: Review Weeks Solutions

   f. Week 6

   1. (Recursion) Day 1: P1-4, Day 2: P5-8, Day 3: P9-11
   2. (Dynamic Programming) Day 4: P1-4, Day 5: P5-8, Day 6: P9-12, Day 7: Review Weeks Solutions

   g. Week 7

   1. (Greedy Algorithm & Invariants) Day 1: P1-4, Day 2: P5-8, Day 3: P9-12
   2. (Graphs) Day 4: P1-4, Day 5: P5-8, Day 6 & 7 : Review Weeks Solutions

   h. Week 8

   1. (Parallel Computing) Day 1: P1-4, Day 2: P5-8
   2. (Honors Problems) Day 3: P1-4, Day 4: P5-8, Day 5: P9-12, Day 6: P13-16, Day 7: P17-20

   g. Week 9

   1. (Honors Problems) Day 1: P21-P24, Day 2: P25-28, Day 3: P29-32, Day 4: P33-35

Sample Plan Of Action (3 Month Plan)

First 6 Weeks

1. System Design Pre Req Reading (Books) + Academic Papers Pre. Req. Reading (Est. Time: 3 Weeks)
   1. Read required chapters of the day ~70 pg. (in morning) & read the paper of the day (1x in morning) & (1x at nighttime)
   2. EPI Problems (Week 1 - 3) @ Night - 4 EPI Problems/Day ~ 28 EPI Problems/Week ~ 84 EPI Problems/3 Weeks
2. Algorithm & DS Pre Req Reading (Books) + Academic Papers Pre. Req. Reading (Est. Time: 3 Weeks)
   1. Read required chapters of the day ~70 pg. (in morning) & read the paper of the day (1x in morning) & (1x at nighttime)
   2. EPI Problems (Week 4 - 6) @ Night - 4 EPI Problems/Day ~ 28 EPI Problems/Week ~ 84 EPI Problems/3 Weeks

@ 6 Weeks

• 12 Academic Papers Read
• 4 Books Read (2 Distributed Systems + 2 DS/Algo)
• 168 EPI Problems Solved

Second 3 Weeks

1. EPI Problems (Est. Time: 3 Weeks)
   1. (Week 7 - 9) @ Night - 4 EPI Problems/Day ~ 28 EPI Problems/Week ~ 84 EPI Problems/3 Weeks

Start Interviewing After you've completed the above