
Asked in CGI Group
String Compression Problem Statement
Ninja needs to perform basic string compression. For any character that repeats consecutively more than once, replace the repeated sequence with the character followed by the count of repetitions.
Input:
An integer 'T' representing the number of test cases.
For each test case, a string 'S' indicating the input string to be compressed.
Output:
Output the compressed string for each test case on a new line.
Example:
If the string contains 'x' repeated 5 times, replace 'xxxxx' with 'x5'.
Compression occurs only if the repeated count is greater than 1.
Constraints:
- 1 ≤ T ≤ 5
- 1 ≤ |S| ≤ 5000
- Consecutive count of any character in the input is ≤ 9
Note:
There's no need for input or output operations, as these are already managed. Just implement the required function.
Anonymous
1y
import java.util.LinkedHashMap; public class Main { public static void main(String[] args) { String s="iyyer"; String s1=""; char [] ch=s.toCharArray(); for(char i:ch){ System.out.print(i+" "); } Link...read more
Help your peers!
Add answer anonymously...
Top Software Engineer Interview Questions Asked at CGI Group
Q. Are you willing to relocate to Bangalore?
Q. What are the types of marker interfaces?
Q. Name two design patterns used in the project.
Interview Questions Asked to Software Engineer at Other Companies
Top Skill-Based Questions for CGI Group Software Engineer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

