Python | Exceptional Split in String

Sometimes, while working with Strings, we may need to perform the split operation. The straightforward split is easy. But sometimes, we may have a problem in which we need to perform split on certain characters but have exceptions. This discusses split on comma, with the exception that comma should not be enclosed by brackets. Lets discuss certain ways in which this task can be performed. 

Method #1: Using loop + strip() This is brute force way in which we perform this task. In this we construct each element of list as words in String accounting for brackets and comma to perform split. 

The original string is : gfg, is, (best, for), geeks
The string after exceptional split : ['gfg', ' is', ' (best, for)', ' geeks']

Method #2: Using regex() This is yet another way in which this task can be performed. In this, we use a regex instead of manual brute force logic for brackets comma and omit that from getting split. 

The original string is : gfg, is, (best, for), geeks
The string after exceptional split : ['gfg', ' is', ' (best, for)', ' geeks']

The Time and Space Complexity for all the methods are the same:

Time Complexity: O(n)

Auxiliary Space: O(n)

Method #3: Using str.split() and list comprehension

1. Initialize a list patterns with the patterns that we want to exclude from the split. In this case, the patterns are ', ' and ', '(.
2. Use the split() method of the string object to split the string into a list of substrings based on the delimiter ', '. Store the resulting list in a variable split_str.
3. Use a list comprehension to iterate over each substring in split_str and check if it matches any pattern in patterns. If it does, join it with the next substring in split_str. If it doesn't, add it to a new list res_list.
4. Return the res_list as the result.

The original string is : gfg, is, (best, for), geeks
The string after exceptional split : ['gfg', 'is', '(best', 'for)', 'geeks']

Time complexity: O(n), where n is the length of the input string.
Auxiliary space: O(n), where n is the length of the input string.