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

Added solution for Leetcode Problem #15 (3Sum) in Dart #254

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

khushi-hura
Copy link

  • Implemented the threeSum function to find all unique triplets that sum up to zero.
  • Included a time complexity of O(N^2) and space complexity of O(1). [Most Optimized]
  • Added unit tests with edge cases for validation.

Welcome to Dart community

Three Sum Problem:

  • Implemented the problem using two pointer approach.
  • The code is optimized to best of my knowledge.
  • The file is added by the name specified in CONTRIBUTING.md as using '_'.
  • The code is tested to pass all the edge cases.

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 Dart files are placed inside an existing directory.
  • All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.

- Implemented the 	hreeSum function to find all unique triplets that sum up to zero.
- Included a time complexity of O(N^2) and space complexity of O(1).
- Added unit tests with edge cases for validation.
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.

1 participant