diff --git a/Akash Kumar/1.GroupAnagrams/Screenshot .png b/Akash Kumar/1.GroupAnagrams/Screenshot .png
new file mode 100644
index 0000000..4757fc8
Binary files /dev/null and b/Akash Kumar/1.GroupAnagrams/Screenshot .png differ
diff --git a/Akash Kumar/1.GroupAnagrams/soln.c++ b/Akash Kumar/1.GroupAnagrams/soln.c++
new file mode 100644
index 0000000..8fc04bd
--- /dev/null
+++ b/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;
+        
+    }
+};
\ No newline at end of file
diff --git a/Akash Kumar/2.MaxConsecutiveOnes3/Screenshot .png b/Akash Kumar/2.MaxConsecutiveOnes3/Screenshot .png
new file mode 100644
index 0000000..f3736c8
Binary files /dev/null and b/Akash Kumar/2.MaxConsecutiveOnes3/Screenshot .png differ
diff --git a/Akash Kumar/2.MaxConsecutiveOnes3/soln.c++ b/Akash Kumar/2.MaxConsecutiveOnes3/soln.c++
new file mode 100644
index 0000000..23d9b5c
--- /dev/null
+++ b/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;
+  }
+};
diff --git a/Leetcode DSA sheet by Fraz  1.xlsx b/Leetcode DSA sheet by Fraz  1.xlsx
deleted file mode 100644
index 748e670..0000000
Binary files a/Leetcode DSA sheet by Fraz  1.xlsx and /dev/null differ
diff --git a/README.md b/README.md
deleted file mode 100644
index b02d54b..0000000
--- a/README.md
+++ /dev/null
@@ -1,154 +0,0 @@
-
-# 🚀 CodeResite Assignment - Day 2 (Mobile App Development)
-
-Welcome to **Assignment-2** of our Git & GitHub + Mobile App Development series!  
-This task will help you practice version control while solving real coding problems related to mobile app development topics.
-
----
-
-## 🙌 Before You Begin
-
-Please complete the following steps before starting:
-
-1. ⭐ **Star this repository** – Click the star icon at the top-right.
-2. 👤 **Follow the creator** – Click the username [`@Zaidusyy`](https://github.com/Zaidusyy) and press Follow.
-
-These small steps help support our learning community. ❤️
-
----
-
-## 📋 Objective
-
-- Practice using **Git & GitHub**.
-- Solve **2 new coding questions** from the question sheet that you **haven’t submitted yet** in Assignment-1.
-- Submit your code and screenshots in the correct folder structure using a pull request.
-
----
-
-## 📌 Day 2 Assignment
-
-🗓️ **Deadline:** **5th July 2025**  
-✅ **Task:** Choose and solve **any 2 new questions** from the Excel sheet that you did **not solve in Assignment-1**.
-
----
-
-## 🧭 Steps to Complete the Assignment
-
-### ✅ Step 1: Fork This Repository
-1. Click the **Fork** button at the top-right.
-2. This creates your own copy of the repo under your GitHub account.
-
----
-
-### 🖥️ Step 2: Clone Your Fork
-
-1. Go to your forked repo.
-2. Click the green **Code** button → Copy the URL.
-3. Open your terminal or Git Bash and run:
-   ```bash
-   git clone <your-repo-url>
-   ```
-4. Move into the cloned folder:
-   ```bash
-   cd Assignment-2
-   ```
-
----
-
-### 📖 Step 3: Solve 2 New Questions
-
-1. Open the `Assignment-2_Questions.xlsx` file.
-2. Pick any 2 questions you **did not submit in Assignment-1**.
-3. Solve them using your preferred language: Java, Kotlin, Python, C++, etc.
-
----
-
-### 📁 Step 4: Add Your Files
-
-For each question:
-
-- Create a folder like this:
-  ```
-  submissions/<your-name>/<question-title>/
-  ```
-  _Example_: `submissions/AyushSingh/PalindromeCheck/`
-
-Inside each folder, include:
-- ✅ Your solution code (e.g., `solution.java`)
-- 🖼 Screenshot of passing test cases (`screenshot.png`)
-- 📝 Optional: Small `README.md` file explaining your logic
-
-**Folder structure example**:
-```
-submissions/
-└── YourName/
-    ├── Question1/
-    │   ├── solution.py
-    │   └── screenshot.png
-    └── Question2/
-        ├── solution.java
-        └── screenshot.png
-```
-
----
-
-### 🛠️ Step 5: Add, Commit & Push Your Work
-
-1. Add your work:
-   ```bash
-   git add .
-   ```
-
-2. Commit with a clear message:
-   ```bash
-   git commit -m "Day 2 assignment by <Your Name>"
-   ```
-
-3. Push your code:
-   ```bash
-   git push origin main
-   ```
-
----
-
-### 🔁 Step 6: Create a Pull Request
-
-1. Go to your forked repository on GitHub.
-2. Click **“Compare & pull request”**.
-3. Fill in:
-   - Your name
-   - The two new questions you solved
-   - Any additional comments
-4. Submit the pull request to this repository.
-
----
-
-## ❗ Important Guidelines
-
-- Do **not repeat** questions you submitted in Assignment-1.
-- Make sure your **file structure is correct** and includes:
-  - Code file
-  - Screenshot showing test success
-- You can use **LeetCode, HackerRank, CodeChef**, or your own IDE.
-
----
-
-## 🧠 Tools You Can Use
-
-You’re free to solve questions using:
-- Java, Kotlin, Python, C++, C, JavaScript
-- LeetCode, CodeChef, HackerRank, Replit, or VS Code
-
----
-
-## 💬 Need Help?
-
-If you face any issues or confusion:  
-📩 Reach out to our speaker on LinkedIn:  
-🔗 [Zaid Sayyed – LinkedIn](https://www.linkedin.com/in/zaid-sayyed/)
-
----
-
-Thank you for your dedication and participation!  
-Let’s keep building and learning together 💻🔥  
-— *Team CodeResite*