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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Ask HN: Help me with my technical Interview.

4 点作者 jeez超过 14 年前
I had my first round of interview today[phone interview] with a &#60;reputed silicon firm&#62;and i think it went well. So I'm sure the face-to-face interview is going to be more rigorous than this. Can you guys shoot a lot of &#60;simple but hard&#62; problems pertaining to C++ and Data Structures?<p>For example, i didn't know what a virtual function was, but I've used it before. So any tips on what to read up on is appreciated too. On the phone interview: Interviewer: How do you find if a linked list has a cycle? Me:(feeling very confident) Use a set and every time a new element is traversed, write its pointer part into the set. Keep track of the number of nodes visited and size of the set. If/When they get unequal, you have found a loop! Him: Er... use two pointers, one for the first element and the second for the next element. When both of their next elements are the same, its a loop. Me: Oh...yeah. :|<p>So, you guys get the idea i hope. And yeah, wish me luck. :) Thanks in advance.

暂无评论

暂无评论