Easy Python solution using || Bisect
Code\n\nclass Solution:\n    def successfulPairs(self, spells: List[int], potions: List[int], success: int) -> List[int]:\n        lst=[]\n        potions.sort(
# Code\n```\nclass Solution:\n    def successfulPairs(self, spells: List[int], potions: List[int], success: int) -> List[int]:\n        lst=[]\n        potions.sort()\n        ln=len(potions)\n        for i in spells:\n            t = bisect_left(potions, success/i)\n            lst.append(ln-t)\n        return lst\n```
['Array', 'Two Pointers', 'Binary Search', 'Python3']