Add code snippets for math-and-numbers, searching, sorting, bit manipulation

Author: ashukr07

snippets/cpp/bit-manipulation/check-power-of-two.md

@@ -0,0 +1,16 @@
+---
+title: Check if a Number is Power of Two
+description: Checks if a given number is a power of two using bitwise operations.
+tags: bit-manipulation, power-of-two
+author: ashukr07
+---
+
+```cpp
+bool is_power_of_two(int n) {
+    return n > 0 && (n & (n - 1)) == 0;
+}
+
+// Usage:
+is_power_of_two(16); // Returns: true
+is_power_of_two(18); // Returns: false
+```

snippets/cpp/bit-manipulation/find-non-repeating-number.md

@@ -0,0 +1,20 @@
+---
+title: Find Non-Repeating Number
+description: Finds the number that appears only once in an array where every other number appears twice.
+tags: bit-manipulation, xor
+author: ashukr07
+---
+
+```cpp
+int find_non_repeating(const std::vector<int>& nums) {
+    int result = 0;
+    for (int num : nums) {
+        result ^= num;
+    }
+    return result;
+}
+
+// Usage:
+std::vector<int> nums = {4, 1, 2, 1, 2};
+find_non_repeating(nums); // Returns: 4
+```

snippets/cpp/bit-manipulation/reverse-bits.md

@@ -0,0 +1,21 @@
+---
+title: Reverse Bits
+description: Reverses the bits of a given integer.
+tags: bit-manipulation, reverse-bits
+author: ashukr07
+---
+
+```cpp
+unsigned int reverse_bits(unsigned int n) {
+    unsigned int result = 0;
+    for (int i = 0; i < 32; ++i) {
+        result <<= 1;
+        result |= n & 1;
+        n >>= 1;
+    }
+    return result;
+}
+
+// Usage:
+reverse_bits(43261596); // Returns: 964176192 (Binary: 00000010100101000001111010011100 -> 00111001011110000010100101000000)
+```

snippets/cpp/bit-manipulation/set-bit-count.md

@@ -0,0 +1,20 @@
+---
+title: Count Set Bits
+description: Counts the number of 1 bits in the binary representation of a number.
+tags: bit-manipulation, set-bits
+author: ashukr07
+---
+
+```cpp
+int count_set_bits(int n) {
+    int count = 0;
+    while (n) {
+        count += n & 1;
+        n >>= 1;
+    }
+    return count;
+}
+
+// Usage:
+count_set_bits(13); // Returns: 3 (Binary: 1101)
+```

snippets/cpp/bit-manipulation/xor-of-range.md

@@ -0,0 +1,18 @@
+---
+title: XOR of Range
+description: Finds XOR of all numbers from 1 to n using properties of XOR.
+tags: bit-manipulation, xor
+author: ashukr07
+---
+
+```cpp
+int xor_upto_n(int n) {
+    if (n % 4 == 0) return n;
+    if (n % 4 == 1) return 1;
+    if (n % 4 == 2) return n + 1;
+    return 0;
+}
+
+// Usage:
+xor_upto_n(5); // Returns: 1 (1 ^ 2 ^ 3 ^ 4 ^ 5 = 1)
+```

snippets/cpp/debuging/vector-print.md

@@ -0,0 +1,25 @@
+---
+title: Binary to Decimal Conversion
+description: Converts a binary number represented as a string to its decimal equivalent.
+tags: binary, conversion
+author: ashukr07
+---
+
+```cpp
+int binary_to_decimal(const std::string& binary) {
+    int decimal = 0;
+    int base = 1; // Base value for the least significant bit
+
+    for (int i = binary.length() - 1; i >= 0; --i) {
+        if (binary[i] == '1') {
+            decimal += base;
+        }
+        base *= 2; // Move to the next power of 2
+    }
+    return decimal;
+}
+
+// Usage:
+std::string binary = "1011"; // Binary representation of 11
+binary_to_decimal(binary);   // Returns: 11
+```

snippets/cpp/math-and-numbers/binary-to-decimal-conversion.md

@@ -0,0 +1,22 @@
+---
+title: Check Perfect Number
+description: Checks if a number is a perfect number. A perfect number is a positive integer that is equal to the sum of its proper divisors (excluding itself).
+tags: math, perfect-number
+author: ashukr07
+---
+
+```cpp
+bool is_perfect(int n) {
+    int sum = 1; // 1 is a divisor for all n > 1
+    for (int i = 2; i * i <= n; ++i) {
+        if (n % i == 0) {
+            sum += i;
+            if (i != n / i) sum += n / i;
+        }
+    }
+    return sum == n && n != 1;
+}
+
+// Usage:
+is_perfect(28); // Returns: true
+```

snippets/cpp/math-and-numbers/check-perfect-number.md

@@ -0,0 +1,21 @@
+---
+title: Compound Interest
+description: Calculates the compound interest for a given principal, rate, time, and number of times interest applied per time period.
+tags: math, finance
+author: ashukr07
+---
+
+```cpp
+#include <cmath>
+
+double compound_interest(double principal, double rate, double time, int n) {
+    return principal * std::pow(1 + rate / n, n * time);
+}
+
+// Usage:
+double principal = 1000.0;  // Initial amount
+double rate = 0.05;         // Annual interest rate (5%)
+double time = 2;            // Time in years
+int n = 4;                  // Compounded quarterly
+compound_interest(principal, rate, time, n); // Returns: 1104.081632653061
+```

snippets/cpp/math-and-numbers/compound-interest.md

@@ -0,0 +1,16 @@
+---
+title: Factorial of a Number
+description: Calculates the factorial of a given non-negative integer.
+tags: math, factorial
+author: ashukr07
+---
+
+```cpp
+int factorial(int n) {
+    if (n <= 1) return 1; // Base case
+    return n * factorial(n - 1); // Recursive step
+}
+
+// Usage:
+factorial(5); // Returns: 120
+```