HF RL Explorer

Task: Implement nth Fibonacci Number in Sublinear Time

Task: Implement nth Fibonacci Number in Sublinear Time: a task in Terminal-Lego-15k (Harbor dataset). Your task is to implement an algorithm that computes the nth Fibonacci number in sublinear time complexity (better than O(n)).

The task

Your task is to implement an algorithm that computes the nth Fibonacci number in **sublinear time complexity** (better than O(n)).

Part of PrimeIntellect/Terminal-Lego-15k.