Hi everyone! I recently tried my hand at problemsetting and created my very first problem. I would be very glad if you could take a couple of minutes to solve it and share your feedback in the comments!
About the Problem
- Name: Equal Ends
- Problem Link: View Problem
- Time Limit: 1 second
- Memory Limit: 256 megabytes
Problem Statement
You are given a string $$$s$$$ consisting of lowercase English letters. A string is called "good" if its first character is the same as its last character. Given the string $$$s$$$, determine whether it is good. Print YES if it is good, and NO otherwise.
--- ### Hint / Solution Idea To solve this problem, you don't need any complex data structures. You just need to: 1. Read the string into a standard variable. 2. Access the first character of the string (index 0). 3. Access the last character of the string (index s.length() - 1 or s.back()). 4. Compare them and print the corresponding answer.
I would appreciate any feedback, suggestions, or criticism since this is my first experience creating problems! Good luck and happy coding!
Input
The only line contains a string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters.
Output
Print "YES" if the string is good. Otherwise, print "NO".
Input The only line contains a string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters.
Output Print "YES" if the string is good. Otherwise, print "NO".
my bad 2 input 2 output