# Python | Prefix sum list

Nowadays, especially in the field of competitive programming, the utility of computing prefix sum is quite popular and features in many problems. Hence, having a one-liner solution to it would possess a great help. Let’s discuss certain way in which this problem can be solved.

Method #1: Using list comprehension + sum() + list slicing

This problem can be solved using the combination of above two functions in which we use list comprehension to extend logic to each element, sum function to get the sum along, slicing is used to get sum till the particular index.

 `# Python3 code to demonstrate ` `# prefix sum list ` `# using list comprehension + sum() + list slicing  ` ` `  `# initializing list ` `test_list ``=` `[``3``, ``4``, ``1``, ``7``, ``9``, ``1``] ` ` `  `# printing original list ` `print``(``"The original list : "` `+` `str``(test_list)) ` ` `  `# using list comprehension + sum() + list slicing ` `# prefix sum list ` `res ``=` `[``sum``(test_list[ : i ``+` `1``]) ``for` `i ``in` `range``(``len``(test_list))] ` ` `  `# print result ` `print``(``"The prefix sum list is : "` `+` `str``(res)) `

Output :

```The original list : [3, 4, 1, 7, 9, 1]
The prefix sum list is : [3, 7, 8, 15, 24, 25]
```

Method #2: Using `accumulate(iterable)` method.

 `# function to find cumulative sum of list ` `from` `itertools ``import` `accumulate  ` ` `  `def` `cumulativeSum(lst):  ` `    ``print` `(``list``(accumulate(lst)))  ` ` `  `# Driver program  ` `if` `__name__ ``=``=` `"__main__"``:  ` `    ``lst ``=` `[``3``, ``4``, ``1``, ``7``, ``9``, ``1``] ` `    ``cumulativeSum(lst)  `

Output:

`[3, 7, 8, 15, 24, 25]`

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.