solved on 30/09/23

Author: Priyanshu-Ganatra

DivideUsingBS.cpp renamed to DivideUsingBSWithPrecision.cpp

@@ -28,16 +28,35 @@ int getQuotient(int divisor, int divident)
     return ans;
 }
 
+double getQuotientWithPrecision(int divisor, int divident)
+{
+    double quotient = getQuotient(divisor, divident);
+    double step = 0.1;
+    int precision = 10;
+
+    for (int i = 0; i < precision; i++)
+    {
+        double temp = quotient;
+        while (temp * divisor < divident)
+        {
+            quotient = temp;
+            temp += step;
+        }
+        step /= 10;
+    }
+    return quotient;
+}
+
 int main()
 {
-    int divisor = -5;
-    int divident = 20;
-    int ans = getQuotient(abs(divisor), abs(divident));
+    int divisor = -3;
+    int divident = 571;
+    double ans = getQuotientWithPrecision(abs(divisor), abs(divident));
 
     if ((divisor < 0 && divident > 0) || (divisor > 0 && divident < 0))
     {
         ans = -ans;
     }
-    cout << ans << endl;
+    printf("%.10f\n", ans);
     return 0;
 }

SqrtWithPrecision.cpp

@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int mySqrt(int x)
+{
+    int s = 0, e = x;
+    int ans = -1;
+    long long mid = 0;
+
+    while (s <= e)
+    {
+        mid = s + (e - s) / 2;
+        // ans found
+        if (mid * mid == x)
+        {
+            return mid;
+        }
+        else if (mid * mid < x)
+        {
+            // store ans
+            // and & move right
+            ans = mid;
+            s = mid + 1;
+        }
+        else
+        {
+            // move left
+            e = mid - 1;
+        }
+    }
+    return ans;
+}
+
+double precisionOfSqrt(int n)
+{
+    double sqrt = mySqrt(n);
+    double step = 0.1;
+
+    int precision = 11;
+    for (int i = 0; i < precision; i++)
+    {
+        double j = sqrt;
+        while (j * j <= n)
+        {
+            sqrt = j;
+            j += step;
+        }
+        step /= 10;
+    }
+
+    return sqrt;
+}
+
+int main()
+{
+    int x = 51;
+    // cout << precisionOfSqrt(x) << endl;
+    printf("%.11f\n", precisionOfSqrt(x));
+    return 0;
+}

removeConsecutiveduplicatesInString.cpp

@@ -0,0 +1,78 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+string removeDuplicates(string s, int k)
+{
+    string ans = "";
+    int idx = 0;
+    while (idx < s.length())
+    {
+        int temp = k - 1;
+        bool isRepeated = false;
+        while (temp)
+        {
+            if (idx + temp >= s.length())
+            {
+                break;
+            }
+
+            if (s[idx] == s[idx + temp])
+            {
+                isRepeated = true;
+            }
+            else
+            {
+                isRepeated = false;
+            }
+            --temp;
+        }
+
+        if (!isRepeated)
+        {
+            ans.push_back(s[idx]);
+            idx++;
+        }
+        else
+        {
+            idx += k;
+        }
+    }
+    return ans;
+}
+
+int countCharactersWithKOrMoreOccurrences(const string input, int k)
+{
+    unordered_map<char, int> charCount;
+
+    // Count the occurrences of each character in the input string
+    for (char c : input)
+    {
+        charCount[c]++;
+    }
+
+    int count = 0;
+
+    // Iterate through the character count map and count characters that appear k or more times
+    for (const auto &pair : charCount)
+    {
+        if (pair.second >= k)
+        {
+            count++;
+        }
+    }
+
+    return count;
+}
+
+int main()
+{
+    int k = 3;
+    string s = "deeedbbcccbdaa";
+    int cnt = countCharactersWithKOrMoreOccurrences(s, k);
+    for (int i = 0; i < cnt; i++)
+    {
+        s = removeDuplicates(s, k);
+    }
+    cout << s << endl;
+    return 0;
+}