✅ [Python] map-zip pythonic solution (with detailed comments)
This solution uses map-zip functional-style approach with comparison of list-vs-set lengths to detect duplicates. It demonstrated 37 ms runtime (97.14%) and use
This [solution](https://leetcode.com/submissions/detail/793039170/) uses map-zip functional-style approach with comparison of list-vs-set lengths to detect duplicates. It demonstrated **37 ms runtime (97.14%)** and used **14.0 MB memory (43.21%)**. Detailed comments are provided.\n\n**IF YOU LIKE THIS SOLUTION, PLEASE UPVOTE.**\n```\nclass Solution:\n    def findSubarrays(self, nums: List[int]) -> bool:\n        # [1] compute sums of neighbours\n        sums = [*map(lambda x: x[0]+x[1], zip(nums[0:-1], nums[1:]))]\n        # [2] check if there are any duplicates\n        return len(sums) != len(set(sums))\n```
['Python']