Solution
Approach #1 Using LCM[Accepted]
The first obvious step to be undertaken is to split the given string into individual fractions. We split the string based on +
and 
sign. We store the signs in the order in which they appear in the string in array. Further, after getting the individual fractions, we further split the fractions based on /
sign. Thus, we obtain the individual numerator and denominator parts. We store the same in and arrays respectively.
Now, we've got the data ready to be worked upon. In order to see the method we've used in this implementation, we'll take an example and understand the way we work on it.
Let's say, the given fraction is:
We need to equalize all the denominators so as to be able to add and subtract the numerators easily. The nearest value the denominators can be scaled upto is the LCM of all the denominators. Thus, we need to find the LCM of all the denominators and then multiply all the denominators with appropriate integer factors to make them equal to the LCM. But, in order to keep the individual fraction values unchanged, we need to multiply the individual numerators also with the same factors.
In order to find the LCM, we can go as follows. We use the method . Thus, if we can compute the lcm of two denominators, we can keep on repeating the process iteratively over the denominators to get the overall lcm. To find the lcm of two numbers and , we use . For the above example, the turns out to be 6.
Thus, we scale up the denominators to 6 as follows:
Thus, we can observe that, the scaling factor for a fraction is given by: , where is the corresponding scaling factor. Note that, . Thus, . Thus, we find out the corresponding scaling factor for each fraction.
After this, we can directly add or subtract the new scaled numerators.
In the current example, we obtain as the result. Now, we need to convert this into an irreducible fraction. Thus, if we obtain as the final result, we need to find a largest factor , which divides both and . Such a number, as we know, is the gcd of and .
Thus, to convert the result , we divide both the numerator and denominator by the gcd of the two numbers to obtain the final irreducible .
Note: A problem with this approach is that we find the lcm of all the denominators in a single go and then reduce the overall fraction at the end. Thus, the lcm value could become very large and could lead to an overflow. But, this solution suffices for the current range of numbers.
Complexity Analysis

Time complexity : . Euclidean GCD algorithm takes time for finding gcd of two numbers and . Here refers to the number of fractions in the input string and is the maximum possible value of denominator.

Space complexity : . Size of , and list grows upto .
Approach #2 Using GCD[Accepted]
Algorithm
We know that we can continue the process of evaluating the given fractions by considering pairs of fractions at a time and continue the process considering the result obtained and the new fraction to be evaluated this time. We make use of this observation, and thus, instead of segregating the signs, numerators and denominators first, we directly start scanning the given strings and operate on the fractions obtained till now whenever a new sign is encountered.
We operate on the pairs of fractions, and keep on reducing the result obtained to irreducible fractions on the way. By doing this, we can reduce the chances of the problem of potential overflow possible in case the denominators lead to a large value of lcm.
We also observed from the last approach, that we need to equalize the denominators of a pair of fractions say:
We used a scaling factor of for the first fraction(both numerator and denominator). Here, . For the second fraction, the scaling factor is given by . Here, $. Thus, instead of finding the lcm and then again determining the scaling factor, we can directly use: , and . Thus, we need to scale the numerators appropriately and add/subtract them in terms of pairs. The denominators are scaled in the same manner to the lcm of the two denominators involved.
After evaluting every pair of fractions, we again reduce them to irreducible fractions by diving both the numerator and denominator of the resultant fraction by the gcd of the two.
Complexity Analysis

Time complexity : . Euclidean GCD algorithm takes time for finding gcd of two numbers and . Here refers to the number of fractions in the input string and is the maximum possible value of denominator.

Space complexity : . Size of list grows upto .
Analysis written by: @vinod23