Beste Easy Solution Bruteforce
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\nIterate And Slicing\n\n# Complexity\n- Time complexity:\nO(N^2)\n\n- Spac
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nIterate And Slicing\n\n# Complexity\n- Time complexity:\nO(N^2)\n\n- Space complexity:\nO(N)\n\n# Code\n```\nclass Solution:\n    def numOfPairs(self, nums: List[str], target: str) -> int:\n        c=0\n        for i in range(len(nums)): \n            lst=[]          \n            lst=nums[:i]+nums[i+1:]\n            for j in lst:\n                if nums[i]+j==target:\n                    c+=1\n        return c            \n```
['Python3']