[Python3] Brute Force in TLE passing 82/112 test cases
This is just a brute force way to solve the problem. Obviously, this gets into time limit exceed, but I just want to share this solution for beginners like me f
This is just a brute force way to solve the problem. Obviously, this gets into time limit exceed, but I just want to share this solution for beginners like me for technical interview. \n\nPassed 82/112 test cases.\n\nCorrect me if I need to edit this solution! :)\n\n```\nclass Solution:\n    def kthSmallestProduct(self, nums1: List[int], nums2: List[int], k: int) -> int:\n        result = []\n        for i in range(len(nums1)):\n            for j in range(len(nums2)):\n                temp = nums1[i]*nums2[j]\n                result.append(temp)\n        result.sort()\n        return result[k-1]\n```
['Python', 'Python3']