Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

brute force solution to smallest palindrome #4

Merged
merged 1 commit into from
Sep 4, 2018
Merged

Conversation

vaskoz
Copy link
Owner

@vaskoz vaskoz commented Sep 3, 2018

Resolves #3

@vaskoz
Copy link
Owner Author

vaskoz commented Sep 3, 2018

Brute force runs in O(N^2) time.

@coveralls
Copy link

coveralls commented Sep 3, 2018

Pull Request Test Coverage Report for Build 11

  • 0 of 0 changed or added relevant lines in 0 files are covered.
  • No unchanged relevant lines lost coverage.
  • Overall coverage remained the same at 100.0%

Totals Coverage Status
Change from base Build 9: 0.0%
Covered Lines: 25
Relevant Lines: 25

💛 - Coveralls

@vaskoz vaskoz merged commit e1fb0c1 into master Sep 4, 2018
@vaskoz vaskoz deleted the smallpalindrome branch September 4, 2018 00:18
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants