Easy  Solution ||  Two Pointer Approach
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:  O(n^2)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:  O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int countPairs(vector<int>& nums, int target) {\n        int count =0;\n        for( int i= 0 ; i< nums.size();i++){\n             \n             for(int j=i+1; j<nums.size();j++){\n                if(nums[i]+nums[j] < target){\n                    count++;\n                }\n             }\n        }\n        return count;\n    }\n};\n```
['C++']