Describe your change:

I have added another approach to find nth fibonacci number to this code in DynamicProgramming folder. The code uses iterative approach and no recursion, but used the technique of memoization to hold the dynamic programming paradigm. Added code runs in O(n) time and it uses less space than memoization technique with recursion.

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

References

Fixes issue #1528

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Java files are placed inside an existing directory.
• All filenames are in all uppercase characters with no spaces or dashes.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

I have attached changed code screenshot below.

Do let me know of this PR.

Thanks