added test 1 programs

Author: thatsabhishek

README.md

@@ -37,6 +37,10 @@ This repo includes:
     - [Decimal to binary](./milestone1/operatorsandforloop/DecimaltoBinary.cpp)
     - [Square Root (Integral)](./milestone1/operatorsandforloop/SquareRoot(Integral).cpp)
     - [Check Number sequence](./milestone1/operatorsandforloop/CheckNumbersequence.cpp)
+  - [Test 1](./milestone2/test1/)
+    - [Pyramid Number Pattern](./milestone2/test1/PyramidNumberPattern.cpp)
+    - [Number Star Pattern](./milestone2/test1/NumberStarPattern.cpp)
+    - [Second Largest](./milestone2/test1/SecondLargest.cpp)
 
 # Coding Ninjas
 ## Rate my Repo ⭐!!!

milestone2/test1/NumberStarPattern.cpp

@@ -0,0 +1,41 @@
+// Print the following pattern for given number of rows.
+// Input format :
+
+// Line 1 : N (Total number of rows)
+
+// Sample Input :
+//    5
+// Sample Output :
+// 1234554321
+// 1234**4321
+// 123****321
+// 12******21
+// 1********1
+
+#include<iostream>
+using namespace std;
+
+int main(){
+  int n;
+  cin>>n;
+  int i = 1;
+  while (i <= n){
+    int j = 1;
+    while (j <= n-i+1){
+      cout<<j;
+      j++;
+    }
+    int sp = 1;
+    while (sp <= 2*(i-1)){
+      cout<<"*";
+      sp++;
+    }
+    int k = n-i+1;
+    while (k >= 1){
+      cout<<k;
+      k--;
+    }
+  cout<<endl;
+  i++;
+  }
+}

milestone2/test1/PyramidNumberPattern.cpp

@@ -0,0 +1,39 @@
+// Print the following pattern for the given number of rows.
+// Pattern for N = 4
+//    1
+//   212
+//  32123
+// 4321234
+// Input format : N (Total no. of rows)
+
+// Output format : Pattern in N lines
+
+#include <iostream>
+using namespace std;
+
+int main() {
+    int n;
+    cin>>n;
+    int i=1;
+    while (i <= n){
+        int sp=1;
+        while (sp <= n-i){
+            cout<<" ";
+            sp++;
+        }
+        int j=1;
+        int k=i;
+        while (j <= i){
+            cout<<k;
+            k--;
+            j++;
+        }
+        int l = 2;
+        while (l <= i){
+            cout<<l;
+            l++;
+        }
+    cout<<endl;
+    i++;
+    }
+}

milestone2/test1/SecondLargest.cpp

@@ -0,0 +1,37 @@
+// Take input a stream of n integer elements, find the second largest element present.
+// The given elements can contain duplicate elements as well. If only 0 or 1 element is given, the second largest should be INT_MIN ( - 2^31 ).
+// Input format :
+
+// Line 1 : Total number of elements (n)
+
+// Line 2 : N elements (separated by space)
+
+// Sample Input 1:
+//  4
+//  3 9 0 9
+// Sample Output 1:
+//  3
+
+#include<iostream>
+using namespace std;
+#include <climits>
+
+int main() {
+    int n;
+    cin >> n;
+    int max = INT_MIN, secondMax = INT_MIN;
+    int num;
+    int count = 1;
+    while(count <= n) {
+        cin >> num;
+        if(num > max) { 
+            secondMax = max;
+            max = num;
+        } 
+        else if(num > secondMax && num != max) {
+            secondMax = num;
+        }
+        count++;
+    }
+    cout << secondMax << endl;
+}