Open In App

Python – Phrase removal in String

Improve
Improve
Like Article
Like
Save
Share
Report

Sometimes, while working with Python strings, we can have a problem in which we need to extract certain words in a string excluding the initial and rear K words. This can have application in many domains including all those include data. Lets discuss certain ways in which this task can be performed. 

Method #1 : Using list comprehension + enumerate() + list slicing The combination of above methods can be used to solve this problem. In this, we extract the indices of spaces and perform the slicing according to space indices. 

Python3




# Python3 code to demonstrate working of
# Phrase extraction in String
# Using list comprehension + enumerate() + list slicing
 
# initializing string
test_str = 'Geeksforgeeks is best for geeks and CS'
 
# printing original string
print("The original string is : " + str(test_str))
 
# initializing K
K = 2
 
# Phrase extraction in String
# Using list comprehension + enumerate() + list slicing
temp = [idx for idx, ele in enumerate(test_str) if ele == ' ']
res = test_str[temp[K - 1]: temp[-(K - 1)]].strip()
 
# printing result
print("String after phrase removal : " + str(res))


Output : 

The original string is : Geeksforgeeks is best for geeks and CS
String after phrase removal : best for geeks and

 Method #2 : Using join() + split() The combination of above methods can be used to perform this task. In this, we split all words and join all the words except the initial and rear K. 

Python3




# Python3 code to demonstrate working of
# Phrase extraction in String
# Using join() + split()
 
# initializing string
test_str = 'Geeksforgeeks is best for geeks and CS'
 
# printing original string
print("The original string is : " + str(test_str))
 
# initializing K
K = 2
 
# Phrase extraction in String
# Using join() + split()
res = ' '.join(test_str.split()[K:-(K - 1)])
 
# printing result
print("String after phrase removal : " + str(res))


Output : 

The original string is : Geeksforgeeks is best for geeks and CS
String after phrase removal : best for geeks and

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

Time Complexity: O(n)

Auxiliary Space: O(n)



Last Updated : 16 Mar, 2023
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads