Remove All Occurrences of a Substring — LeetCode 1910 Python Solution

The problem

Given two strings s and part, perform the following operation on s until all occurrences of the substring part are removed: Find the leftmost occurrence of the substring part and remove it from s. Return s after removing all occurrences of part.

Example

Input

s = "daabcbaabcbc", part = "abc"

Output

"dab"

Explanation

The following operations are done:

Python solution

class Solution:
    def removeOccurrences(self, s: str, part: str) -> str:
        while part in s:
            s = s.replace(part, '', 1)
        return s

Complexity

Pattern: Stack

When the most recent unresolved thing is the one that matters, use a stack. LeetCode 1910. Remove All Occurrences of a Substring is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Stack.

The stack guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Related problems