leetcode new problems

This commit is contained in:
2026-02-11 14:48:41 +05:30
parent 192ce44a81
commit 0f52d46c67
29 changed files with 658 additions and 5 deletions
+28
View File
@@ -0,0 +1,28 @@
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
int n = nums.size();
sort(nums.begin(), nums.end());
set<vector<int>> set;
vector<vector<int>> output;
for(int i=0; i<n-3; i++){
for(int j=i+1; j<n-2; j++){
for(int k=j+1; k<n-1; k++){
for(int l=k+1; l<n; l++){
if((long long)nums[i] + (long long)nums[j] + (long long)nums[k] +
(long long)nums[l] == target){
set.insert({nums[i], nums[j], nums[k], nums[l]});
}
}
}
}
}
for(auto it : set){
output.push_back(it);
}
return output;
}
};
// TC : O(n^4)
// SC : O(n)