Program to find n’th Fibonacci number

Program to find n’th Fibonacci number

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: hard

标签: interviewbit, c, topic-specific, systems

参考答案摘要

Fibonacci sequence is characterized by the fact that every number after the first two is the sum of the two preceding ones. For example, consider below sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, . .. a...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。