Check if a string can become empty by recursive deletion using Slicing

Check if a string can become empty by recursive deletion using Slicing

Last Updated : 03 Jan, 2025

To check if the string "geeksforgeeks" can become empty by recursively deleting occurrences of a specific substring, we can use string slicing and recursion. Here's how to do it for the string "geeksforgeeks" with a specific substring, say "geeks".

Let's understand this with the help of an example:

Python

def can_become_empty_with_slicing(string, substring):
  
    # If the string is empty, it can be considered successfully reduced to empty
    if not string:
        return True
    
    # Check if the substring exists at any position
    index = string.find(substring)
    if index != -1:
        # Remove the substring using slicing and recursively check
        return can_become_empty_with_slicing(string[:index] + string[index + len(substring):], substring)
    
    # If the substring is not found, and the string is not empty, return False
    return False

# Example test case
input_string = "geeksforgeeks"
substring = "geeks"

# Call the function and store the result
result = can_become_empty_with_slicing(input_string, substring)

print(result)

Output

False

Explanation:

Base case: If the string becomes empty (i.e., not string), the function returns True, indicating that the string has successfully been reduced to an empty string.
Recursive case: The function checks if the substring "geeks" exists in the string. If it does, it removes the first occurrence of the substring and recursively calls itself with the modified string.
If the substring isn't found, the function returns False, indicating the string can't be reduced to empty by removing the substring.

Check if a string can become empty by recursive deletion using Slicing

S

Shashank Mishra

Improve

Article Tags :

Practice Tags :

Similar Reads

Check if a string can become empty by recursively deleting a given sub-string

Given a string "str" and another string "sub_str". We are allowed to delete "sub_str" from "str" any number of times. It is also given that the "sub_str" appears only once at a time. The task is to find if "str" can become empty by removing "sub_str" again and again. Examples: Input : str = "GEEGEEK

Check if a string consisting only of a, b, c can be made empty by removing substring "abc" recursively

Given a string S size of N consisting of characters 'a', 'b', and 'c' only, the task is to check if the given string can be made empty by removing the string "abc" recursively or not. If found to be true, then print "Yes". Otherwise, print "No". Examples: Input: S = abcabcOutput: YesExplanation:Belo

Check if number can be made prime by deleting a single digit

Given an integer N, the task is to check if it is possible to make N prime by deleting any single digit from N. Examples: Input: N = 610Output: YesExplanation: Deleting 0 from 610, we get 61 which is prime. Input: N = 68 Output: No Approach: The idea is to convert N to a string. Now iterate for ever

Check if string S1 can be formed using repeated insertions of another string S2

Given two strings S1 and S2 consisting of unique characters, the task is to check S1 can be formed by repeated insertions of string S2. Input: S1 = "aabb", S2 = "ab"Output: YesExplanation: the mentioned string can be obtained after series of moves: Insert string "ab" in an empty string. Current stri

Check if a string can be converted to another given string by removal of a substring

Given two strings S and T of length N and M respectively, the task is to check if the string S can be converted to the string T by removing at most one substring of the string S. If found to be true, then print â€œYESâ€. Otherwise, print â€œNOâ€. Example: Input: S = â€œabcdefâ€, T = â€œabcâ€ Output: YES Explana

Check if a string can be emptied by removing all subsequences of the form "10"

Given a binary string str, the task is to check if the string can be emptied by removing all subsequences of the form "10" Examples: Input: str = "11011000"Output: YesExplanation:Following steps are required to be performed to empty the given string "11011000" ? "111000" ? "1100" ? "10" ? "" Input:

Check if a string can be made empty by repeatedly removing given subsequence

Given a string str containing characters 'G' and 'F' only, the task is to check if the given string str can be made empty after removing all subsequences of the form "GFG". Examples: Input : N = 6, str[] = "GFGFGG"Output : YesExplanation : Two strings of "GFG" can be made with the first one with ind

Check if a string can be split into substrings starting with N followed by N characters

Given a string str, the task is to check if it can be split into substrings such that each substring starts with a numeric value followed by a number of characters represented by that numeric integer. Examples: Input: str = "4g12y6hunter" Output: Yes Explanation: Substrings "4g12y" and "6hunter" sat

Maximize minority character deletions that can be done from given Binary String substring

Python Given binary string str of size, N. Select any substring from the string and remove all the occurrences of the minority character (i.e. the character having less frequency) from the substring. The task is to find out the maximum number of characters that can be removed from performing one suc

Check if String can be generated by concatenating character or String itself

Given a target string S consisting of lowercase alphabets, the task is to make this string by performing some operation on an empty string such that: The first operation is to append a lower case alphabet to string S and The second operation is to append a copy of S to itself. Note: The first operat