Merge pull request #119 from ndk123-web/main

feat: Added print_all_divisions problem efficiently

Author: admirerr

CPP/Basics/print_all_divisions.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+
+    // print all divisions
+    int num = 36;
+    vector <int> nums;
+    
+    for (int i = 1 ; i <= sqrt(num); i++){
+        if(num%i == 0){
+            nums.emplace_back(i);
+            if (num / i != i){ // for preventing double 6 
+                nums.emplace_back(num/i);
+            }
+        }
+    }
+    
+    sort(nums.begin(),nums.end());
+    
+    for (auto i : nums){
+        cout << i << " ";
+    }
+    
+    // 1 2 3 4 6 9 12 18 36 
+	
+	return 0;
+}

CPP/pattern/diamond_pattern.cpp

@@ -0,0 +1,52 @@
+//    * 
+//   ***
+//  ***** 
+// ******* 
+//********* 
+// ******* 
+//  *****
+//   ***
+//    * 
+
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    
+    int r = 4;
+    int c = 5;
+    int space;
+    int star;
+    int opposite_r = r - 1;
+    
+    for (int i = 0 ; i < r ; i++){
+        space = r - i - 1;
+        for (int j = 0; j < space ; j++){
+            cout << " ";
+        }
+        
+        star = (2*i) + 1;
+        for (int k = 0 ; k < star ; k++){
+            cout << "*";
+        }
+        
+        cout << endl;
+    }
+    
+    for (int i = opposite_r - 1; i >= 0 ; i--){
+        space = opposite_r - i;
+        for (int j = 0 ; j < space; j++){
+            cout << " ";
+        }
+        
+        star = (2*i) + 1;
+        for(int k = 0 ; k < star ; k++){
+            cout << "*";
+        }
+        
+        cout << endl;
+    }
+
+    return 0;
+}