.

Author: jaygajera17

Group_anagram.cpp

@@ -0,0 +1,23 @@
+/* https://leetcode.com/problems/group-anagrams/ */
+
+
+class Solution {
+public:
+    vector<vector<string>> groupAnagrams(vector<string>& strs) {
+        vector<vector<string>> ans;
+        unordered_map<string,vector<string>>m;
+        for(string s:strs)
+        {
+            string temp=s;
+            sort(temp.begin(),temp.end());
+            m[temp].push_back(s);
+        }
+        
+        for(auto i:m)
+        {
+            ans.push_back(i.second);
+        }
+        return ans;
+
+    }
+};

Permutation_in_string.cpp

@@ -0,0 +1,35 @@
+// https://leetcode.com/problems/permutation-in-string/description/
+
+class Solution {
+public:
+    bool checkInclusion(string p, string s) {
+        
+         int n=s.length();
+	    int m=p.length();
+	    vector<int>mt(26,0);
+	    vector<int>mp(26,0);
+        if(m>n) return false;
+	    int count=0;
+	    for(int i=0;i<m;i++) //make 1st window of pattern size
+	    {
+	        mp[p[i]-'a']++;
+	        mt[s[i]-'a']++;
+	    }
+	    int left=0;
+	    int right=m-1;
+	    while(right<n)
+	   {
+	       if(mt==mp) return true;
+	       
+	       right++;
+	       if(right!=n)
+	       {
+	           mt[s[right]-'a']++; //update the maping of window as window shift right side
+	           
+	           mt[s[left++]-'a']--;
+	       }
+	   }
+
+        return false;
+    }
+};

Remove_Palindrome_Subsequences.cpp

@@ -0,0 +1,19 @@
+/* https://leetcode.com/problems/remove-palindromic-subsequences/description/ */
+
+class Solution {
+public:
+    int removePalindromeSub(string s) {
+        int i=0;
+        int j=s.length()-1;
+
+        while(i<j)
+        {
+            if(s[i]!=s[j]) return 2; // subsequence-  remove all a then b if it is not palindrome 2 step.
+            i++;
+            j--;
+
+        }
+        return 1;
+
+    }
+};

Repeated_DNA_Sequences.cpp

@@ -0,0 +1,23 @@
+// https://leetcode.com/problems/repeated-dna-sequences/
+
+class Solution {
+public:
+    vector<string> findRepeatedDnaSequences(string s) {
+        vector<string>v;
+        unordered_map<string,int>m;
+        if(s.length()<=10) return v;
+        for(int i=0;i<=s.size()-10;i++)
+        {
+            string str=s.substr(i,10);
+            m[str]++;
+        }
+        for(auto it=m.begin();it!=m.end();it++)
+        {
+            if(it->second>1) 
+            {
+                v.push_back(it->first);
+            }
+        }
+        return v;
+    }
+};

aa.cpp

@@ -0,0 +1,29 @@
+/* https://practice.geeksforgeeks.org/problems/count-occurences-of-anagrams5839/1 */
+
+int search(string p, string s) {
+	    // code here
+	    int n=s.length();
+	    int m=p.length();
+	    vector<int>mt(26,0);
+	    vector<int>mp(26,0);
+	    int count=0;
+	    for(int i=0;i<m;i++)
+	    {
+	        mp[p[i]-'a']++;
+	        mt[s[i]-'a']++;
+	    }
+	    int left=0;
+	    int right=m-1;
+	    while(right<n)
+	   {
+	       if(mt==mp) count++;
+	       
+	       right++;
+	       if(right!=n)
+	       {
+	           mt[s[right]-'a']++;
+	           mt[s[left++]-'a']--;
+	       }
+	   }
+	   return count;
+    }

anagram_occurence.cpp

@@ -0,0 +1,24 @@
+/* https://leetcode.com/problems/longest-palindrome/ */
+
+class Solution {
+public:
+    int longestPalindrome(string s) {
+        unordered_map<char,int>m;
+        for(int i=0;i<s.length();i++)
+        {
+            m[s[i]]++;
+        }
+       int count=0;
+        for(auto i:m)
+        {
+            if(i.second%2!=0)
+            {
+                count++;
+            }
+        }
+        if(count>1)  // if there is  odd times appear char we can only fit one in the middle , rest of are even which can make palindrome , so total length-odd+1
+        return s.length()-count+1;
+        else
+        return s.length();  //there is no odd number of times character then it is even number's string which is definitely palindrome
+    }
+};

longest_palindromecpp

@@ -0,0 +1,48 @@
+/* https://leetcode.com/problems/sort-the-people/description/ */
+
+/* STL */
+class Solution {
+public:
+
+    vector<string> sortPeople(vector<string>& names, vector<int>& heights) {
+        map<int,string>m;
+        for(int i=0;i<names.size();i++)
+        {
+          m[heights[i]]=names[i];
+
+        }
+        vector<string>ans;
+       // reverse(m.begin(),m.end());
+        for(auto i=m.rbegin();i!=m.rend();i++)
+        {
+            ans.push_back(i->second);
+        }
+        return ans;
+    }
+};
+
+
+/* using pair*/
+class Solution {
+public:
+
+    vector<string> sortPeople(vector<string>& names, vector<int>& heights) {
+        vector<pair<int,string>>v;
+        for(int i=0;i<names.size();i++)
+        {
+            v.push_back(make_pair(heights[i],names[i]));
+        }
+        sort(v.begin(),v.end());
+        reverse(v.begin(),v.end());
+        vector<string> ans;
+        for(int i=0;i<names.size();i++)
+        {
+            ans.push_back(v[i].second);
+        }
+        for(auto i:v)
+        {
+            cout<<i.second<<" ";
+        }
+        return ans;
+    }
+};