Calculate Range Function of Fibonacci and Largest Number Using N Coins
Filed under Tekion
The question
Calculate g(l, r) where f(x) is the smallest Fibonacci number greater than or equal to x and g(l,r) is the sum of f(i) from l to r. Also, given N coins and an array of digit costs, find the largest number that can be represented.
No write-up yet. Related questions below have one.
Related Tekion questions
Collected from public candidate posts and coding forums. Updated Nov 2026.