↓ Ir para o conteúdo principal

← todas as notas

📎 Webclip

Get Hired: Data Structure and Algorithm Interviews For People Who Hate Them

The post describes DSA interviews as a timed format where candidates solve standalone programming problems using data structures and common algorithms. It argues that interviewers look for both technical approach and communication, and that interviewing itself is a learnable skill.

Reading notes
#

  • DSA interviews ask candidates to solve programming problems with structures like arrays, maps, and trees, or algorithms like sorting and searching.
  • The author says companies use them to test fundamentals across many teams, and that interviewing is a learnable skill.
  • As an interviewer, she used a pairs-summing-to-k question to see whether candidates could explain an approach before coding and then improve it with a hash map.
  • Candidates are expected to ask clarifying questions, try examples, describe a brute-force solution, then optimize with an appropriate structure or algorithm.
  • Testing the solution with negative and positive cases is part of the interview process.
  • Red flags include an unengaged interviewer, a condescending interviewer, or a question that depends on an obscure data structure or algorithm.
  • Preparation advice includes practicing outside an IDE, writing by hand, and talking through the solution while coding.
  • The post recommends resources such as Cracking the Coding Interview, js.checkio.org, CodingBat, HackerRank, and LeetCode.