blocks|key|1659105|text|当我面试别人，问他们问题时，我并不是在寻找答案(必然)。把它说出来--讨论你的想法。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1659106|作为一名面试官，看到逻辑上的思路会比仅仅说“我愿意……”得到更多的分数。如果我能看到你知道如何解决问题，那就证明了解决问题的能力，这通常是目标。|1659107|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|F|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|G|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|H|8|@]|9|@]|A|$]]]|E|$]]

When I've interviewed people, and asked them questions, I'm not looking for an answer (necessarily). Talk it out - discuss what you're thinking.

As an interviewer, seeing the logical train of thought will score more points with me than just saying "I'd do ...". If I can see that you know how to approach the problem, that demonstrates the ability to work out problems, which is usually the goal.

blocks|key|183364|text|问这些问题的要点是，作为构建软件的人，我们应该知道这些东西，并能够应用它们。这项技能是一个基本的组成部分，它的用途不仅仅是通过面试。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|183365|大多数主题都是在任何大学的算法课程中讨论的。但要真正擅长它们，你可以尝试练习TopCoder，SPOJ和UVa+(以及许多其他类似的网站)的问题。|offset|length|183366|entityMap|0|LINK|mutability|MUTABLE|url|http://www.topcoder.com/tc|1|http://www.spoj.pl/|2|http://uva.onlinejudge.org/^0|0|12|8|0|1B|4|1|1G|3|2|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|S|8|@]|9|@$D|T|E|U|1|V]|$D|W|E|X|1|Y]|$D|Z|E|10|1|11]]|A|$]]|$1|F|3|-4|5|6|7|12|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]|N|$5|I|J|K|A|$L|O]]|P|$5|I|J|K|A|$L|Q]]]]

The point of asking these questions is that as people who build software, we are supposed to know this stuff and be able to apply them. This skill is a fundamental component and has uses beyond just passing the interview.

Most of the topics are discussed in any university algorithm course. But to be really good at them, you can try practicing problems from <a href="http://www.topcoder.com/tc" rel="noreferrer">TopCoder</a>, <a href="http://www.spoj.pl" rel="noreferrer">SPOJ</a> and <a href="http://uva.onlinejudge.org/" rel="noreferrer">UVa</a> (and lots of other sites like these).

blocks|key|183325|text|如果你正在面试一个实际的工程工作，有一些设计/架构方面的问题，可以期待一些基本的算法和数据结构问题。这些是一个好的程序员的基础。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|183326|我会熟悉基本的数据结构和常见的算法(排序、搜索、匹配)，以及每种算法的固有功能、局限性和挑战。|183327|通常，一个5分钟的问题只是为了看看你是如何解决问题的，而不是你如何解决它。|183328|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|I|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|J|8|@]|9|@]|A|$]]|$1|F|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|G|$]]

If you are interviewing for a hands-on engineering job, with some design/architecture aspects, expect some of the basic algorithm and data structure questions. These are the building blocks of a good programmer.I would familiarize myself with the basic data structures and the common algorithms (sort, search, match) and the inherent cpabilities, limitations and challenges of each. Often, a 5-minute question is just presented to see how you approach a problem, not how you solve it.

blocks|key|183299|text|这是一个非常模糊的问题，因为您问的是如何准备编写具有数据结构的算法。这类似于问如何知道如何用材料制作东西。他们希望你产生什么样的算法？他们要求您使用或生成什么样的数据结构？面试官(很可能)想要了解你的想法。不幸的是，可能也有一些人在寻找“书本答案”。一些例子将是有益的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|183300|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

This is a really nebulous question, given that you're asking how to be prepared to write algorithms with data structures. That's akin to asking how to know how to make things with materials. What sort of algorithms are they expecting you to produce? What sort of data structures are they asking you to use or produce? The interviewer is (likely) trying to get a feel for how you think. There may be some that are looking for "book answers" too, unfortunately. Some examples would be beneficial.

blocks|key|1589622|text|你可能想看一本关于数据结构和算法的书。除了Asaph推荐的博客条目中列出的那些(快速浏览一下就表明这个博客值得一读)，我一直在享受How+to+Think+About+Algorithms+(这是我通过生病得到的)。它是一本大学教科书，给出了算法思维的一般模式以及具体的算法示例(一些练习的答案在后面)。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1589623|entityMap|0|LINK|mutability|MUTABLE|url|http://www.cambridge.org/catalogue/catalogue.asp?isbn=9780521849319^0|1T|T|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

You might want to look at a book on Data structures and Algorithms. Aside from the ones listed by the blog entry recommended by Asaph (and a quick look indicates that the blog is worth reading), I've been enjoying <a href="http://www.cambridge.org/catalogue/catalogue.asp?isbn=9780521849319" rel="nofollow noreferrer">How to Think About Algorithms</a> (which I got by ILL). It is a college textbook which gives general patterns of algorithmic thinking as well as specific algorithm examples (and some exercises have answers in the back).

blocks|key|1659210|text|这是一个非常相关的问题。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1659211|当我阅读数据结构时，我发现了二进制搜索，冒泡排序，哈希，列表，映射。|1659212|然而，当我读到面试问题和张贴的答案时，它们都是关于trie、散列函数等的，我在材料中从未读过这些内容。|1659213|准备这样的面试就像找不到绳子的尽头，一次又一次地回到你开始的地方。|1659214|我读了一遍，然后想到面试问题，我发现自己一无所知。它就像一个无限循环。|1659215|太沮丧了。|1659216|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|P|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|Q|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|R|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|S|8|@]|9|@]|A|$]]|$1|L|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|M|$]]

This is a very relevant question.

When I read up data structures, I find binary searches, bubble sort, hash, list, map.

However, when I read the interview questions and the posted answers they are about trie, hash function etc which I never read in the material I find.

Preparing for such interview is like being unable to find the end of the rope and getting to the same point you started again and again.

I read up, then I think of interview question and I find myself clueless. its ilke an infinite loop.

So frustrated.

blocks|key|183493|text|在leetcode.com、hackerearth.com和hackerrank.com中练习。这些都有一些很好的算法，数据结构教程。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|183494|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Practice in leetcode.com, hackerearth.com and hackerrank.com. These have some good algorithm, data structure tutorials.

Recently I have been interviewing for quite a few Software Development Engineering position and almost every interview I have faced have been concentrated heavily on Algorithm and Data Structures, am wondering how could it be possible to face an unknown problem and design an algorithm for it using appropriate data structures that too in the span on minutes - 5 mins at max. 

I would really appreciate if someone can put some light on the issue and how to make best of the interview process in terms of dealing with Algorithm/Data Structures Problems. 

Thanks.

How to Deal with Algorithm/Data Structures Problems in Interview Process?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

最近我参加了相当多的软件开发工程职位的面试，我所面对的几乎每个面试都集中在算法和数据结构上，我想知道怎么可能面对一个未知的问题，并使用适当的数据结构为它设计一个算法，在跨度上也是如此--最多5分钟。如果有人能对这个问题有所了解，以及如何在处理算法/数据结构问题方面充分利用面试过程，我将不胜感激。谢谢。

问如何处理面试过程中的算法/数据结构问题？
EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何处理面试过程中的算法/数据结构问题？EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何处理面试过程中的算法/数据结构问题？
EN