Add files via upload

Author: Vraj2811

Calculator.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int a, b;
+    char operation;
+    cout << "Enter the first no. " << endl;
+    cin >> a;
+    cout << "Enter the second no. " << endl;
+    cin >> b;
+    cout << "Enter the operation" << endl;
+    cin >> operation;
+    switch (operation)
+    {
+    case '+':
+        cout << a << " + " << b << " = " << a + b << endl;
+        break;
+
+    case '*':
+        cout << a << " * " << b << " = " << a * b << endl;
+        break;
+
+    case '-':
+        cout << a << " - " << b << " = " << a - b << endl;
+        break;
+
+    case '%':
+        cout << a << " % " << b << " = " << a % b << endl;
+        break;
+    }
+
+    return 0;
+}

Exit.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+#include <cstdlib>
+using namespace std;
+
+int main()
+{
+    int userInput;
+    cout << "Enter a number: ";
+    cin >> userInput;
+
+    if (userInput < 0)
+    {
+        cout << "Invalid input." << endl;
+        exit(1);
+    }
+    cout << "You entered: " << userInput << endl;
+
+    return 0;
+}

Leetcode/1009.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int n;
+    cout << "Enter the no. : ";
+    cin >> n;
+    int m = n;
+    int mask = 0;
+
+    if (n == 0)
+    {
+        cout << "1" << endl;
+        return 0;
+    }
+
+    while (m != 0)
+    {
+        mask = (mask << 1) | 1;
+        m = m >> 1;
+    }
+    cout << (~n & mask) << endl;
+
+    return 0;
+}

Leetcode/1207.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+
+bool uniqueOccurrences(vector<int> &arr)
+{
+    vector<int> counter;
+
+    sort(arr.begin(), arr.end());
+
+    int count = 1;
+    for (int i = 1; i < arr.size(); i++)
+    {
+        if (arr[i] == arr[i - 1])
+        {
+            count += 1;
+        }
+        else
+        {
+            counter.push_back(count);
+            count = 1;
+        }
+    }
+    counter.push_back(count);
+
+    for (int i = 1; i < counter.size(); i++)
+    {
+        if (counter[i] == counter[i - 1])
+        {
+            return false;
+        }
+    }
+    return true;
+}
+
+int main()
+{
+    vector<int> arr = {1, 2, 2, 1, 1, 3};
+
+    bool result = uniqueOccurrences(arr);
+
+    if (result)
+    {
+        cout << "Occurrences are unique." << endl;
+    }
+    else
+    {
+        cout << "Occurrences are not unique." << endl;
+    }
+
+    return 0;
+}

Leetcode/1281

@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    int sum = 0;
+    int product = 1;
+
+    while (n != 0)
+    {
+        sum += (n % 10);
+        product *= (n % 10);
+        n = n / 10;
+    }
+
+    int ans = product - sum;
+    cout << ans << endl;
+
+    return 0;
+}

Leetcode/1281.cpp

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

Leetcode/191

@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    int count = 0;
+
+    if (n <= 0)
+    {
+        cout << "0" << endl;
+        return 0;
+    }
+
+    cout << ((n & (n - 1)) == 0);
+
+    return 0;
+}

Leetcode/191.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int main()
+{
+    int nums[] = {4, 3, 2, 7, 8, 2, 3, 1};
+    int numsSize = sizeof(nums) / sizeof(nums[0]);
+
+    sort(nums, nums + numsSize);
+
+    int ans[100];
+    int ansIndex = 0;
+
+    for (int i = 1; i < numsSize; i++)
+    {
+        if (nums[i] == nums[i - 1])
+        {
+            ans[ansIndex++] = nums[i];
+        }
+    }
+
+    cout << "Duplicates: ";
+    for (int i = 0; i < ansIndex; i++)
+    {
+        cout << ans[i] << " ";
+    }
+    cout << endl;
+
+    return 0;
+}