Skip to content

Latest commit

 

History

History
56 lines (41 loc) · 4.19 KB

week-03.md

File metadata and controls

56 lines (41 loc) · 4.19 KB

WEEK 3: Heaps, Tries, Sorting, Searching

D071UJyveuc 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

Outstanding followup issues

  1. https://triplebyte.com/iv/bYHlCkc/cp/redir_link (affifliate link) Last week we talked about companies using engineering test platforms to recruit, one of the best I've seen was TripleByte. That's an affiliate link but I genuinely think this platform is really good for getting your credentials listed and in front of companies that are recruiting. They have a series of tests and quizzes for you to do that are actually super hard what's nice about the difficulty aspect of the quizzes is they accurately can separate users into tiers where you get a 5 point scale for a number of engineering domains. High achievment on triplebyte (so they say) can get you straight to the front of the line for a lot of engineering roles. If you don't do well on a quiz you can retake in 4-6 months, meaning you've got time to study and upgrade. Strongly recommend this one. Even without the affiliate link TBH feel free to type in the URL directly if the idea of me getting areferral bonus is distateful to you :)
  2. they tried to ban him what's that one little secret employers hate?! Tune in to find out!
  3. https://btholt.github.io/four-semesters-of-cs/ from Rajat a text summary of the core CS concepts you're going to need for a tech career.
  4. https://cs50.harvard.edu/college/2021/spring/ probably the best CS refresher course out there. Incredible production value (they have muppets!)
  5. https://www.youtube.com/user/cs50tv what's more - CS50 - has been running for years! There are easily hundreds of videos online. Especially nice are the "tracks" which are mini lectures in a series on a topic not covered by the main course.
  6. A document containing a heuristic for Big-O <../documents/competitive-programmers-handbook.pdf>
  7. A DoorDash interview preparation article. Really valuable guidance and insight! https://doordash.engineering/2021/04/12/technical-interview-preparation/

Learning Objectives

  1. Have a broader understanding of the data structures we started on last week.
  2. Have a plan for mapping each major data structure to a feature of your chosen language (don't make my mistake! don't sort in an interview!)
  3. Have another round of thoughts on the behavioral interview
  4. Get excited for next week's special guest!!!! Amy Miller https://www.recruitinginyogapants.com/ tech recruiter who has worked directly with Google, Microsoft and, Amazon (kindof a big deal!)

Discussion questions

  1. Experience from another interview (and the lesson learned - make sure you map each data structure to an object in your language of choice)

Reading and Research

data structures ~ 40 min

  1. https://www.youtube.com/watch?v=wjI1WNcIntg Gail on Stacks and Queues (5:45)
  2. https://www.youtube.com/watch?v=t0Cq6tVNRBA Gail on Heaps (10:32)
  3. https://www.youtube.com/watch?v=oSWTXtMglKE Gail on Trees (the Trie builds on this) (9:57)
  4. https://www.youtube.com/watch?v=zIjfhVPRZCg Gail on the Trie data structure (4:55)
  5. https://www.youtube.com/watch?v=zaBhtODEL0w Gail on Graphs as well as BFS and DFS (possible skip if we recall from last week) (11:49)

preparing for 'soft skills' type questions

  1. https://www.youtube.com/watch?v=OiFmLJu_R_U Dan Croitor - netflix soft skills questions (4:56)
  2. https://www.youtube.com/watch?v=tJR8aLD7jwE Dan Croitor - common avoidable behaviors (19:12)
    • overpraise
    • prepare better
    • keep short answers
    • overconfidence
    • time-management
    • admit when you don't know an answer
    • get feedback!
    • network!
    • pessimism/bad mouthing - be emotionally positive optimistic (get therapy?!
  3. https://www.youtube.com/watch?v=vMQOg9C2R08 Dan Croitor - practise tell me about yourself (8:52)

Homework

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