HimaniNainwal.cpp

DSA Marathon/Day 1/Solution/HimaniNainwal.cpp

@@ -0,0 +1,34 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int T;    // test cases
+    int N;    //denoting size of nums array.
+    cout<<"Enter number of test cases : ";
+    cin>>T;
+    while(T>=1)
+    {
+        cout<<"Enter size of nums array : ";
+        cin>>N;
+        int nums[N+1];
+        cout<<"Enter inputs : ";
+        for(int i=1;i<=N+1;i++)
+        {
+            cin>>nums[i];
+        }
+        for(int j=1;j<=N+1;j++)
+        {
+            for(int k=j+1;k<=N+1;k++)
+            {
+                if(nums[j]==nums[k])
+                {
+                    cout<<"Output : "<<nums[j]<<endl;
+                    break;
+                }
+            }
+
+        }
+        T--;
+    }
+    return 0;
+}

DSA Marathon/Day 2/Solution/day2.py

@@ -0,0 +1,22 @@
+from array import *
+t=int(input("Enter the no. of test cases : "))
+while t>=1:
+    t=t-1
+    A = array('i',[])
+    s=int(input("Enter the array size : "))
+    print("Enter the array elements : ")
+    for i in range(s):
+        x=int(input())
+        A.append(x)
+    a=int(input("Enter the element whose index to be searched : "))
+    for q in A:
+        if q==a:
+            print(A.index(a))
+            break
+        elif q==s:
+            print("-1")
+            break
+
+
+
+