TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Show HN: Replays of technical interviews with engineers from Google, FB and more

64 点作者 leeny超过 6 年前

6 条评论

haspok超过 6 年前
&quot;...if you&#x27;re trying to get better at technical interviews, the best way to do that is to actually do it.&quot;<p>No dammit, I don&#x27;t want to get better at technical interviews - I want to live in a world where we don&#x27;t need them. Why not fix the root problem instead of amplifying it?
评论 #17988991 未加载
geebee超过 6 年前
This is valuable. Thank you for creating and posting it.<p>First, it&#x27;s an excellent reference for people who don&#x27;t really understand technical &quot;interviews&quot; and their exam-like nature. Most interviews in other fields do probe knowledge, but interviews in our fields really are exams.<p>Another factor is that there&#x27;s very little knowledge of information out there. We take these exams under conditions of secrecy, with very little feedback. For example, there are scores for my performance on interview exams in a database somewhere at google, but I&#x27;m not allowed to know how they were judged, who scored them, or what the scores are. I actually don&#x27;t know what would be considered a good or bad performance. This site helps me get a better sense of how these are conducted and evaluated.<p>From a business point of view, it&#x27;s also clever. People really do want to get feedback, the kind they can&#x27;t get from Google or other interviewers, in part because of liability issues. So by providing an area to practice, the placement site can identify people who are most likely to get through the technical interview - which means they are most likely to place candidates. Not bad.<p>That said... I&#x27;m still not surprised that people who have the skill and focus to become software developers take a look at how tech interviews work and decide that they would much rather work in a different field.
pmiller2超过 6 年前
The complexity of the forwarded message problem is wrong. Any algorithm solving this can be used to answer whether a graph of order n is Hamiltonian by simply asking if the longest forwarding path is of length n-1. Thus, either the complexity is nonpolynomial or the interviewee has just won the million dollar prize for solving an NP-complete problem in polynomial time.
评论 #17985387 未加载
panda88888超过 6 年前
These recordings are really useful. Does anyone know how representative these are from actual interviews? For example, for the interview question on finding pairs in array that sum to k, the case where duplicate numbers in input array sum up to k is missed, and the interviewer didn&#x27;t bring it up. Also, the space complexity of in-place quick sort is log(n), since the indices need to be kept in each call to sort subpartitions.
DoritoChef超过 6 年前
The audio quality of these interviews made me grimace. Audio quality aside, this looks like it would be a great resource for anyone trying to go through a &quot;FAANG-style&quot; multi-round interview process.
评论 #17985440 未加载
fakeElonMusk超过 6 年前
this is a brilliant concept, seems really useful for anyone prepping for a technical interview.