Given an Array A consisting of N balls. All the balls are either 'Red' or 'Green'. You can pick 4 balls from the given array(not necessarily consecutive), to form a set. A set of 4 balls is said to be perfect if it contains: 1. Two red followed by two green balls, i.e "RRGG". 2. Two green followed by two red balls, i.e "GGRR" You have to count the number of possible ways of forming a perfect set out of the given balls. roblem Constraints 1 <= |A| <= 105 A, 'R', if ith ball is "Red". A-'G'. if ith ball is "Green". mput Format The first and only argument is string A, which describes the balls in the array.

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
icon
Related questions
Question

Plz solve it quick on java 

Given an Array A consisting of N balls. All the balls are either 'Red' or 'Green'. You can pick 4 balls from the given array(not necessarily consecutive), to form a set. A set of 4 balls is said to be perfect if it contains:
1. Two red followed by two green balls. i.e "RRGG".
2. Two green followed by two red balls, i.e "GGRR"
You have to count the number of possible ways of forming a perfect set out of the given balls.
Problem Constraints
1 <= |A| <= 105
A₁ = 'R', if ith ball is "Red".
A₁ = 'G', if ith ball is "Green".
Input Format
The first and only argument is string A, which describes the balls in the array.
Output Format
Return an integer denoting the number of possible perfect sets which you can form.
Example Input
Input 1:
A "RGRRGR"
Input 2:
A "GRGGRGR"
Example Output
Transcribed Image Text:Given an Array A consisting of N balls. All the balls are either 'Red' or 'Green'. You can pick 4 balls from the given array(not necessarily consecutive), to form a set. A set of 4 balls is said to be perfect if it contains: 1. Two red followed by two green balls. i.e "RRGG". 2. Two green followed by two red balls, i.e "GGRR" You have to count the number of possible ways of forming a perfect set out of the given balls. Problem Constraints 1 <= |A| <= 105 A₁ = 'R', if ith ball is "Red". A₁ = 'G', if ith ball is "Green". Input Format The first and only argument is string A, which describes the balls in the array. Output Format Return an integer denoting the number of possible perfect sets which you can form. Example Input Input 1: A "RGRRGR" Input 2: A "GRGGRGR" Example Output
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Arrays
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.
Similar questions
  • SEE MORE QUESTIONS
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