TopcoderArchiveVisit Topcoder
Archive
Algorithm problem

VowelFinder

Problem statement, definition, constraints, and public examples.

Problem Statement

The object of this problem is to find the largest consecutive sequence of
vowels in a given input string and return that string. If the two largest
strings found are the same size, the first one encountered should be returned.
For example :


lllleeeellllaaaall --> eeee
lllleeeellllaaaaall --> aaaaa
rewyuiyfudshjkrelwureiwo --> ui

Create a class VowelFinder that has the method findVowels, which takes any
String and returns the longest substring of consecutive vowels, or an empty
String if no vowels are found. Here is a method signature:

public String findVowels(String input);

Definition

Class:
VowelFinder
Method:
findVowels
Parameters:
String
Returns:
String
Method signature:
String findVowels(String param0)
(be sure your method is public)

Constraints

    Examples

      No public sample cases were explicitly marked for this problem in the original data.

      Back to all problems