---
title: "Discussion on \"Three Sum - LeetCode Problem\" | Hashnode"
description: "Discussion on \"Three Sum - LeetCode Problem\". given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0."
url: "https://hashnode.com/posts/three-sum-leetcode-problem/6410407fd840b7fbcc774ae2"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Three Sum - LeetCode Problem](https://blog.eyucoder.com/three-sum-leetcode-problem?utm_source=hashnode&utm_medium=feed)

given an integer array nums, return all the triplets \[nums\[i\], nums\[j\], nums\[k\]\] such that i != j, i != k, and j != k, and nums\[i\] + nums\[j\] + nums\[k\] == 0.

Mar 14, 2023 · 3 min read · blog.eyucoder.com  
Read the article

-   [#two-pointers](https://hashnode.com/tag/two-pointers)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#python](https://hashnode.com/tag/python)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Eyuel Dan⭐⭐⭐](https://hashnode.com/@Eyuel)

@Eyuel

  
[View profile](https://hashnode.com/@Eyuel)

Android | Python | React | GPT

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
