Solutions are presented as using the least memory and the fastest execution time. It also takes the top
10 most recent solutions from each language. If you want to limit to a specific index, click the
"Solved" button and go to that problem.
Problems
B'A palindrome is a string that reads the same in both directions, for example z, uwu, or moom. The first line contains an integer t ( 1 <= q t <= q 100 ) -- the number of testcases. The following t lines each contain a string of length at most 100 consisting of lowercase English letters. For each test case, output "YES" or "NO", denoting the answer. '... |
Tutorials
Submissions
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|
254651432 |
karamkontar |
H |
April 2, 2024, 3:13 a.m. |
OK |
C# 10 |
TESTS |
15 |
77 |
0 |
|
|
|
254645011 |
yyrwlj Abel51 |
H |
April 2, 2024, 1:27 a.m. |
OK |
C++14 (GCC 6-32) |
TESTS |
15 |
46 |
307200 |
|
|
|
254642234 |
yimuhua |
H |
April 2, 2024, 12:32 a.m. |
OK |
C++14 (GCC 6-32) |
TESTS |
15 |
61 |
102400 |
|
|
remove filters
Back to search problems