Skip to content

Implement Unique Quadruplets Finder (Four Sum Problem) #5826

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

Closed
wants to merge 2 commits into from

Conversation

akarsh-Manodee
Copy link

@akarsh-Manodee akarsh-Manodee commented Oct 14, 2024

  • Added a new class UniqueQuadruplets to solve the Four Sum problem, which finds all unique quadruplets in an array that sum up to a specified target value.
  • Implemented the fourSum method that uses sorting and a two-pointer technique to efficiently identify quadruplets.
  • Added example test cases in the main method to demonstrate functionality and validate the implementation.
  • The solution ensures that duplicate quadruplets are not included in the results by skipping over duplicate values during the iteration.
  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

- Added a new class `UniqueQuadruplets` to solve the Four Sum problem, which finds all unique quadruplets in an array that sum up to a specified target value.
- Implemented the `fourSum` method that uses sorting and a two-pointer technique to efficiently identify quadruplets.
- Added example test cases in the `main` method to demonstrate functionality and validate the implementation.
- The solution ensures that duplicate quadruplets are not included in the results by skipping over duplicate values during the iteration.
@codecov-commenter
Copy link

codecov-commenter commented Oct 14, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 65.97%. Comparing base (3af4cfd) to head (a8683b9).

Additional details and impacted files
@@            Coverage Diff            @@
##             master    #5826   +/-   ##
=========================================
  Coverage     65.96%   65.97%           
- Complexity     4386     4387    +1     
=========================================
  Files           602      602           
  Lines         16783    16783           
  Branches       3226     3226           
=========================================
+ Hits          11071    11072    +1     
  Misses         5266     5266           
+ Partials        446      445    -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@siriak
Copy link
Member

siriak commented Oct 26, 2024

We don't add leetcode problems

@siriak siriak closed this Oct 26, 2024
@akarsh-Manodee akarsh-Manodee deleted the patch-1 branch October 26, 2024 20:40
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.

3 participants