Python || 96.44% Faster || Two Pointers || Sorting
\nclass Solution:\n    def numSubseq(self, nums: List[int], target: int) -> int:\n        i,j=0,len(nums)-1\n        c,mod=0,(10**9+7)\n        nums.sort()\n   
```\nclass Solution:\n    def numSubseq(self, nums: List[int], target: int) -> int:\n        i,j=0,len(nums)-1\n        c,mod=0,(10**9+7)\n        nums.sort()\n        while i<=j:\n            if nums[i]+nums[j]<=target:\n                c+=pow(2,(j-i),mod)\n                i+=1\n            else:\n                j-=1\n        return c%mod\n```\n\n**An upvote will be encouraging**
['Two Pointers', 'Sorting', 'Python', 'Python3']