add_top_1_dp

[holisound]

(Put an X inside the [ ] to denote check mark [X].)

• If creating a new file :

  • added links to it in the README files ?
  • included tests with it ?
  • added description (overview of algorithm, time and space compleixty, and possible edge case) in docstrings ?

• if done some changes :

  • wrote short description in the PR explaining what the changes do ?
  • Fixes #[issue number] if related to any issue

• other

[coveralls]

Pull Request Test Coverage Report for Build 744

• 16 of 16 (100.0%) changed or added relevant lines in 2 files are covered.
• 1 unchanged line in 1 file lost coverage.
• Overall coverage increased (+0.08%) to 71.627%

---

Files with Coverage Reduction	New Missed Lines	%
algorithms/linkedlist/is_palindrome.py	1	93.33%

Totals
Change from base Build 742:	0.08%
Covered Lines:	4322
Relevant Lines:	6034

---

💛 - Coveralls

[goswami-rahul]

Hi! Sorry for late response. Can you please explain what your algorithm is doing and also rename it and save as some descriptive name with explainations? Thanks.

[holisound]

Hi, my algorithm is another solution to the arrays problem top 1, which
counting elements and updating the result during once iteration. Comparing with the available solution, I think it will be more efficient.

[keon]

@edwardw1987 why did you close this PR?

[holisound]

Hi, Keno
It's superised to catch your message!
The project you launched is really cool and awesome.
I am a python developer who has been interested in algorithm, but I didn't find a right way to contribute code snippets. (my first pull request)
Sorry for the closing!