Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Given a string, write a method to find the first non-repeating vowel (a, e, i, o, u) in it and return its index. If it doesn't exist, return -1. Assume that all the characters of the String is lowercase. Do not use String class functions other than charAt() and length() You can also try to solve with Map data structure like using a Map variable.

Given a string, write a method to find the first non-repeating vowel (a, e, i, o, u) in it and return its index. If it doesn't exist, return -1. Assume that all the characters of the String is lowercase. Do not use String class functions other than charAt() and length() You can also try to solve with Map data structure like using a Map variable.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

Use Java

Practice / First Non-Repeating Vowel Given a string, write a method to find the first non-repeating vowel (a, e, i, o, u) in it and return its index. ● If it doesn't exist, return -1. ● Assume that all the characters of the String is lowercase. Do not use String class functions other than charAt() and length() You can also try to solve with Map data structure like using a Map<Character, Integer> variable. ● Example input: google output: 5 explanation: only e is non-repeated vowel and it's index is 5 Example input: mood output: -1 explanation: o is repeated, no non-repeating vowel. Example input: responsible output: 4 explanation: e is repeated, o and i are not repeated, o is the first non-repeating vowel
Transcribed Image Text:Practice / First Non-Repeating Vowel Given a string, write a method to find the first non-repeating vowel (a, e, i, o, u) in it and return its index. ● If it doesn't exist, return -1. ● Assume that all the characters of the String is lowercase. Do not use String class functions other than charAt() and length() You can also try to solve with Map data structure like using a Map<Character, Integer> variable. ● Example input: google output: 5 explanation: only e is non-repeated vowel and it's index is 5 Example input: mood output: -1 explanation: o is repeated, no non-repeating vowel. Example input: responsible output: 4 explanation: e is repeated, o and i are not repeated, o is the first non-repeating vowel
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Math class and its different methods
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS