Easiest solution ever
IntuitionEasiest solution everApproachJust using only two for loopComplexity

Time complexity:
O(n^2)


Space complexity:
O(1)

Code
# Intuition
# ***Easiest solution ever***

# Approach
Just using only two for loop

# Complexity
- Time complexity:
O(n^2)

- Space complexity:
O(1)

# Code
```cpp []
class Solution {
public:
    int countPairs(vector<int>& nums, int target) {
        int count=0;
        for(int i=0;i<nums.size();i++){
            for(int j =i+1;j<nums.size();j++){
                if(nums[i]+nums[j]<target){
                    count++;
                }
            }
        }
        return count;
    }
};
```
['C++']