From 39676c67e15263ebd5d5af73b530f0d9ab8af487 Mon Sep 17 00:00:00 2001 From: Akruti Tiwari Date: Mon, 27 Oct 2025 20:52:52 +0530 Subject: [PATCH 1/2] Add fibonacci algorithm in maths folder --- fibonacci.py | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 fibonacci.py diff --git a/fibonacci.py b/fibonacci.py new file mode 100644 index 000000000000..b74f672e9281 --- /dev/null +++ b/fibonacci.py @@ -0,0 +1,13 @@ +def fibonacci(n: int) -> list[int]: + """ + Return first n Fibonacci numbers. + Example: + >>> fibonacci(5) + [0, 1, 1, 2, 3] + """ + if n <= 0: + return [] + fib_seq = [0, 1] + for i in range(2, n): + fib_seq.append(fib_seq[i-1] + fib_seq[i-2]) + return fib_seq[:n] From add4f45b63e4734213ad361532f2f9f2e53a11da Mon Sep 17 00:00:00 2001 From: "pre-commit-ci[bot]" <66853113+pre-commit-ci[bot]@users.noreply.github.com> Date: Mon, 27 Oct 2025 15:24:58 +0000 Subject: [PATCH 2/2] [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --- fibonacci.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/fibonacci.py b/fibonacci.py index b74f672e9281..a556c74bf9b6 100644 --- a/fibonacci.py +++ b/fibonacci.py @@ -9,5 +9,5 @@ def fibonacci(n: int) -> list[int]: return [] fib_seq = [0, 1] for i in range(2, n): - fib_seq.append(fib_seq[i-1] + fib_seq[i-2]) + fib_seq.append(fib_seq[i - 1] + fib_seq[i - 2]) return fib_seq[:n]