From bedb7f259b693b36bfb949e4358b939626a053a7 Mon Sep 17 00:00:00 2001
From: Mustafa11300 <mustafahussain11300@gmail.com>
Date: Wed, 1 May 2024 16:47:26 +0530
Subject: [PATCH 1/3] first

---
 dsa2.txt | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 create mode 100644 dsa2.txt

diff --git a/dsa2.txt b/dsa2.txt
new file mode 100644
index 0000000..e69de29

From 7d45f2266cdbddd3ef2337e50189446897f0ad35 Mon Sep 17 00:00:00 2001
From: Mustafa11300 <mustafahussain11300@gmail.com>
Date: Wed, 1 May 2024 17:41:23 +0530
Subject: [PATCH 2/3] first d

---
 dsa2.cpp | 27 +++++++++++++++++++++++++++
 dsa2.txt |  0
 2 files changed, 27 insertions(+)
 create mode 100644 dsa2.cpp
 delete mode 100644 dsa2.txt

diff --git a/dsa2.cpp b/dsa2.cpp
new file mode 100644
index 0000000..9a7eaa2
--- /dev/null
+++ b/dsa2.cpp
@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+ void  traillingzeros()
+ {
+     int n;
+       cin>>n;
+    if(n>=1&&n<=1000000)
+    {
+        int tz;
+        tz=n/5;
+        cout<<tz;
+    }
+    cout<<"\n";
+ }
+ int main()
+ {
+         int t;
+         cin>>t;
+         if(t>=1&&t<=100000)
+         {
+              for(int i=1;i<=t;i++)
+              {
+                  traillingzeros();
+              }
+         }
+     
+ }
\ No newline at end of file
diff --git a/dsa2.txt b/dsa2.txt
deleted file mode 100644
index e69de29..0000000

From 9ae56b2c8fed95d62a89b1cbcb4db36d2f76ed0e Mon Sep 17 00:00:00 2001
From: Mustafa11300 <mustafahussain11300@gmail.com>
Date: Wed, 1 May 2024 18:24:41 +0530
Subject: [PATCH 3/3] dsa1 sol

---
 Question-1/dsa1.cpp             | 34 +++++++++++++++++++++++++++++++++
 Question-1/problem_statement.md |  3 ++-
 2 files changed, 36 insertions(+), 1 deletion(-)
 create mode 100644 Question-1/dsa1.cpp

diff --git a/Question-1/dsa1.cpp b/Question-1/dsa1.cpp
new file mode 100644
index 0000000..958ebd8
--- /dev/null
+++ b/Question-1/dsa1.cpp
@@ -0,0 +1,34 @@
+#include<iostream>
+#include<algorithm>
+#include<cstdio>
+#include<cstring>
+
+using namespace std;
+const int N = 110;
+int n, t;
+int st[N];
+
+
+int main()
+{
+    cin >> t;
+    while(t--)
+    {
+        cin >> n;
+        int cnt = 0;
+        memset(st, 0, sizeof st);
+        for(int i=1; i<=n; i++)
+        {
+            int a ;
+            cin >> a;
+            st[a]++;
+            if(st[a]==3)
+            {
+                st[a] = 0;
+                cnt++;
+            }
+        }
+        cout << cnt<<endl;
+    }
+    return 0;
+}
diff --git a/Question-1/problem_statement.md b/Question-1/problem_statement.md
index 98c3c3e..4ac3852 100644
--- a/Question-1/problem_statement.md
+++ b/Question-1/problem_statement.md
@@ -48,4 +48,5 @@ Can you help Vinayak to get seminar hall ?
 **Note**  
 In the first test case, we only have one stick, hence we can't form any polygon.  
 In the second test case, the two sticks aren't enough to form a polygon either.  
-In the third test case, we can use the 4 sticks of length 3 to create a square.
\ No newline at end of file
+In the third test case, we can use the 4 sticks of length 3 to create a square.
+