Skip to content

Latest commit

 

History

History
45 lines (28 loc) · 1.96 KB

week-02.md

File metadata and controls

45 lines (28 loc) · 1.96 KB
Raw

WEEK 2: Underpinning Algorithms

Week ZERO Video

The topics at hand for the next two weeks are: Complexity Analysis (a.k.a BigO), Arrays, Stacks, Queues, Linked List, Trees, Tries, Graphs (BFS and DFS), Hash Tables, Heaps, Sorting, Searching

Learning Objectives

  1. Know what topics are expected to arise during a code interview
  2. Be aware of where to find resources on the expected topics
  3. Understand Big-O notation
  4. Be able to estimate Big-O by looking at an algorithm

Discussion questions

  1. O(log n) as the law of dimishing returns
  2. HackerRank / Leetcode algorithm practise strategies based on learning theory TL;DR: Set a timer, solve without assistance for 30 minutes. If you haven't solved in time, look at the solution. Finish solving for another 30. (potentially) Reduce time allocation as you improve.
  3. Time complexity and Space complexity - don't forget about memory

Reading and Research

Rapid summary of all topics

  1. https://www.youtube.com/watch?v=oz9cEqFynHU Tren Black's 15 minute firehose of information "Data Structures and Algorithms in 15 minutes"

Big-O notation

  1. https://www.youtube.com/watch?v=v4cd1O4zkGw Gayle Laakmann McDowell 8 minute overview
  2. https://www.youtube.com/watch?v=Ee0HzlnIYWQ 30 minute lecture - pragmatic big-O

Hash Tables

  1. https://www.youtube.com/watch?v=shs0KM3wKv8 Gayle Laakmann McDowell 6 minute overview - good rule for interview questions, the answer is always a hash table

How to use HackerRank/Leetcode

  1. https://www.youtube.com/watch?v=CltYi33y0ls (Nick White) How to use LeetCode effectively
  2. https://www.youtube.com/watch?v=dIrS31CCITM Techlead: How to solve coding interview problems ("Let's leetcode")

Homework

  1. Solve 4 easy and 1 medium algorithm problem in HackerRank or Leetcode. Adjust for your skill level and avialable time.