Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
43 lines (34 loc) · 897 Bytes

File metadata and controls

43 lines (34 loc) · 897 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
// https://www.facebook.com/abhi.sensharma/posts/1241788872853419
// Subscribed by Abhishek Sharma
// Here I have added the Check Algorithm program using Java
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
for (int tc = 0; tc < T; ++tc) {
String S = sc.next();
System.out.println(solve(S) ? "YES" : "NO");
}
sc.close();
}
static boolean solve(String S) {
StringBuilder compressed = new StringBuilder();
char current = 0;
int count = -1;
for (int i = 0; i <= S.length(); ++i) {
if (i != S.length() && S.charAt(i) == current) {
count++;
} else {
if (count > 0) {
compressed.append(current).append(count);
}
if (i != S.length()) {
current = S.charAt(i);
count = 1;
}
}
}
return compressed.length() < S.length();
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.