diff --git a/Week1/Swarnima_Shishodia/Que1.cpp b/Week1/Swarnima_Shishodia/Que1.cpp
new file mode 100644
index 0000000..908206d
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que1.cpp
@@ -0,0 +1,14 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    long long int n;
+
+    cout<<"Enter a number ";
+    //Input a number
+    cin>>n;
+    //Output the square of a number
+    cout<<n*n;
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que10.cpp b/Week1/Swarnima_Shishodia/Que10.cpp
new file mode 100644
index 0000000..43e6825
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que10.cpp
@@ -0,0 +1,20 @@
+// To calculate gcd of a number
+#include<iostream>
+using namespace std;
+
+int gcd(int num1,int num2)
+{
+    if(num2==0)
+        return num1;
+    else
+     return gcd(num2,num1%num2);
+}
+int main()
+{
+    int num1,num2,result;
+    cin>>num1;
+    cin>>num2;
+    result=gcd(num1,num2);
+    cout<<result<<endl;
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que11.cpp b/Week1/Swarnima_Shishodia/Que11.cpp
new file mode 100644
index 0000000..324c415
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que11.cpp
@@ -0,0 +1,36 @@
+
+#include <iostream>
+using namespace std;
+
+void sieve_of_erasthones(int a[])
+{
+int p=10000,i,q=2,j;
+for(i=0;i<=p;i++)//Mark all the array position as 1
+    a[i]=1;
+a[0]=0;
+a[1]=0;
+while(q*q<=p) //Mark the sieve positions as 0 which gets divided by q
+{
+    for(j=q*q;j<=p;j=j+q)
+    a[j]=0;
+    q=q+1;
+}
+//The numbers which are prime, 1 will be present
+}
+int main() {
+	int t,i,n,j;
+	cin>>t;
+	int a[10000];
+	sieve_of_erasthones(a); //Call the sieve function
+	for(i=0;i<t;i++)
+	{
+	   cin>>n;
+	   for(j=0;j<=n;j++)
+	   {
+	       if(a[j]==1)
+	       cout<<j<<" ";//Print the prime numbers
+	   }
+	   cout<<endl;
+	}
+	return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que12.cpp b/Week1/Swarnima_Shishodia/Que12.cpp
new file mode 100644
index 0000000..56d16f5
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que12.cpp
@@ -0,0 +1,62 @@
+//Segmented sieve is used when we need to print the prime in a given range because simple sieve is not memory efficient
+#include <bits/stdc++.h>
+using namespace std;
+void simpleSieve(int limit, vector<int> &prime)
+{
+    bool mark[limit+1];
+    memset(mark, true, sizeof(mark));
+    for (int p=2; p*p<limit; p++)
+    {
+        if (mark[p] == true)
+        {
+            for (int i=p*2; i<limit; i=i+p)
+                mark[i] = false;//Mark the composite number as false
+        }
+    }
+    for (int p=2; p<limit; p++)
+    {
+        if (mark[p] == true)
+        {
+            prime.push_back(p);
+            cout << p << " ";
+        }
+    }
+}
+
+void segmentedSieve(int n)
+{
+    int limit = floor(sqrt(n))+1;
+    vector<int> prime;
+    simpleSieve(limit, prime);
+    int low = limit;
+    int high = 2*limit;
+    while (low < n)
+    {
+        if (high >= n)
+           high = n;
+        bool mark[limit+1];
+        memset(mark, true, sizeof(mark));
+        for (int i = 0; i < prime.size(); i++)
+        {
+            int loLim = floor(low/prime[i]) * prime[i];
+            if (loLim < low)
+                loLim += prime[i];
+            for (int j=loLim; j<high; j+=prime[i])
+                mark[j-low] = false;
+        }
+        for (int i = low; i<high; i++)
+            if (mark[i - low] == true)
+                cout << i << " ";
+        low = low + limit;
+        high = high + limit;
+    }
+}
+
+int main()
+{
+    int n;
+    cout<<"Enter a number\n";
+    cin>>n;
+    segmentedSieve(n);
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que13.cpp b/Week1/Swarnima_Shishodia/Que13.cpp
new file mode 100644
index 0000000..ba44cc4
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que13.cpp
@@ -0,0 +1,42 @@
+//To calculate the power of a number
+#include<iostream>
+using namespace std;
+int power_(int base,int power)
+{
+    int result=1;
+    while(power!=0)
+    {
+        if(power%2==0)
+        {
+            base=base*base; //If power is even then take square of the base and divide the power by 2
+            power=power/2;
+        }
+        else
+        {
+            result=result*base; //If power is odd then multiply base by result
+            power=power-1; //and decrease the power by 1
+        }
+
+    }
+    return result;
+}
+int main()
+{
+    int base,power,m,y,i,p;
+    cin>>base;
+    cin>>power;
+    cin>>m;
+    p=power;
+    if(power%2==0)
+        power=power/2; //If power is even divide it by 2
+    else
+        power=power-1; // If power is odd subtract it by 1
+
+    y=power_(base,power);
+    if(p%2==0)
+        i=(((y%m)*(y%m))%m);//Using the properties
+    else
+        i=(((base%m)*(y%m))%m);
+    cout<<i;
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que14.cpp b/Week1/Swarnima_Shishodia/Que14.cpp
new file mode 100644
index 0000000..406dcf1
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que14.cpp
@@ -0,0 +1,36 @@
+//To check whether n  is prime or not
+/*Logic- All prime numbers can be represented in the form of 6k+1 and 6k-1 except 2 and 3 and does not get divided by a number which is represented as 6k-1
+and 6k+1*/
+#include<iostream>
+using namespace std;
+int main()
+{
+    int t,i,j,n,flag;
+    cin>>t;
+    for(i=0;i<t;i++)
+    {
+        cin>>n;
+        if(n==1)
+            cout<<"No"<<endl;
+        else if(n==2 || n==3)
+            cout<<"Yes"<<endl; //To print 2 and 3
+        else if(n%2==0 && n%3==0)
+            cout<<"No"<<endl;
+        else
+        {
+            flag=0;
+            for(j=5;j<=n*n;j=j+6)
+             {
+            if(n%j==0 or n%(j+2)==0)
+            {
+              flag=1;
+              break;
+            }
+             }
+             if(flag==0)
+                cout<<"Yes"<<endl;
+             else
+                cout<<"No"<<endl;
+        }
+    }
+}
diff --git a/Week1/Swarnima_Shishodia/Que15.cpp b/Week1/Swarnima_Shishodia/Que15.cpp
new file mode 100644
index 0000000..fd924f5
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que15.cpp
@@ -0,0 +1,40 @@
+//To print pair if primes
+#include<iostream>
+using namespace std;
+void sieve_of_erasthones(int a[]) //Use sieve to calculate prime number
+{
+  int p=2,i;
+  for(i=0;i<401;i++) //Mark all array index as 1
+        a[i]=1;
+a[0]=0;
+a[1]=0;
+  while(p*p<=400)
+  {
+      for(i=p*p;i<401;i=i+p)
+        a[i]=0; //The numbers which are not prime will be marked as 0
+      p=p+1;
+  }
+}
+int main()
+{
+    int t,i,j,n,k;
+    cin>>t;
+    int a[401];
+
+    sieve_of_erasthones(a); //Call the sieve function
+
+    for(i=0;i<t;i++)
+    {
+      cin>>n;
+      for(j=2;j<=n;j++)
+      {
+          for(k=2;k<=n;k++)
+          {
+              if(k*j<=n && a[k]==1 && a[j]==1) //To print the pairs
+                cout<<j<<" "<<k<<" ";
+          }
+      }
+      cout<<endl;
+    }
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que16.cpp b/Week1/Swarnima_Shishodia/Que16.cpp
new file mode 100644
index 0000000..1ec1533
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que16.cpp
@@ -0,0 +1,24 @@
+//To check whether a number can be represented as power of 2 or not
+#include<iostream>
+using namespace std;
+int main()
+{
+    int t,i,j,a,b;
+    cin>>t;
+    uint64_t n;
+    if(n==0)
+    cout<<"NO";
+    else
+    {
+    for(i=0;i<t;i++)
+    {
+        cin>>n;
+        if((n&(n-1))==0) //If a number and with number-1 is 0, it means that it can be represented as power of 2
+            cout<<"YES"<<endl;
+        else
+        cout<<"NO"<<endl;
+
+    }
+    }
+return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que2.cpp b/Week1/Swarnima_Shishodia/Que2.cpp
new file mode 100644
index 0000000..0d52cbd
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que2.cpp
@@ -0,0 +1,19 @@
+#To print the table of a number
+
+#include<iostream>
+using namespace std;
+int main()
+{
+    long long int n;
+    int i;
+
+    cout<<"Enter a number ";
+    cin>>n;
+
+    //Print the table
+    for(i=1;i<=10;i++)
+        cout<<n<<"*"<<i<<"="<<n*i<<endl;
+
+    return 0;
+}
+
diff --git a/Week1/Swarnima_Shishodia/Que3a.cpp b/Week1/Swarnima_Shishodia/Que3a.cpp
new file mode 100644
index 0000000..4862eeb
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que3a.cpp
@@ -0,0 +1,22 @@
+//To print a upward Star Triangle
+
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n,i,j;
+    cout<<"Enter a number ";
+    cin>>n;
+
+    //Run first loop till n and inside that print the number of star for each line which is always equal to the i
+
+    for(i=1;i<=n;i++)
+    {
+        for(j=1;j<=i;j++)
+            cout<<"*";
+        cout<<endl;
+    }
+
+    return 0;
+}
+
diff --git a/Week1/Swarnima_Shishodia/Que3b.cpp b/Week1/Swarnima_Shishodia/Que3b.cpp
new file mode 100644
index 0000000..660a0ee
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que3b.cpp
@@ -0,0 +1,27 @@
+//To print Upward Centered Triangle
+#include <iostream>
+using namespace std;
+int main()
+{
+    int space, rows,i,k;
+    cout <<"Enter number of rows: ";
+    cin >> rows;
+    for(i=1;i<= rows;i++)
+    {
+        k=0;
+        //To print the space in left side
+        for(space=1;space<=rows-i;space++)
+        {
+            cout <<" ";
+        }
+
+         //To print the stars
+        while(k != i)
+        {
+            cout << "* ";
+            ++k;
+        }
+        cout << endl;
+    }
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que4.cpp b/Week1/Swarnima_Shishodia/Que4.cpp
new file mode 100644
index 0000000..bdf23c0
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que4.cpp
@@ -0,0 +1,20 @@
+//To print Downward Star Triangle
+
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n,i,j;
+    cout<<"Enter a number ";
+    cin>>n;
+    //Run a loop from n to 1.Inside it run another loop which will print exactly i stars
+    for(i=n;i>=1;i--)
+    {
+        for(j=1;j<=i;j++)
+            cout<<"*";
+        cout<<endl;
+    }
+
+    return 0;
+}
+
diff --git a/Week1/Swarnima_Shishodia/Que5.cpp b/Week1/Swarnima_Shishodia/Que5.cpp
new file mode 100644
index 0000000..513c66f
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que5.cpp
@@ -0,0 +1,49 @@
+//to print Kaju Katli ,first print upward triangle then downward
+
+#include <iostream>
+using namespace std;
+int main()
+{
+    int space, rows,i,k;
+    cout <<"Enter number of rows: ";
+    cin >> rows;
+    //To print upward traingle
+    for(i=1;i<= rows;i++)
+    {
+        k=0;
+        //Print the spaces on left side
+        for(space=1;space<=rows-i;space++)
+        {
+            cout <<" ";
+        }
+
+        //Print the stars
+        while(k != i)
+        {
+            cout << "* ";
+            ++k;
+        }
+        cout << endl;
+    }
+
+    //To print Downward Triangle
+    for(i=1;i<=rows-1;i++)
+    {
+        k=0;
+        // To print spaces on left side
+        for(space=1;space<=i;space++)
+        {
+            cout <<" ";
+        }
+
+        //To print stars in each row
+        while(k != rows-i)
+        {
+            cout << "* ";
+            ++k;
+        }
+        cout << endl;
+    }
+
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que6.cpp b/Week1/Swarnima_Shishodia/Que6.cpp
new file mode 100644
index 0000000..66b3a20
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que6.cpp
@@ -0,0 +1,29 @@
+//To print the fibonacci Triangle
+#include<iostream>
+using namespace std;
+int main()
+{
+    //Take two variables a and b, initialize a as 0 and b as 1
+    int i,j,a=0,b=1,c,n;
+    cin>>n;
+    for(i=1;i<=n;i++)
+    {
+        for(j=1;j<=i;j++)
+        {
+
+           if(i==1) //To print first row
+                cout<<a<<" ";
+           else if(i==2 && j==1)//To print second row first element
+                cout<<b<<" ";
+           else
+           {
+               c=a+b;//calculates the next element which we need to print
+               cout<<c<<" ";
+               a=b; //Swap the variables so that a and b stores the last two numbers
+               b=c;
+           }
+        }
+        cout<<endl;
+    }
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que7.cpp b/Week1/Swarnima_Shishodia/Que7.cpp
new file mode 100644
index 0000000..ebf3ae8
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que7.cpp
@@ -0,0 +1,29 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int i,j,n,space;
+    cin>>n;
+    for(i=1;i<=n;i++)
+    {
+        //to print leftside numbers
+        for(j=1;j<=i;j++)
+          cout<<j<<" ";
+
+        //to print spaces
+        space=((n-i)*2)-1;
+        for(j=1;j<=space;j++)
+            cout<<"  ";
+        if(i==n)
+            j=i-1;
+        else
+        j=i;
+
+        //to print right side numbers
+        for(;j>=1;j--)
+            cout<<j<<" ";
+        cout<<endl;
+
+    }
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que8.cpp b/Week1/Swarnima_Shishodia/Que8.cpp
new file mode 100644
index 0000000..a7edf4a
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que8.cpp
@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n,i,j,star=1;
+    cin>>n;
+
+    for(i=0;i<n;i++)
+    {
+        for(j=1;j<=n-i;j++)// To print number
+            cout<<j<<" ";
+        if(i!=0) // To print stars after 1st line
+        {
+        for(j=1;j<=star;j++)// In each row stars get increased by 2
+            cout<<"* ";
+        star=star+2;
+        }
+        cout<<endl;
+    }
+
+    return 0;
+}
diff --git a/Week1/Swarnima_Shishodia/Que9.cpp b/Week1/Swarnima_Shishodia/Que9.cpp
new file mode 100644
index 0000000..18244af
--- /dev/null
+++ b/Week1/Swarnima_Shishodia/Que9.cpp
@@ -0,0 +1,50 @@
+//Logic- To store factorial of a large number, an array is required.Each time a number is passed into multiple function to calculate the factoril
+
+#include <iostream>
+
+using namespace std;
+int multiply(int x, int fact_size, int fact[]) //To miltiply the numbers to calculate factorial
+{
+    int carry=0;
+    for(int i=0;i<fact_size;i++)
+    {
+        int product =fact[i]*x+carry;/* Each times array elemnt is multiplied by x then product is taken into two parts. First is carry and another is
+                                       the number which we need to put at particular index*/
+
+        fact[i]=product%10;
+        carry=product/10;
+    }
+    while(carry!=0) //After multiplication if carry is left then it it put in array
+    {
+        fact[fact_size]=carry%10;
+        carry=carry/10;
+        fact_size=fact_size+1;
+    }
+    return fact_size;
+}
+void factorial(int n)
+{
+    int fact[500];
+    fact[0]=1;
+        int fact_size=1;
+    int i,x;
+    for(x=2;x<=n;x++)
+    fact_size=multiply(x,fact_size,fact);
+
+
+
+    for(i=fact_size-1;i>=0;i--)
+    cout<<fact[i];
+
+    cout<<endl;
+}
+int main() {
+	int i,t,n;
+	cin>>t;
+	for(i=0;i<t;i++)
+	{
+	  cin>>n;
+	  factorial(n);
+	}
+	return 0;
+}
diff --git a/Week1/testing.txt b/Week1/testing.txt
new file mode 100644
index 0000000..a8f4558
--- /dev/null
+++ b/Week1/testing.txt
@@ -0,0 +1 @@
+This file is for testing perpose.
diff --git a/Week2/Swarnima_Shishodia/Que1.cpp b/Week2/Swarnima_Shishodia/Que1.cpp
new file mode 100644
index 0000000..e3b801b
--- /dev/null
+++ b/Week2/Swarnima_Shishodia/Que1.cpp
@@ -0,0 +1,38 @@
+#include<iostream>
+#include<string.h>
+using namespace std;
+int main()
+{
+    /*variable s store's the string input by the user
+    p stores the modified string
+    w stores the final string that we need to print*/
+
+string s,p="",w="";
+cin>>s;
+//concatenated '.' at left side of string so that last word can be concatenated when . appears
+s="."+s;
+//q stores the length of the string
+//i is a loop variable
+int q=s.size()-1,i;
+//traversing the string from right side
+for(i=s.size()-1;i>=0;i--)
+{
+    //When . appears the this part will get executed
+    if(s[i]=='.')
+    {
+    int j=i;
+    //all the characters to the right of the . get stored till next . appears
+    while(j<=q)
+    {
+    p=p+s[j];
+    j=j+1;
+    }
+    q=i-1;// so that the size of remaining string is stored
+    }
+}
+// As the first character is a dot which I have concatenated so run a loop from 1 position
+for(int i=1;i<p.size();i++)
+    w=w+p[i];//concatenate the characters in w and print them
+cout<<w<<endl;
+return 0;
+}
diff --git a/Week2/Swarnima_Shishodia/Que1.o b/Week2/Swarnima_Shishodia/Que1.o
new file mode 100644
index 0000000..c298e79
Binary files /dev/null and b/Week2/Swarnima_Shishodia/Que1.o differ
diff --git a/Week2/Swarnima_Shishodia/Que2.cpp b/Week2/Swarnima_Shishodia/Que2.cpp
new file mode 100644
index 0000000..5e30a82
--- /dev/null
+++ b/Week2/Swarnima_Shishodia/Que2.cpp
@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+using namespace std;
+void allpermutation(string str)
+{
+    sort(str.begin(),str.end());//Sort the string lexicographically
+     while(next_permutation(str.begin(),str.end()))// nextt_permutation function prints all the permutations of a string
+     cout << str << endl;
+}
+int main()
+{
+    string str;
+    cin>>str;//Input the string
+    allpermutation(str);//Call the function
+    return 0;
+}
diff --git a/Week2/Swarnima_Shishodia/Que2I.cpp b/Week2/Swarnima_Shishodia/Que2I.cpp
new file mode 100644
index 0000000..dbb9c4b
--- /dev/null
+++ b/Week2/Swarnima_Shishodia/Que2I.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+int t;
+	cin>>t;
+	while(t--)
+	{
+	    string st;
+	    cin>>st;
+	    int s=4,b=1,c=0;
+	    for(int i=0;i<st.size();i++)
+	    {
+	        if(st[i]=='W')
+            {
+	        s=s+b;
+	        b=1;
+            }
+	        else
+	        {
+	            s=s-b;
+	            b=b*2;
+	        if(s<b&&i!=st.size()-1)
+            {
+	            c=1;
+	            break;
+	        }
+	        }
+	    }
+	    if(c==1)
+	    cout<<-1<<endl;
+	    else
+	    cout<<s<<endl;
+	}
+	return 0;
+}
diff --git a/Week2/Swarnima_Shishodia/Que3.cpp b/Week2/Swarnima_Shishodia/Que3.cpp
new file mode 100644
index 0000000..fbab4fc
--- /dev/null
+++ b/Week2/Swarnima_Shishodia/Que3.cpp
@@ -0,0 +1,37 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    string c,d;
+    cin>>c;
+    cin>>d;
+    //Make two arrays of length 26 mark all the position in both the arrays equal to 1
+    int a[26],b[26];
+    for(int i=0;i<26;i++)
+    {
+        a[i]=0;
+        b[i]=0;
+    }
+    int i,j=0;
+    //increase the array position by 1 when character appears, After loop gets over It will give each character numbers
+    //Suppose 'a' comes then its ASCII value is 97, 97-97=0 at 0th position 1 gets stored .
+    //In similar way 1st position represents 'b' as 98-97=1
+    for(i=0;i<c.size();i++)
+        a[int(c[i])-97]=a[int(c[i])-97]+1;
+
+    for(i=0;i<d.size();i++)
+        b[int(d[i])-97]=b[int(d[i])-97]+1;
+
+    //Check whether array a and b are equal if true then print yes a otherwise print no
+    for(i=0;i<26;i++)
+    {
+        if(a[i]==b[i])
+            j=j+1;
+    }
+    if(j==26)
+        cout<<"Yes\n";
+    else
+        cout<<"No\n";
+
+return 0;
+}
diff --git a/Week2/Swarnima_Shishodia/Que4.cpp b/Week2/Swarnima_Shishodia/Que4.cpp
new file mode 100644
index 0000000..99c66f3
--- /dev/null
+++ b/Week2/Swarnima_Shishodia/Que4.cpp
@@ -0,0 +1,27 @@
+#include<iostream>
+#include<algorithm>
+#include<string.h>
+using namespace std;
+int main()
+{
+    string s;
+    getline(cin,s);//to input a space separated string
+    int a[257];
+    for(int i=0;i<257;i++)
+        a[i]=0;
+
+/* Make a array for 257 size, whenever a character comes, its ASCII value is calculated and 1 is stored at the same position in the array.
+Print the character, and store 1 at that position when the same character  will come reappear
+then it will not enter into the if position as it already 1*/
+   for(int i=0;i<s.size();i++)
+    {
+      if(a[int(s[i])]==0)
+      {
+          cout<<s[i];
+          a[int(s[i])]=1;
+      }
+      if(s[i]==' ')
+        cout<<' ';
+    }
+    return 0;
+}
diff --git a/Week2/Swarnima_Shishodia/Que4I.cpp b/Week2/Swarnima_Shishodia/Que4I.cpp
new file mode 100644
index 0000000..94c876b
--- /dev/null
+++ b/Week2/Swarnima_Shishodia/Que4I.cpp
@@ -0,0 +1,42 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+ {
+	int t;
+	cin>>t;
+	while(t--)
+        {
+	    int n;
+	    cin>>n;
+	    vector<int> v;
+	    //Store the digits of a number in vector
+	    while(n!=0)
+	    {
+	        v.push_back(n%10);
+	        n/=10;
+	    }
+	    //Sort the vector
+	    sort(v.begin(), v.end());
+	    int len=v.size();//Store the length of a vector
+	    bool found=false;
+	     while(next_permutation(v.begin(), v.end()))// Using next_permutation find all the permutation of a number
+	     {
+    	     int sum=0;
+    	     for(int j=0;j<len;j++)
+    	     {
+    	         sum=sum*10+v[j];
+    	     }//Form the number
+    	     if(sum%8 == 0)//If it is divisible by 8 then print found
+    	     {
+    	         found = true;
+    	         break;
+    	     }
+	     }
+	     //Print Yes if any permutation is divisible by 8 else print no
+	    if(found)
+	        cout<<"Yes\n";
+	    else
+	        cout<<"No\n";
+	}
+	return 0;
+}
diff --git a/Week3/Que1Array.cpp b/Week3/Que1Array.cpp
new file mode 100644
index 0000000..ede41df
--- /dev/null
+++ b/Week3/Que1Array.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+using namespace std;
+int main() {
+	int t,n,m,i,j,num1,num2;
+	cin>>t;
+	for(i=0;i<t;i++)
+	{
+	    cin>>n;
+	    int a[n];
+	    num1=0;
+	    num2=0;
+	    for(j=0;j<n;j++)//to input first array
+	    cin>>a[j];
+
+	    cin>>m;
+	    int b[m];
+	    for(j=0;j<m;j++)//to input second array
+	    cin>>b[j];
+
+	    for(j=0;j<n;j++)
+	    num1=a[j]+num1*10;//to form number from 1st array take digit and multiply the number with 10 everytime
+
+
+	    for(j=0;j<m;j++)
+	    num2=b[j]+num2*10;//to form number from 2nd array take each digit and multiply the number by 10 and add it to number
+
+	    cout<<(num1+num2)<<endl;
+	}
+	return 0;
+}
diff --git a/Week3/Que1MediumArray.cpp b/Week3/Que1MediumArray.cpp
new file mode 100644
index 0000000..bd07916
--- /dev/null
+++ b/Week3/Que1MediumArray.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+#include<climits>
+//To find the contiguous subarray with maximum sum
+//Decalre two variables max_so_far and max_ending_here
+//max_so_far stores the maximum sum till now
+//max_ending_here considers the place where max_so_far get decreased
+using namespace std;
+int main()
+{
+    int t,n;
+    cin>>t;
+    for(int i=0;i<t;i++)
+    {
+        cin>>n;
+        long long a[n];
+        for(int j=0;j<n;j++)
+        cin>>a[j];
+    int max_so_far=INT_MIN,max_ending_here=0;
+    for (int i=0;i<n;i++)
+    {
+        max_ending_here = max_ending_here+a[i];
+        if (max_so_far < max_ending_here)// If the current sum is greater then make max_so_far equal to curent sum value
+            max_so_far = max_ending_here;
+
+        if (max_ending_here < 0)
+            max_ending_here = 0;
+    }
+    cout<<max_so_far<<endl;
+    }
+}
diff --git a/Week3/Que2Array.cpp b/Week3/Que2Array.cpp
new file mode 100644
index 0000000..e9ab1d4
--- /dev/null
+++ b/Week3/Que2Array.cpp
@@ -0,0 +1,56 @@
+#include <iostream>
+using namespace std;
+//1. Reverse from 0 to d-1
+//2. Reverse from d to n-1
+//3. Reverse from 0 to n-1
+//4. Print the output
+int main() {
+	int t,i,j,n,d;
+	cin>>t;
+	for(i=0;i<t;i++)
+	{
+	    cin>>n;
+	    cin>>d;
+	    int a[n];
+	    for(j=0;j<n;j++)
+	    cin>>a[j];
+	    j=0;
+	    int k=d-1;
+	    // Reverse from 0 to d-1
+	    while(j<=k)
+	    {
+	        int temp=a[j];
+	        a[j]=a[k];
+	        a[k]=temp;
+	        j=j+1;
+	        k=k-1;
+	    }
+	    j=d;
+	    k=n-1;
+	    //Reverse from d to n-1
+	    while(j<=k)
+	    {
+	        int temp=a[j];
+	        a[j]=a[k];
+	        a[k]=temp;
+	        j=j+1;
+	        k=k-1;
+	    }
+	    j=0;
+	    k=n-1;
+	    //Reverse the whole array
+	    while(j<=k)
+	    {
+	       int temp=a[j];
+	        a[j]=a[k];
+	        a[k]=temp;
+	        j=j+1;
+	        k=k-1;
+	    }
+	    for(j=0;j<n;j++)
+	    cout<<a[j]<<" ";
+	    cout<<endl;
+
+	}
+	return 0;
+}
diff --git a/Week3/Que3Array.cpp b/Week3/Que3Array.cpp
new file mode 100644
index 0000000..6e593d7
--- /dev/null
+++ b/Week3/Que3Array.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+using namespace std;
+//Logic - Traverse the string from right to left and print the final output
+int main() {
+	int t,i,j;
+	cin>>t;
+	for(i=0;i<t;i++)
+	{
+	    string s;
+	    cin>>s;
+	    for(j=s.length()-1;j>=0;j--)
+	    cout<<s[j];
+	    cout<<endl;
+	}
+	return 0;
+}
diff --git a/Week3/Que4Array.cpp b/Week3/Que4Array.cpp
new file mode 100644
index 0000000..b8d6efd
--- /dev/null
+++ b/Week3/Que4Array.cpp
@@ -0,0 +1,44 @@
+// Use sliding window technique
+// Keep on adding the elements if sum of elements is smaller than um we are looking for
+// Subtract the leftmost element if sum of elements is greater than sum we are looking for
+// If equal print it, Maintain the variable for left variable
+#include<iostream>
+using namespace std;
+int main()
+{
+    int t,s,i,j,p,q;
+    long long int sum=0,n;
+    cin>>t;
+    for(i=0;i<t;i++)
+    {
+        cin>>n;
+        cin>>s;
+       long long int a[n];
+        for(j=0;j<n;j++)
+        cin>>a[j];
+        p=0;
+        q=0;
+        sum=0;
+        while(q<n)
+        {
+            while(sum<s)
+            {
+            sum=sum+a[q];
+                        q=q+1;
+            }
+            while(sum>s)
+            {
+            sum=sum-a[p];
+            p=p+1;
+            }
+            if(sum==s)
+            break;
+        }
+
+        if(sum==s)
+        cout<<p+1<<" "<<q<<endl;
+        else
+        cout<<"-1"<<endl;
+    }
+    return 0;
+}
diff --git a/Week3/Que5Array.cpp b/Week3/Que5Array.cpp
new file mode 100644
index 0000000..68b35ae
--- /dev/null
+++ b/Week3/Que5Array.cpp
@@ -0,0 +1,28 @@
+#include <iostream>
+using namespace std;
+//In Liner search compare each and every element of array with the element you are looking for
+//If element is found then set the flag variable value equal to 1
+// Print flag variable
+int main() {
+	int i,j,n,x,f,t;
+	cin>>t;
+	for(i=0;i<t;i++)
+	{
+	    f=-1;
+	    cin>>n;
+	    cin>>x;
+	    int a[n];
+	    for(j=0;j<n;j++)
+	        cin>>a[j];
+	    for(j=0;j<n;j++)
+	    {
+	        if(a[j]==x)
+	        {
+	        f=j+1;
+	        break;
+	        }
+	    }
+	    cout<<f<<endl;
+	}
+	return 0;
+}
diff --git a/Week3/Que5MediumArray.cpp b/Week3/Que5MediumArray.cpp
new file mode 100644
index 0000000..b9336cb
--- /dev/null
+++ b/Week3/Que5MediumArray.cpp
@@ -0,0 +1,41 @@
+#include <iostream>
+using namespace std;
+//To sort the array having  0,1,2
+//Count all 0 ,1 and 2
+//First make the count of zero number's as 0
+//Make count of 1 as 1 in array and after that do same for second
+int main()
+{
+	int t,n,zero,one,two;
+	cin>>t;
+	for(int i=0;i<t;i++)
+	{
+	    cin>>n;
+	    zero=0;
+	    one=0;
+	    two=0;
+	    int a[n];
+	    for(int j=0;j<n;j++)
+	    cin>>a[j];
+	    for(int j=0;j<n;j++)
+	    {
+	        if(a[j]==0)
+	        zero=zero+1;
+	        else if(a[j]==1)
+	        one=one+1;
+	        else
+	        two=two+1;
+	    }
+	    for(int j=0;j<zero;j++)
+	    a[j]=0;
+	    for(int j=zero;j<one+zero;j++)
+	    a[j]=1;
+	    for(int j=zero+one;j<two+one+zero;j++)
+	    a[j]=2;
+
+	    for(int j=0;j<n;j++)
+	    cout<<a[j]<<" ";
+	    cout<<endl;
+	}
+	return 0;
+}
diff --git a/Week3/Que6Array.cpp b/Week3/Que6Array.cpp
new file mode 100644
index 0000000..dd85c3e
--- /dev/null
+++ b/Week3/Que6Array.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int t,i,j,n,x;
+	cin>>t; //Input the number of test cases
+	for(i=0;i<t;i++)
+	{
+	  cin>>n;//Input the number of elements
+	  cin>>x;//Input the number which you want to search
+	  int arr[n];
+	  for(j=0;j<n;j++)//Input the array in sorted form
+	      cin>>arr[j];
+	  int low=0,high=n-1,f=-1;
+	  //Calculate the middle element in the range low to high.
+	  //Check whether it is equal to mid element,If yes set f=1
+	  // If 'x'  is smaller than arr[mid], the make high=mid-1; because other elements are greater than it
+	  //If 'x' is higher than arr[mid] ,them make low=mid+1 ,because all left elements are less than x
+	  while(low<=high)
+	   {
+	     int mid=(low+high)/2;
+	     if(arr[mid]==x)
+	       {
+	        f=1;
+	        break;
+	       }
+	      else if(arr[mid]<x)
+	          low=mid+1;
+	      else
+	          high=mid-1;
+	      }
+	  cout<<f<<endl;
+	}
+	return 0;
+}
diff --git a/Week3/Que7Array.cpp b/Week3/Que7Array.cpp
new file mode 100644
index 0000000..2aac205
--- /dev/null
+++ b/Week3/Que7Array.cpp
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+//In mirror inverse we just need to check if we make array element equal to index and then look for array element .
+//If all the value matches i then , it is Mirror Inverse otherwise not
+bool isMirrorInverse(int arr[], int n)
+{
+    for (int i = 0; i < n; i++)
+    {
+        if (arr[arr[i]] != i)
+            return false;
+    }
+    return true;
+}
+int main()
+{
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++)
+        cin>>arr[i];
+    if (isMirrorInverse(arr,n))
+        cout<<"Yes";
+    else
+       cout<<"No";
+    return 0;
+}
diff --git a/Week3/Que8Array.cpp b/Week3/Que8Array.cpp
new file mode 100644
index 0000000..055e052
--- /dev/null
+++ b/Week3/Que8Array.cpp
@@ -0,0 +1,29 @@
+#include<bits/stdc++.h>
+//#include<iostream>
+//#include<unordered_map>m;
+using namespace std;
+//To find the majority element store the count of each element
+//Then check if cout is greater than n/2 print yes
+//Otherwise print No
+int main()
+{
+   int n;
+   cin>>n;
+   unordered_map <int,int>m;
+   int arr[n];
+   for(int i=0;i<n;i++)
+        cin>>arr[i];
+   for(int i=0;i<n;i++)
+    m[arr[i]]++;
+   int f=0;
+   for(int i=0;i<n;i++)
+   {
+       if(m[arr[i]]>n/2)
+        f=1;
+   }
+if(f==1)
+    cout<<"YES";
+else
+    cout<<"NO";
+return 0;
+}
diff --git a/Week3/Question2MediumArray.cpp b/Week3/Question2MediumArray.cpp
new file mode 100644
index 0000000..dc1e167
--- /dev/null
+++ b/Week3/Question2MediumArray.cpp
@@ -0,0 +1,56 @@
+#include<iostream>
+using namespace std;
+#define SIZE 105
+void spirallyTraverse(int m, int n, int ar[SIZE][SIZE]);
+int main()
+{
+    int T=0;
+    scanf("%d",&T);
+    while(T--)
+    {
+        int m,n;
+        scanf("%d",&m);
+        scanf("%d",&n);
+        int ar[SIZE][SIZE]={{0}};
+        int i=0;
+        int j=0;
+        int row=0;
+        int col=0;
+        for(i=0;i<m;i++)
+        {
+            for(j=0;j<n;j++)
+            {
+                scanf("%d",&ar[i][j]);
+            }
+        }
+        spirallyTraverse(m,n,ar);
+        cout<<endl;
+    }
+    return 0;
+}
+void spirallyTraverse(int m, int n, int ar[SIZE][SIZE])
+{
+   int top=0,left=0,bottom=m-1,right=n-1;
+   while(top<=bottom && left<=right)
+   {
+       for(int i=top;i<right;i++)
+       cout<<ar[top][i]<<" ";
+       top++;
+       for(int i=right+1;i<=bottom;i++)
+       cout<<ar[i][right]<<" ";
+       right--;
+       if(top<=bottom)
+       {
+           for(int i=right;i>=left;i--)
+           cout<<ar[bottom][i]<<" ";
+           bottom--;
+       }
+       if(left<=right)
+       {
+           for(int i=bottom;i>=top;i--)
+           cout<<ar[i][left]<<" ";
+           left++;
+       }
+   }
+}
+
diff --git a/Week3/Question3MediumArray.cpp b/Week3/Question3MediumArray.cpp
new file mode 100644
index 0000000..abae06c
--- /dev/null
+++ b/Week3/Question3MediumArray.cpp
@@ -0,0 +1,31 @@
+#include <iostream>
+using namespace std;
+#include <unordered_map>
+//To print an element which occur only once
+//Store the count of each number in unordered map as key value pair
+//Check if value is 1 then print key
+int main()
+{
+	int t,n,k;
+	cin>>t;
+	for(int i=0;i<t;i++)
+	{
+	    cin>>n;
+	    cin>>k;
+	    unordered_map<int,int>m;
+	    int a[n];
+	    for(int j=0;j<n;j++)
+	    cin>>a[j];
+	    for(int j=0;j<n;j++)
+	    m[a[j]]++;
+	    for(int j=0;j<n;j++)
+	    {
+	        if(m[a[j]]==1)
+	        {
+	        cout<<a[j]<<"\n";
+	        break;
+	        }
+	    }
+	}
+	return 0;
+}
diff --git a/Week3/Question4MediumArray.cpp b/Week3/Question4MediumArray.cpp
new file mode 100644
index 0000000..292a562
--- /dev/null
+++ b/Week3/Question4MediumArray.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+using namespace std;
+//Using binary search we can do it in log(n) .
+//Try to get the position of first 0 and then subtract length of array from first 0 position
+int main()
+{
+    int t,n;
+    cin>>t;
+    for(int i=0;i<t;i++)
+    {
+        cin>>n;
+        int a[n];
+        for(int j=0;j<n;j++)
+        cin>>a[j];
+
+        int low=0,high=n-1,f=0;
+        while(low<=high)
+        {
+            int mid=(low+high)/2;
+            if(mid==0 && a[mid]==0 || a[mid]==0 && a[mid-1]==1)//If mid==0 and at 0th position element is 0 then all the array have 0
+                //If a[mid]==0 then if it is the first 0, a[mid-1] will be 1
+            {
+            f=n-mid;
+            break;
+            }
+            else if(a[mid]==1)//If array mid==1 then surely left side of mid have all elements 1 , we need to make low=mid+1
+                low=mid+1;
+            else
+            high=mid-1; //If it is not first 1 then it will be on left side  that's why high=mid-1
+        }
+        cout<<f<<endl;
+    }
+	return 0;
+}