ADDED DAILY PROBLEM OF DAY: 10 Oct 2023

Daily_Questions/10_Oct/Smallest_number_divisible_by_k.cpp

@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int lengthOfNumber(int k)
+{
+	if(k%2 == 0 || k%5 == 0){
+		return -1;
+	}
+	long long int n = 0;
+	for(int i=1; i<=k; i++){
+		int n = ((n*10)+1) % k;
+		if(n==0){
+			return i;
+		}
+	}
+	return -1;
+}
+
+int main(){
+
+    int k = 1;
+    cout << lengthOfNumber(k);
+
+    return 0;
+}

Daily_Questions/10_Oct/Swap_adjacent_bit_pair.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h> 
+using namespace std;
+int swapAdjacentBits(int n)
+{ 
+    // Write your code here
+    if(n == 0){
+        return n;
+    }
+    vector<int> bitt;
+    while(n!=0){
+        bitt.push_back(n%2);
+        n/=2;
+    }
+    if(bitt.size()%2 != 0){
+        bitt.push_back(0);
+    }
+    reverse(bitt.begin(), bitt.end());
+    int num = 0;
+    int po = 0;
+    for(int i=0; i<bitt.size()-1; i++){
+        swap(bitt[i], bitt[i+1]);
+        i++;
+    }
+    for(int i=bitt.size()-1; i>=0; i--){
+        if(bitt[i] == 1){
+            num += pow(2, po);
+        }
+        po++;
+    }
+    return num;
+}
+
+int main(){
+
+    int n = 9;
+    cout << swapAdjacentBits(n) << endl;
+
+    return 0;
+}