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.

Sign up for GitHub

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

Jump to bottom

3 sum problem #326

Open

sahelii opened this issue Oct 27, 2022 · 1 comment

sahelii commented Oct 27, 2022

Given an integer array arr of size n, find all magic triplets in it.

Magic triplet is a group of three numbers whose sum is zero.

Note that magic triplets may or may not be made of consecutive numbers in arr.

Author

sahelii commented Oct 27, 2022

Can you assign this issue to me?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment