Two-Pointers-Approach || Easy-to-Understand || JAVA
\n\n# Code\n\nclass Solution {\n    public int countPairs(List<Integer> nums, int target) {\n        int count=0;\n        for(int i=0;i<nums.size();i++){\n    
\n\n# Code\n```\nclass Solution {\n    public int countPairs(List<Integer> nums, int target) {\n        int count=0;\n        for(int i=0;i<nums.size();i++){\n            for(int j=i+1;j<nums.size();j++){\n                if(nums.get(i)+nums.get(j)<target){\n                    count++;\n                }\n            }\n        }\n        return count;\n    }\n}\n```
['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Java']