You are given a number N. You need to check if it can be written as a sum of k prime numbers.
You are given a number N. You need to check if it can be written as a sum of k prime numbers.
题目类型: 技术面试题
这是一道技术面试题，常见于澳洲IT公司面试中。
难度: easy
标签: interviewbit, goldman-sachs, company-specific
目标公司: Goldman Sachs
参考答案摘要
For example, Input : N = 5, k = 2 Output : True Explanation : 10 can be written as 5 + 5 Input : N = 2, k = 2 Output : False Approach: We use the Goldbach Conjecture for solving this problem. Goldbach...
答题技巧
技术面试题建议先理清思路再作答，从基础概念讲起，逐步深入。可以结合实际项目经验解释技术原理，展示你的理解深度和实践能力。
本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案、收藏题目并进行模拟面试练习。
