Easy Java solution || beginner friendly
Please UPVOTE if you like my solution!\n\nclass Solution {\n    public int numSubseq(int[] nums, int target) {\n        Arrays.sort(nums);\n        int mod = 10
Please **UPVOTE** if you like my solution!\n```\nclass Solution {\n    public int numSubseq(int[] nums, int target) {\n        Arrays.sort(nums);\n        int mod = 1000000007;\n        int [] arr =new int[nums.length];\n        arr[0]=1;\n        for(int i=1;i<nums.length;i++){\n            arr[i] = (arr[i-1]*2)%mod;\n        }\n\n        int i = 0;\n        int j = nums.length-1;\n        int count = 0;\n        while(i<=j){\n            if(nums[i]+nums[j]<=target){\n                count+=arr[j-i];\n                count%=mod;\n                i++;\n            }\n            else\n                j--;\n        }\n        return count;\n    }\n}\n```
['Two Pointers', 'Sorting', 'Java']