Java String Exercises: Return a string where every appearance of the lowercase word 'is' has been replaced with'is not'

Java String: Exercise-88 with Solution

Write a Java program to return a string where every appearance of the lowercase word 'is' has been replaced with'is not'.

Sample Solution:

Java Code:

import java.util.*;
public class Main
{
public String wordReplaceBy(String stng) 
{
  String newstring = "";
  int l = stng.length();
  for(int i = 0; i < l; i++)
  {
    if(i-1 >= 0 && Character.isLetter(stng.charAt(i-1))|| i+2 < l && Character.isLetter(stng.charAt(i+2))) 
	{
      newstring += stng.charAt(i);
    }
    else if(i+1 < l && stng.substring(i, i+2).equals("is")) 
	{
      newstring += "is not";
      i++;
    }
    else newstring += stng.charAt(i);
  }
  return newstring;
}

public static void main (String[] args)
    {
      Main m= new Main();
      String str1 =  "it is a string";
      System.out.println("The given string is: "+str1);
      System.out.println("The new string is: "+m.wordReplaceBy(str1));
	  }
}

Sample Output:

The given string is: it is a string
The new string is: it is not a string

Flowchart:

Java Code Editor:

Improve this sample solution and post your code through Disqus

Previous: Write a Java program to check whether a z is happy or not. A 'z' is happy when there is another 'z' immediately to its left or right.Return true if all the z's in the given string are happy.
Next: Write a Java program to return the sum of the numbers (may form more than one digits),appearing in the string.