Day 2 assignment by Akash Kumar

Akash Kumar/1.GroupAnagrams/soln.c++

@@ -0,0 +1,43 @@
+//LeetCode Environment
+//Time Complexity=O(N∗M)
+//Space Complexity=O(N∗M)
+
+class Solution {
+public:
+
+    string generate(string word)
+    {
+        int arr[26]={0};
+        for(char ch:word)
+        {
+            arr[ch-'a']++;
+        }
+        string new_word="";
+        for(int i=0;i<26;i++)
+        {
+            int freq=arr[i];
+            if(freq>0)
+            {
+                new_word+=string(freq,i+'a');
+            }
+        }
+        return new_word;
+    }
+    vector<vector<string>> groupAnagrams(vector<string>& strs) 
+    {
+        unordered_map<string, vector<string>>mp;
+        vector<vector<string>>result;
+        for(int i=0;i<strs.size();i++)
+        {
+            string word=strs[i];
+            string new_word=generate(word);
+            mp[new_word].push_back(word);
+        }
+        for(auto it:mp)
+        {
+            result.push_back(it.second);
+        }
+        return result;
+
+    }
+};

Akash Kumar/2.MaxConsecutiveOnes3/soln.c++

@@ -0,0 +1,29 @@
+//LeetCode Environment
+//Time Complexity=O(N)
+//Space Complexity=O(1)
+
+class Solution {
+ public:
+  int longestOnes(vector<int>& nums, int k) 
+  {
+    int ans=0;
+    int l=0;
+    for (int r=0;r<nums.size();r++) 
+    {
+        if (nums[r]==0) 
+        {
+            k--;
+        }
+        if (k<0) 
+        {
+            if (nums[l]==0) 
+            {
+                k++;
+            }
+            l++;
+        }
+        ans=max(ans,r-l+1);
+    }
+    return ans;
+  }
+};