# Python program to find all possible pairs with a given sum

| | |

👻 Check our latest review to choose the best laptop for Machine Learning engineers and Deep learning tasks!

Examples :

`  Input:  lst = [1, 5, 3, 7, 9] K = 12  Output:  [(5, 7), (3, 9)]  Input:  lst = [2, 1, 5, 7, -1, 4] K = 6  Output:  [(2, 4), (1, 5), (7, -1)] `

Method # 1: Pythonic Naive

This is a naive approach to the above problem. First, we take an empty list & # 39; res & # 39; and start the loop and loop through each element of the given list of integers. At each iteration, extract the element, store it in "num", find the remaining difference for the sum K and check if there is a difference in the given list or not.

 ` # Python3 program for finding all pairs in ` ` # list of integers with a given amount ` ` def ` ` findPairs (lst, K): ` ` res ` ` = ` ` [] ` ` while ` ` lst: ` ` num ` ` = ` ` lst.pop () ` ` diff ` ` = ` ` K ` ` - ` ` num ` ` if ` ` diff ` ` in ` ` lst: ` ` res.append ((diff, num)) ` ` ` ` res.reverse () ` ` ` ` return ` ` res ` ` ` ` # Driver code ` ` lst ` ` = ` ` [` ` 1 ` `, ` ` 5 ` `, ` ` 3 ` `, ` ` 7 ` `, ` ` 9 ` `] ` ` K ` ` = ` ` 12 ` ` print ` ` (findPairs (lst, K)) `

Exit:

` [(5, 7) , (3, 9)] `

Method # 2: Using `collections.Counter`

This approach follows the same method as which was discussed above using ` collections.Counter `.

Exit:

` [(5, 7), (3, 9)] `

Method # 3: ` itertools.combinations ` (Naive Method)

This is a naive approach to using ` itertools.combinations `. We use a for loop to go through each combination and find the one we want.

 ` # Python3 program to find all pairs in ` ` # list of integers with a given amount ` ` from ` ` collections ` ` import ` ` Counter ` ` ` ` def ` ` findPairs (lst, K): ` ` res ` ` = ` ` [] ` ` count ` ` = ` ` Counter (lst) ` ` for ` ` x ` ` in ` ` lst: ` ` y ` ` = ` ` K ` ` - ` ` x ` ` if ` ` (x! ` ` = ` ` y ` ` and ` ` count [y]) ` ` or ` ` (x ` ` = ` ` = ` ` y ` ` and ` ` count [y] & gt; ` ` 1 ` `): ` ` ` ` res.append ((x, y)) ` ` count.subtract ((x, y)) ` ` ` ` return ` ` res ` ` ` ` # Driver code ` ` lst ` ` = ` ` [` ` 1 ` `, ` ` 5 ` `, ` ` 3 ` `, ` ` 7 ` `, ` ` 9 ` `] ` ` K ` ` = ` ` 12 ` print ` (findPairs (lst, K)) `
 ` # Python3 program to find all pairs in ` ` # list of integers with a given amount ` ` from ` ` itertools ` ` import ` ` combinations ` ` def ` ` findPairs (lst, K) : ` ` res ` ` = ` ` [] ` ` for ` ` var ` ` in ` ` combinations (lst, ` ` 2 ` `): ` ` if ` ` var [` ` 0 ` `] ` ` + ` ` var [` ` 1 ` `] ` ` = ` ` = ` ` K: ` ` res.append ((var [` ` 0 ` `], var [` ` 1 ` `])) ` ` ` ` return ` ` res ` ` # Driver code ` ` lst ` ` = ` ` [` ` 1 ` `, ` ` 5 ` `, ` ` 3 ` `, ` ` 7 ` `, ` ` 9 ` `] ` ` K ` ` = ` ` 12 ` ` print ` ` (findPairs (lst, K)) `

Exit:

` [(5, 7), (3, 9)] `

Method # 4: ` itertools.combinations ` (effective method)

 ` # Python3 program to find all pairs in ` ` # list of integers with a given sum ` ` from ` ` itertools ` ` import combinations `` def findPairs (lst, K): return [pair for pair in combinations (lst, 2 ) if sum (pair) = = K] # Driver code lst = [ 1 , 5 , 3 , 7 , 9 ] K = 12 print (findPairs (lst, K)) `

Exit:

` [(5, 7), (3, 9)] `

👻 Read also: what is the best laptop for engineering students?

Finding the index of an item in a list

Given a list `["foo", "bar", "baz"]` and an item in the list `"bar"`, how do I get its index (`1`) in Python?

3740

``````>>> ["foo", "bar", "baz"].index("bar")
1
``````

Reference: Data Structures > More on Lists

# Caveats follow

Note that while this is perhaps the cleanest way to answer the question as asked, `index` is a rather weak component of the `list` API, and I can"t remember the last time I used it in anger. It"s been pointed out to me in the comments that because this answer is heavily referenced, it should be made more complete. Some caveats about `list.index` follow. It is probably worth initially taking a look at the documentation for it:

``````list.index(x[, start[, end]])
``````

Return zero-based index in the list of the first item whose value is equal to x. Raises a `ValueError` if there is no such item.

The optional arguments start and end are interpreted as in the slice notation and are used to limit the search to a particular subsequence of the list. The returned index is computed relative to the beginning of the full sequence rather than the start argument.

## Linear time-complexity in list length

An `index` call checks every element of the list in order, until it finds a match. If your list is long, and you don"t know roughly where in the list it occurs, this search could become a bottleneck. In that case, you should consider a different data structure. Note that if you know roughly where to find the match, you can give `index` a hint. For instance, in this snippet, `l.index(999_999, 999_990, 1_000_000)` is roughly five orders of magnitude faster than straight `l.index(999_999)`, because the former only has to search 10 entries, while the latter searches a million:

``````>>> import timeit
>>> timeit.timeit("l.index(999_999)", setup="l = list(range(0, 1_000_000))", number=1000)
9.356267921015387
>>> timeit.timeit("l.index(999_999, 999_990, 1_000_000)", setup="l = list(range(0, 1_000_000))", number=1000)
0.0004404920036904514

``````

## Only returns the index of the first match to its argument

A call to `index` searches through the list in order until it finds a match, and stops there. If you expect to need indices of more matches, you should use a list comprehension, or generator expression.

``````>>> [1, 1].index(1)
0
>>> [i for i, e in enumerate([1, 2, 1]) if e == 1]
[0, 2]
>>> g = (i for i, e in enumerate([1, 2, 1]) if e == 1)
>>> next(g)
0
>>> next(g)
2
``````

Most places where I once would have used `index`, I now use a list comprehension or generator expression because they"re more generalizable. So if you"re considering reaching for `index`, take a look at these excellent Python features.

## Throws if element not present in list

A call to `index` results in a `ValueError` if the item"s not present.

``````>>> [1, 1].index(2)
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
ValueError: 2 is not in list
``````

If the item might not be present in the list, you should either

1. Check for it first with `item in my_list` (clean, readable approach), or
2. Wrap the `index` call in a `try/except` block which catches `ValueError` (probably faster, at least when the list to search is long, and the item is usually present.)

3740

One thing that is really helpful in learning Python is to use the interactive help function:

``````>>> help(["foo", "bar", "baz"])
Help on list object:

class list(object)
...

|
|  index(...)
|      L.index(value, [start, [stop]]) -> integer -- return first index of value
|
``````

which will often lead you to the method you are looking for.

3740

The majority of answers explain how to find a single index, but their methods do not return multiple indexes if the item is in the list multiple times. Use `enumerate()`:

``````for i, j in enumerate(["foo", "bar", "baz"]):
if j == "bar":
print(i)
``````

The `index()` function only returns the first occurrence, while `enumerate()` returns all occurrences.

As a list comprehension:

``````[i for i, j in enumerate(["foo", "bar", "baz"]) if j == "bar"]
``````

Here"s also another small solution with `itertools.count()` (which is pretty much the same approach as enumerate):

``````from itertools import izip as zip, count # izip for maximum efficiency
[i for i, j in zip(count(), ["foo", "bar", "baz"]) if j == "bar"]
``````

This is more efficient for larger lists than using `enumerate()`:

``````\$ python -m timeit -s "from itertools import izip as zip, count" "[i for i, j in zip(count(), ["foo", "bar", "baz"]*500) if j == "bar"]"
10000 loops, best of 3: 174 usec per loop
\$ python -m timeit "[i for i, j in enumerate(["foo", "bar", "baz"]*500) if j == "bar"]"
10000 loops, best of 3: 196 usec per loop
``````

We hope this article has helped you to resolve the problem. Apart from Python program to find all possible pairs with a given sum, check other Counters-related topics.

Want to excel in Python? See our review of the best Python online courses 2022. If you are interested in Data Science, check also how to learn programming in R.

By the way, this material is also available in other languages:

Frank Chamberlet

Abu Dhabi | 2022-12-10

Maybe there are another answers? What Python program to find all possible pairs with a given sum exactly means?. Will use it in my bachelor thesis

Walter OConnell

Massachussetts | 2022-12-10

I was preparing for my coding interview, thanks for clarifying this - Python program to find all possible pairs with a given sum in Python is not the simplest one. I am just not quite sure it is the best method

Jan Danburry

Shanghai | 2022-12-10

Simply put and clear. Thank you for sharing. Python program to find all possible pairs with a given sum and other issues with sin was always my weak point 😁. I just hope that will not emerge anymore

## Shop

Learn programming in R: courses

\$

Best Python online courses for 2022

\$

Best laptop for Fortnite

\$

Best laptop for Excel

\$

Best laptop for Solidworks

\$

Best laptop for Roblox

\$

Best computer for crypto mining

\$

Best laptop for Sims 4

\$

Latest questions

NUMPYNUMPY

Common xlabel/ylabel for matplotlib subplots

NUMPYNUMPY

How to specify multiple return types using type-hints

NUMPYNUMPY

Why do I get "Pickle - EOFError: Ran out of input" reading an empty file?

NUMPYNUMPY

Flake8: Ignore specific warning for entire file

NUMPYNUMPY

glob exclude pattern

NUMPYNUMPY

How to avoid HTTP error 429 (Too Many Requests) python

NUMPYNUMPY

Python CSV error: line contains NULL byte

NUMPYNUMPY

csv.Error: iterator should return strings, not bytes

## Wiki

Python | How to copy data from one Excel sheet to another

Common xlabel/ylabel for matplotlib subplots

Check if one list is a subset of another in Python

How to specify multiple return types using type-hints

Printing words vertically in Python

Python Extract words from a given string

Cyclic redundancy check in Python

Finding mean, median, mode in Python without libraries