Leetcode : 3Sum

 Questino:- https://leetcode.com/problems/3sum/

Solution : 

import numpy as np

class Solution:

    def threeSum(self, nums: List[int]) -> List[List[int]]:

        list_length = len(nums)

        final_list = []

        final_list_str = []

        if list_length<3:

            return []

        elif list_length == 3:

            if sum(nums)==0:

                return [nums]

            else:

                return []

        else:

            for len_nest1 in range(0,list_length-2):

                for len_nest2 in range(len_nest1+1,list_length-1):

                    for len_nest3 in range(len_nest2+1,list_length):

                        all_sum = nums[len_nest1]+nums[len_nest2]+nums[len_nest3]

                        if all_sum==0:

                            final_list.append(sorted([nums[len_nest1],nums[len_nest2],nums[len_nest3]]))

        final_list = np.unique(np.array(final_list), axis=0).tolist()

        return final_list

Note:Might not be the final solution as only 308 test case passed out of 311