Skip to main content

Playing The Code Interview Game - Day 1 - The Plan for a Plan!


I was talking yesterday to a friend of mine and he is looking for a new job.  I stressed out to him that looking for a new job in high tech industry should be highly treated as series s**t business.  It involves making a plan, reviewing computer science academy basic algorithms, fine tuning your resume, and practicing logical questions and programming questions.

Now although this is a serious game, we at, developers at rest, think that developers should rest, therefore an inherent part of our plan, is not to work your brain out and to take the time also to rest.

This series will go through these steps, you can actually take it to be your plan, we are going to have a timeline, so that we are going to mention how much time you need to invest every day and in what.

Usually web sites that focus on hacking programming tend to focus on one or only a few aspects of that area, we are going to get a holistic picture of the process, and when we feel it's time to invest money in something we will mention this.  Don't take this as an advertisement, it's going to be an investment.

Step 1: The Plan for a Plan

In this step we are going to cover what our plan for a plan is going to be and here it is:
  1. List computer science algorithms and data structures topics to study
  2. Aggregate the topics in a google spreadsheet
  3. Make a schedule to study them first theoretically
  4. List timeline to practice each and every one of them
  5. List books or hopefully single book to get problem set from
  6. List web site or hopefully the one and best web site to practice programming tasks
  7. Schedule exercises
  8. List companies to do dry-run interviews on (companies you are less interested in)
  9. List companies you are interested in and after you finished the try run go to these interviews
  10. Tactic for negotiation
If you have other topics you would like to mention please do comment on this topic below in comments section.  Note that we are going to incorporate rest pieces and fun in the details of the steps that we are going to provide in future posts.


With this developers at rest conclude our plan for a plan for programming interviews.  In the next post we are going to go through step number 1 which is to list computer science algorithms and data structures topics to study.  Follow us there and leave a comment if you have any question or issue!


Now by far the best book (although I think I could have created a better version) for studying for programing interviews is: "Cracking The Coding Interview"


Popular posts from this blog

Dev OnCall Patterns

Introduction Being On-Call is not easy. So does writing software. Being On-Call is not just a magic solution, anyone who has been On-Call can tell you that, it's a stressful, you could be woken up at the middle of the night, and be undress stress, there are way's to mitigate that. White having software developers as On-Calls has its benefits, in order to preserve the benefits you should take special measurements in order to mitigate the stress and lack of sleep missing work-life balance that comes along with it. Many software developers can tell you that even if they were not being contacted the thought of being available 24/7 had its toll on them. But on the contrary a software developer who is an On-Call's gains many insights into troubleshooting, responsibility and deeper understanding of the code that he and his peers wrote. Being an On-Call all has become a natural part of software development. Please note I do not call software development software engineering b

SQL Window functions (OVER, PARTITION_BY, ...)

Introduction When you run an SQL Query you select rows, but what if you want to have a summary per multiple rows, for example you want to get the top basketball for each country, in this case we don't only group by country, but we want also to get the top player for each of the country.  This means we want to group by country and then select the first player.  In standard SQL we do this with joining with same table, but we could also use partition by and windowing functions. For each row the window function is computed across the rows that fall into the same partition as the current row.  Window functions are permitted only in the  SELECT  list and the  ORDER BY  clause of the query They are forbidden elsewhere, such as in  GROUP BY ,  HAVING  and  WHERE  clauses. This is because they logically execute after the processing of those clauses Over, Partition By So in order to do a window we need this input: - How do we want to group the data which windows do we want to have? so  def c

Building Secure and Reliable Systems

A recent book was published this year by Google about site reliability and security engineering, I would like to provide you a brief overview of it and incorporate my own analysis and thoughts about this subject while saving you some time from reading, at least part of it. Take a few of your customers and ask them, what are the top 5 features on my product that you like.  The answer that you are likely to get is, I really like how polished the UI is, or the daily report I get by mail is just fantastic, or since I started using your product I was able to save one hour a day my productivity got up and the share /chat button on document that you added recently is doing a great job. Your customers are very unlikely to answer the question of what top 5 features of my product do you like with I really like its security or I really like that we lost no chat messages since I started using it.  No real customer will even think of it, moreover, assuming you did a very good job, they won&#