Add files via upload

GCD Calculation using Euclidean Algorithm in C++
This C++ program computes the Greatest Common Divisor (GCD) of two integers using the efficient Euclidean algorithm. The __gcd function from the <algorithm> library is utilized for simplicity. The code is useful in mathematical problems, string manipulation, and simplifying ratios or fractions.

Author: coderpheonix

1071.Greates Comon Divisor Of String.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    string gcdOfStrings(string str1, string str2) {
+
+        if(str1+str2==str2+str1)
+        {
+            // Calculate greate common divisor
+            int gcdlength= __gcd(str1.length(), str2.length());
+            // return the sub string
+            return str1.substr(0, gcdlength);
+        }
+        // return null if the logic do not flow
+        return "";
+    }
+};