Skip to content

Latest commit

 

History

History
57 lines (36 loc) · 2.85 KB

week-06.md

File metadata and controls

57 lines (36 loc) · 2.85 KB
Raw

WEEK 6: Timed practice

Week ZERO Video

Now that you’ve been practicing more straightforward problems for a couple of weeks, it’s time to get real and start practicing harder questions that are more likely to be asked during coding interviews.

For practice and automated challenges along with interactive solutions, look at Grokking the Coding Interview: Patterns for Coding Questions

Here are some guidelines to keep in mind as you solve these problems:

  1. Now is the time to start timing yourself. Ideally, you shouldn’t spend more than 20–30 minutes solving any given problem. (This probably won’t be possible for all questions right away.)

  2. Don’t be discouraged if you are not able to solve a problem within the allocated time. Solve it even if takes you a couple of hours, without looking at the solution. This will help you build the confidence that you can solve it and then you can focus on solving them faster later.

  3. Start thinking about the Runtime and Memory complexity of each solution. You will have to articulate the complexities in the actual interview clearly, so it’s better to start now.

Here are some sample problems to consider:

  • Implement Binary Search
  • Find the Intersection point of two linked lists
  • Reverse words in a sentence
  • Check if two binary trees are identical
  • Clone (deep copy) a directed graph
  • Find solutions to a Boggle game
  • Determine if there are any three integers in an array that sum equal to the given value.

You will have to spend 2–3 weeks here. Don’t worry if you hit roadblocks and get stuck often — you will get the hang of it after a while. Trust me, questions that look impossible in the first few days start to seem easy after you’ve had practice.

Learning Objectives

  1. Get inspired! (Checking out some developer stories)
  2. Follow more algorithm review

Discussion questions

  1. TBD

Lesson plan

Some inspiring stories

  1. Scott Moss https://www.youtube.com/watch?v=930c343X1XE
  2. Ish Shabazz https://www.youtube.com/watch?v=M-7DQJbMapI (first 8 minutes)
  3. Kevin Naughton Jr. https://www.youtube.com/watch?v=tAQ-s90eaKQ

More algorithms

  1. https://www.youtube.com/watch?v=1YQmI7F9dJ0 longest common prefix
  2. https://www.youtube.com/watch?v=Z_-h_mpDmeg validate a binary search tree
  3. https://www.youtube.com/watch?v=o8S2bO3pmO4 number of islands (graph)
  4. https://www.youtube.com/watch?v=dP8CAXKISX0 intersection of arrays
  5. https://www.youtube.com/watch?v=pD3cHFNyW2I max length unique string (DFS, recursive)

Homework

  1. Algos but with a timer!
  2. Consider joining a code interview service https://thedailybyte.dev/?ref=lgtmshipit