From ecef580b8e88a4f8ff12daf268d276a521abc90d Mon Sep 17 00:00:00 2001
From: Durgesh <durgeshpushpakar001@gmail.com>
Date: Fri, 22 Oct 2021 22:09:16 +0530
Subject: [PATCH] Solved 2 Questions from leetcode

1. 3Sum
2. Majority Element
---
 LeetCode/3Sum.cpp             | 42 +++++++++++++++++++++++++++++++++++
 LeetCode/Majority Element.cpp | 24 ++++++++++++++++++++
 2 files changed, 66 insertions(+)
 create mode 100644 LeetCode/3Sum.cpp
 create mode 100644 LeetCode/Majority Element.cpp

diff --git a/LeetCode/3Sum.cpp b/LeetCode/3Sum.cpp
new file mode 100644
index 0000000..9b81dd4
--- /dev/null
+++ b/LeetCode/3Sum.cpp
@@ -0,0 +1,42 @@
+// i      j              k
+// -2 -2 -1 -1 0 0 0 2 2 2
+
+//  i j     k  
+//  1 -1 -1 0
+#include<bits/stdc++.h>
+using namespace std;
+class Solution {
+    public:
+vector<vector<int>> threeSum(vector<int>& nums) {
+    vector<vector<int>>ans;
+    if(nums.size()<=2)return ans;
+    sort(nums.begin(), nums.end());
+    for(int i=0;i<nums.size()-2;i++){
+        if(i!=0 && nums[i]==nums[i-1])continue;        
+        int temp=0-nums[i];
+        int j=i+1, k=(int)nums.size()-1;
+        while(j<k){
+            if(nums[j]+nums[k]==temp){
+                ans.push_back({nums[i], nums[j], nums[k]});
+                while(j<k && nums[j+1]==nums[j])j++;
+                while(j<k && nums[k-1]==nums[k])k--;
+                j++;k--;
+            }
+            else if(nums[k]+nums[j]>temp){
+                k--;
+                if(k>j && k>i)while(nums[k+1]==nums[k])k--;
+            }
+            else if(nums[j]+nums[k]<temp){
+                j++;
+                if(j<k && j<nums.size())while(nums[j-1]==nums[j])j++;
+            }
+        }        
+    }
+    return ans;
+}
+};
+int main()
+{
+
+    return 0;
+}
\ No newline at end of file
diff --git a/LeetCode/Majority Element.cpp b/LeetCode/Majority Element.cpp
new file mode 100644
index 0000000..d8f1ce9
--- /dev/null
+++ b/LeetCode/Majority Element.cpp	
@@ -0,0 +1,24 @@
+// https://leetcode.com/problems/majority-element/
+#include<bits/stdc++.h>
+using namespace std;
+
+class Solution {
+public:
+    int majorityElement(vector<int>& nums) {
+    int element=nums[0];
+    int freq=1;
+    for(int i=1;i<nums.size();i++){
+        if(nums[i]==element){
+            freq++;
+        }
+        else{
+            freq--;
+        }
+        if(freq==0){
+            element=nums[i];
+            freq=1;
+        }
+    }        
+    return element;
+}
+};
\ No newline at end of file