blocks|key|1857959|text|Fibonacci，反转字符串，计数字节中设置的位数是其他常见的位数。Project+Euler还有一大堆难度越来越大的问题。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1857960|entityMap|0|LINK|mutability|MUTABLE|url|http://projecteuler.net/^0|Z|D|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]]]]

Fibonacci, reverse a string, count number of bits set in a byte are other common ones.
<a href="http://projecteuler.net/" rel="noreferrer">Project Euler</a> also has a large collection of increasing difficulty.

blocks|key|2071941|text|让他们写一个应用程序来返回给定数字的因数。这很容易做，但很难在短时间内做好。你可以在很短的时间内看到他们的风格和思考问题的方式。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2071942|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|$]]

Ask them to write an app to return the factors of a given number. It's easy to do and hard to do well in a short period of time. You can see their style and the way they think through problems in a small amount of time.

blocks|key|1858304|text|假设:我想使用一个整数来存储多个值。描述一下它是如何工作的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1858305|如果他们没有关于位掩码和操作的线索，他们可能无法解决其他问题。|1858306|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|$]]

How about:
I want to use a single integer to store multiple values. Describe how that would work.

If they don't have a clue about bit masks and operations, they probably can't solve other problems.

blocks|key|1858463|text|找到质数列表是一个相当常见的问题，但它仍然需要一些思考，人们可能会给出不同程度的答案。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1858464|您还会惊讶于有多少人在努力实现Map/Dictionary类型的数据结构。|1858465|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|$]]

Find a list of primes is a fairly common question but it still requires some thought and there are varying degrees of answers people might give.

You would also be surprised how many people struggle to implement a Map/Dictionary type data-structure.

blocks|key|2072578|text|我发现检查一个字符串是否为回文是一个非常简单的方法，它可以是一个不错的除草器。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2072579|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|$]]

I've found checking a string if it is a palindrome is a pretty simple one that can be a decent weeder.

blocks|key|1858739|text|请从C%2B%2B常见问题解答精简版查看6.14：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1858740|http://www.parashift.com/c%2B%2B-faq-lite/big-picture.html|offset|length|1858741|entityMap|0|LINK|mutability|MUTABLE|url|http://www.parashift.com/c%2B%2B-faq-lite/big-picture.html^0|0|0|1I|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

Check out 6.14 from the C++ FAQ Lite:

<a href="http://www.parashift.com/c++-faq-lite/big-picture.html" rel="nofollow noreferrer">http://www.parashift.com/c++-faq-lite/big-picture.html</a>

blocks|key|1858905|text|如果是C/C%2B%2B面试，要确保对方了解指针。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1858906|通用-简单算法(单/双链接列表)。询问在每种情况下添加的复杂性(在开始时，在结束时，优化...)？|1858907|(一般)如何从仅有3*N/2比较的数组(N大小)中找到最小和最大值？|1858908|C/C%2B%2B：如何将多个“strcat”优化为一个缓冲区？|1858909|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|K|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|L|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|M|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|I|$]]

If it is a C/C++ interview make sure the person knows about pointers.

General - simple algorithm ([single/double]linked list). Ask about complexity of adding in each case (at the begining, at the end, optimizations ...) ?

(General) How do you find min and max from an array (N size) with just 3*N/2 comparisons?

C/C++: How would you optimize multiple "strcat"s to a buffer ?

blocks|key|1859128|text|也许这没有直接回答您的问题，但我不确定您是否需要提出另一个问题。除了“容易记忆”之外，FizzBuzz问题就是简单的“容易”，这就是要点。如果你面试的人是FizzBuzz“熟知”的那类人，那么他们就是FizzBuzz型问题不会过滤掉的那类人。这并不意味着你可以当场雇用他们，但这确实意味着他们应该能够轻而易举地通过面试，并进入面试的核心。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1859129|换句话说，任何花时间阅读Coding+Horror的人都值得进一步采访。只要让他们非常快速地写出解决方案，简要地讨论一下(例如，如何测试它？)，然后进入下一个问题。正如这篇文章所说，“有那么多候选人不能完成最简单的编程任务，这真的很令人惊讶。”|offset|length|1859130|entityMap|0|LINK|mutability|MUTABLE|url|http://www.codinghorror.com/blog/archives/000781.html^0|0|C|D|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

Perhaps this does not answer your question directly, but I am not certain you need to come up with another problem. Besides being "easy to memorize", the FizzBuzz question is just plain "easy", and that is the point. If the person you are interviewing is in the class of people to which FizzBuzz is "well-known", then they are in the class of people that a FizzBuzz-type question would not filter out. That does not mean that you hire them on the spot, but it does mean that they should be able to breeze through it and get on to the meat of the interview.

To put it another way, anybody who takes the time to read <a href="http://www.codinghorror.com/blog/archives/000781.html" rel="noreferrer">Coding Horror</a> is worth interviewing further. Just have them write out the solution really quickly, discuss it briefly (e.g., How do you test this?), and then move on to the next question. And as the article says, "it is genuinely astonishing how many candidates are incapable of the simplest programming tasks."

blocks|key|2073146|text|我已经要求我的候选人创建一个程序，用他们选择的任何伪语言计算给定数字的factorial。这是一个相当容易解决的问题，而且它很适合关于递归的自然后续问题(经常会被问到)。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2073147|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Factorial^0|Z|9|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]]]]

I have asked my candidates to create a program to calculate <a href="http://en.wikipedia.org/wiki/Factorial" rel="nofollow noreferrer">factorial</a> of a given number in any pseudo language of their choice. It is a fairly easy problem to solve and it lends itself well to the natural followup quistions (that could often be asked) about recursion.

Anybody have any good FizzBuzz type questions that are not the FizzBuzz problem?

I am interviewing someone and FB is relatively well known and not that hard to memorize, so my first stop in a search for ideas is my new addiction SO.

Alternate FizzBuzz Questions

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

谁有什么不是FizzBuzz问题的好的FizzBuzz类型的问题？我正在面试一个人，FB相对来说比较有名，也不难记住，所以我寻找想法的第一站就是我的新上瘾。

问备用FizzBuzz问题
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问备用FizzBuzz问题EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问备用FizzBuzz问题
EN