Imprime la string después de que se haya producido el carácter especificado dado no. de tiempos

Dada una string, un carácter y un conteo, la tarea es imprimir la string después de que el carácter especificado haya ocurrido un conteo de veces. Imprima «String vacía» en caso de condiciones insatisfactorias. (El carácter dado no está presente, o está presente pero es menor que el conteo dado, o el conteo dado se completa en el último índice). Si el recuento dado es 0, entonces el carácter dado no importa, solo imprima la string completa.

Ejemplos: 

// C++ program for above implementation
#include <iostream>
using namespace std;
 
// Function to print the string
void printString(string str, char ch, int count)
{
    int occ = 0, i;
 
    // If given count is 0
    // print the given string and return
    if (count == 0) {
        cout << str;
        return;
    }
 
    // Start traversing the string
    for (i = 0; i < str.length(); i++) {
 
        // Increment occ if current char is equal
        // to given character
        if (str[i] == ch)
            occ++;
 
        // Break the loop if given character has
        // been occurred given no. of times
        if (occ == count)
            break;
    }
 
    // Print the string after the occurrence
    // of given character given no. of times
    if (i < str.length() - 1)
        cout << str.substr(i + 1, str.length() - (i + 1));
 
    // Otherwise string is empty
    else
        cout << "Empty string";
}
 
// Drivers code
int main()
{
    string str = "geeks for geeks";
    printString(str, 'e', 2);
    return 0;
}

// Java program for above implementation
 
public class GFG
{
    // Method to print the string
    static void printString(String str, char ch, int count)
    {
        int occ = 0, i;
      
        // If given count is 0
        // print the given string and return
        if (count == 0) {
            System.out.println(str);
            return;
        }
      
        // Start traversing the string
        for (i = 0; i < str.length(); i++) {
      
            // Increment occ if current char is equal
            // to given character
            if (str.charAt(i) == ch)
                occ++;
      
            // Break the loop if given character has
            // been occurred given no. of times
            if (occ == count)
                break;
        }
      
        // Print the string after the occurrence
        // of given character given no. of times
        if (i < str.length() - 1)
            System.out.println(str.substring(i + 1));
      
        // Otherwise string is empty
        else
            System.out.println("Empty string");
    }
     
    // Driver Method
    public static void main(String[] args)
    {
        String str = "geeks for geeks";
        printString(str, 'e', 2);
    }
}

# Python3 program for above implementation
 
# Function to print the string
def printString(str, ch, count):
    occ, i = 0, 0
 
    # If given count is 0
    # print the given string and return
    if (count == 0):
        print(str)
 
    # Start traversing the string
    for i in range(len(str)):
 
        # Increment occ if current char
        # is equal to given character
        if (str[i] == ch):
            occ += 1
 
        # Break the loop if given character has
        # been occurred given no. of times
        if (occ == count):
            break
 
    # Print the string after the occurrence
    # of given character given no. of times
    if (i < len(str)- 1):
        print(str[i + 1: len(str) - i + 2])
 
    # Otherwise string is empty
    else:
        print("Empty string")
 
# Driver code
if __name__ == '__main__':
    str = "geeks for geeks"
    printString(str, 'e', 2)
 
# This code is contributed
# by 29AjayKumar

// C# program for above implementation
using System;
 
public class GFG {
     
    // Method to print the string
    static public void printString(string str,
                           char ch, int count)
    {
        int occ = 0, i;
     
        // If given count is 0
        // print the given string
        // and return
        if (count == 0) {
            Console.WriteLine(str);
            return;
        }
     
        // Start traversing the string
        for (i = 0; i < str.Length; i++)
        {
     
            // Increment occ if current
            // char is equal to given
            // character
            if (str[i] == ch)
                occ++;
     
            // Break the loop if given
            // character has been occurred
            // given no. of times
            if (occ == count)
                break;
        }
     
        // Print the string after the
        // occurrence of given character
        // given no. of times
        if (i < str.Length - 1)
            Console.WriteLine(str.Substring(i + 1));
     
        // Otherwise string is empty
        else
            Console.WriteLine("Empty string");
    }
     
    // Driver Method
    static public void Main()
    {
        string str = "geeks for geeks";
        printString(str, 'e', 2);
    }
}
 
// This code is contributed by vt_m.

<script>
 
// JavaScript program for above implementation
 
// Method to print the string
function printString(str, ch , count)
{
    var occ = 0, i;
  
    // If given count is 0
    // print the given string and return
    if (count == 0) {
        document.write(str);
        return;
    }
  
    // Start traversing the string
    for (i = 0; i < str.length; i++) {
  
        // Increment occ if current char is equal
        // to given character
        if (str.charAt(i) == ch)
            occ++;
  
        // Break the loop if given character has
        // been occurred given no. of times
        if (occ == count)
            break;
    }
  
    // Print the string after the occurrence
    // of given character given no. of times
    if (i < str.length - 1)
        document.write(str.substring(i + 1));
  
    // Otherwise string is empty
    else
        document.write("Empty string");
}
 
// Driver Method
var str = "geeks for geeks";
printString(str, 'e', 2);
 
// This code is contributed by Amit Katiyar
 
</script>