Merge pull request #15 from mairohanhoon/main

ADDED DAILY Problems of 9th October 2023

Author: salimshaddy18

Daily_Questions/09_Oct/Minimum_and_maximum_cost_to_buy_N_candies.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// Function to calculate minimum cost.
+long long minimumCost(vector<int> &cost, int n, int k)
+{
+    // Write your code here.
+    long long count = 0;
+    int  x = n-1;
+    sort(cost.begin(), cost.end());
+    for(int i=0; i<=x; i++){
+        count+=cost[i];
+        x = x-k;
+    }
+    return count;
+}
+
+// Function to calculate maximum cost.
+long long maximumCost(vector<int> &cost, int n, int k)
+{
+    // Write your code here.
+    long long count = 0;
+    int  x = n-1;
+    sort(cost.begin(), cost.end());
+    reverse(cost.begin(), cost.end());
+    for(int i=0; i<=x; i++){
+        count+=cost[i];
+        x=x-k;
+    }
+    return count;
+}
+
+int main(){
+
+    int n = 5;
+    int k = 2;
+    vector<int> cost = {9, 8, 2, 6, 4};
+
+    cout << minimumCost(cost, n, k) << " " << maximumCost(cost, n, k) << endl;
+
+    return 0;
+}

Daily_Questions/09_Oct/Move_zeroes_to_end.cpp

@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+void pushZerosAtEnd(vector<int> &arr) 
+{
+	// Write your code here.
+	int count = 0;
+	vector<int> res;
+	for(int i=0; i<arr.size(); i++){
+		if(arr[i] == 0){
+			count++;
+		}
+		else{
+			res.push_back(arr[i]);
+		}
+	}
+	while(count--){
+		res.push_back(0);
+	}
+	arr = res;
+}
+
+int main(){
+
+    vector<int> arr = {2, 0, 4, 1, 3, 0, 28};
+    pushZerosAtEnd(arr);
+
+    for(int i=0; i<arr.size(); i++){
+        cout << arr[i] << " ";
+    }
+
+    return 0;
+}

Daily_Questions/09_Oct/Row_wave_form.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h> 
+using namespace std;
+
+vector<int> rowWaveForm(vector<vector<int>> &mat) {
+    // Write your code here.
+    vector<int> res;
+    for(int i=0; i<mat.size(); i++){
+        if(i%2 == 0){
+            for(int j=0; j<mat[0].size(); j++){
+                res.push_back(mat[i][j]);
+            }
+        }
+        else{
+            for(int j=mat[0].size()-1; j>=0; j--){
+                res.push_back(mat[i][j]);
+            }
+        }
+    }
+    return res;
+}
+
+int main(){
+
+    vector<vector<int>> mat = {{1,2}, {0,5}};
+    vector<int> res = rowWaveForm(mat);
+
+    for(int i=0; i<res.size(); i++){
+        cout << res[i] << " ";
+    }
+
+    return 0;
+}