Maximum Split of Positive Even Integers LeetCode solution in Python

1
# Runtime: 1817 ms (Top 5.05%) | Memory: 26.8 MB (Top 41.50%)
2
class Solution:
3
    def maximumEvenSplit(self, finalSum: int) -> List[int]:
4
        l = []
5
        if finalSum % 2 != 0:
6
            return l
7
        else:
8
            s = 0
9
            i = 2  # even pointer 2, 4, 6, 8, 10, 12...........
10
            while s < finalSum:
11
                s += i  # sum
12
                l.append(i)  # append the i in list
13
                i += 2
14
            if (
15
                s == finalSum
16
            ):  # if sum s is equal to finalSum then no modidfication required
17
                return l
18
            else:
19
                l.pop(
20
                    l.index(s - finalSum)
21
                )  # Deleting the element which makes s greater than finalSum
22
            return l