Easy C++ solution using 2 pointers
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int numSubseq(vector<int>& nums, int target) {\n        const int mod=1e9+7;\n        sort(nums.begin(), nums.end());\n\n        int n=nums.size();       \n        vector<int> pow2mod(n+1, 1);\n        for (int exp=1; exp<=n; exp++)\n            pow2mod[exp]=(pow2mod[exp-1]<<1)%mod;\n        \n        int l=0, r=n-1;\n        int result=0;\n        while(l<=r){\n            if( nums[l]+nums[r]<=target){\n                result=(result+pow2mod[r-l])%mod;\n                l++;\n            }\n            else r--;\n        }\n        return result;\n    }\n};\n```
['Array', 'Two Pointers', 'C++']