pattern folder updated

Web/SwastikNanda_SwastikNanda_2024IT1183_2/GettingStarted/Patterns/pattern6.cpp → Web/SwastikNanda_SwastikNanda_2024IT1183_2/Patterns/pattern6.cpp

@@ -9,7 +9,7 @@
 //     int b=1;
 //     for(int i=1;i<=((n/2)+1);i++)
 //     {
-//         for(int j=n-l;j>0;j--){                       //commented code is working properly on VS code and online compilers but not on pepcoding site. 
+//         for(int j=n-l;j>0;j--){                       //this code is working properly on VS code and online compilers but not on pepcoding site. 
 //             printf("* ");
 //         }
 //         for(int k=b;k>0;k--){
@@ -49,7 +49,7 @@ using namespace std;
 int main(int argc, char **argv){
     int n;
     cin >> n;
-                                                        
+
     int stars = n / 2 + 1;
     int spaces = 1;
     for (int i = 1; i <= n; i++){
@@ -74,4 +74,4 @@ int main(int argc, char **argv){
         }
     }
     return 0;
-}
+}

Web/SwastikNanda_SwastikNanda_2024IT1183_2/array and functions/digit_count.cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+int digFreq(int n, int d) {
+  int temp=0;
+  int count=0;
+  while(n!=0){
+      temp=n%10;
+      n=n/10;
+      if(temp==d){
+          count++;
+      }
+  }
+  return count;
+}
+int main() {
+  int n, d;
+  cin >> n >> d;
+  int res = digFreq(n, d);
+  cout << res << endl;
+}

Web/SwastikNanda_SwastikNanda_2024IT1183_2/array and functions/find_element_in_array.cpp

@@ -0,0 +1,26 @@
+#include<iostream>
+using namespace std;
+
+
+int main(){
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+    }
+    int d,count=0;
+    cin>>d;
+    for(int i=0;i<n;i++){
+        if(arr[i]==d){
+            cout<<i;
+            break;
+        }
+        count++;
+    }
+    if(count==n){
+        cout<<"-1";
+    }
+
+    return 0;
+}

Web/SwastikNanda_SwastikNanda_2024IT1183_2/array and functions/span_of_elements.cpp

@@ -0,0 +1,19 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+    int arr[n];
+    int max,min;
+    max=0;
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+        if(i==0){min=arr[i];max=arr[i];}
+        if(arr[i]>max){max=arr[i];}
+        if(arr[i]<min){min=arr[i];}
+    }
+    cout<<max-min;
+
+    return 0;
+}