
Use while loop in Java Language
Write the method xyzMiddle().
*
* Given a String str, does "xyz" appear in the
* "middle" of the string. To define middle, we'll
* say that the number characters to the left and
* right of the "xyz" must differ by, at most, one.
*
* Examples:
* xyzMiddle("AAxyzBB") returns true
* xyzMiddle("AxyzBB") returns true
* xyzMiddle("AxyzBBB") returns false
*
* @param str the String to examine.
* @return true if xyz is in the "middle" of str.
*/
// TODO - Write the method xyZMiddle here.
/**
* Write the method named repeatSeparator().
*
* Given two String inputs, word and separator,
* along with a third int input count, return a
* big String consisting of count copies of word,
* each separated by separator.
*
* Note: This is a very common
* fencepost algorithm, because just like building a
* fence, you need 11 fenceposts to hold up 10 sections
* of fence.
*
* Examples:
* repeatSeparator("Word", "X", 3) returns "WordXWordXWord"
* repeatSeparator("This", "And", 2) returns "ThisAndThis"
* repeatSeparator("This", "And", 1) returns "This"
*
* @param word the first String parameter.
* @param separator the second String parameter.
* @param count the number of times to repeat word.
* @return a new String as described here.
*/
// TODO - Write the repeatSeparator method here.
/**
* Write the method named sameStarChar().
*
* Given a String str, return true if for every
* '*' (star) in the string, if there are chars
* both immediately before and after the star,
* they are the same.
*
* Note: This is a little tricker than it looks.
* One way to look at the problem is to see in
* what circumstances you should return false.
* You only return false if the characters on
* either side of the * are different. That means
* that if there are no characters in front of,
* or behind the *, then you should return true, not false.
*
* Examples:
* sameStarChar("xy*yzz") returns true
* sameStarChar("xy*zzz") returns false
* sameStarChar("*xa*az") returns true
*
* @param str the input String to process.
* @return true if the characters before and after are the same.

Trending nowThis is a popular solution!
Step by stepSolved in 3 steps with 1 images

- Pythonarrow_forwardFor this project, you will be writing regular expressions that look for and find all instances of a date in any given string. Your program should: Find the following different formats for dates: August 2nd, 1994 august 2, 1994 08/02/1994 08/02/94 08-02-1994 Your program should be case insensitive using re.IGNORECASE Your program can only have a maximum of two different regexes. A special prize goes to those of you who can fit all of this into one regex Your program should be able to tell if the date is a valid date. For example, if the date says 99/99/99, then your program should ignore this as a date. HINT: this is not done within the regex. Try saving your dates to something like a list and going through that list after your regex runs. At the end of your program, it should print out all of the dates in the following format: mm/dd/yyyy. EX. 08/02/1994 Your program should use at least two character classes, you may need more. Feel free to make your own custom classes as well.…arrow_forwardAsaparrow_forward
- Design a program with an algorithm that will take a string from the user and then decide if each character in that string is unique. For example, if you ask the user to enter a string and that user enters the world ‘hello’, the result of the algorithm implementedshould return ‘false’ or ‘not unique’. If the user enters a string such as the word ‘phone’ the program will return ‘true’ or ‘unique’ since every character in the word phone is unique and is not repeated. An example of this program follows: Output should show as : enter a string rizma This string has all the unique characters would u like to continue?(y for yes n for no) y Enter a string waali This string is not unique Your code should work for all strings and essentially all characters, as many examples will be tested.arrow_forwardin java String inputWord is read from input. Write a while loop that iterates until inputWord is equal to "Finale". In each iteration of the loop: Read integer clothingNumber from input. If clothingNumber is less than 30, output the value of inputWord, followed by ": low on stock" and a newline. Otherwise, output the value of inputWord, followed by ": well stocked" and a newline. Read string inputWord from input. Click here for example 1 2 3 4 5 6 7 8 9 10 11 12 13 14 import java.util.Scanner; public class PairedDataProcessing { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); StringinputWord; intclothingNumber; inputWord=scnr.next(); /* Your code goes here */ } }arrow_forwardPlease &-. Write a Java program to check if a given string is a palindrome or not. A palindrome is a word, phrase, number, or other sequence of characters that reads the same backward as forward, ignoring spaces, punctuation, and capitalization. For example, "racecar" and "Madam" are palindromes, while "hello" and "Java" are not. Your program should take a string as input and return true if it's a palindrome, and false otherwise. Ik.?arrow_forward
- Please solve this in Java Thankarrow_forwardWrite a program that removes all non-alphabetic characters from the given input. Ex: If the input is: -Hello, 1 world$! the output is: Helloworld The program must define and call the following method that takes a string as a parameter and returns the string without any non- alphabetic characters. public static String removeNonAlpha (String userString)arrow_forwardIn Java: Forms often allow a user to enter an integer. Write a program that takes in a string representing an integer as input, and outputs yes if every character is a digit 0-9. Ex: If the input is: 1995 the output is: yes Ex: If the input is: 42,000 or 1995! the output is: no Hint: Use a loop and the Character.isDigit() function.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





