dynamic_programming.fibonacci
=============================

.. py:module:: dynamic_programming.fibonacci

.. autoapi-nested-parse::

   This is a pure Python implementation of Dynamic Programming solution to the fibonacci
   sequence problem.



Classes
-------

.. autoapisummary::

   dynamic_programming.fibonacci.Fibonacci


Functions
---------

.. autoapisummary::

   dynamic_programming.fibonacci.main


Module Contents
---------------

.. py:class:: Fibonacci

   .. py:method:: get(index: int) -> list

      Get the Fibonacci number of `index`. If the number does not exist,
      calculate all missing numbers leading up to the number of `index`.

      >>> Fibonacci().get(10)
      [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
      >>> Fibonacci().get(5)
      [0, 1, 1, 2, 3]



   .. py:attribute:: sequence
      :value: [0, 1]



.. py:function:: main() -> None