We are given a string, we need check whether the first and last characters of the string str are equal or not. Case sensitivity is to be considered.
Examples :
Input : university Output : Not Equal Explanation: In the string "university", the first character is 'u' and the last character is 'y', as they are not equal, "Not Equal" is the output. Input : racecar Output : Equal Explanation: In the string "racecar", the first character is 'r' and the last character is 'r', as they are equal, "Equal" is the output.
C++
// C++ program to check if the first // and the last characters of a string // are equal or not. #include<iostream> using namespace std; // Function to check if the first // and the last haracters of a // string are equal or not. int areCornerEqual(string s) { int n = s.length(); if (n < 2) return -1; if (s[0] == s[n - 1]) return 1; else return 0; } // Driver code int main() { string s = "GfG"; int res = areCornerEqual(s); if (res == -1) cout<<"Invalid Input"; else if (res == 1) cout<<"Equal"; else cout<<"Not Equal"; } // This code is contributed by // Smitha Dinesh Semwal |
chevron_right
filter_none
Java
// Java program to check if the first and the last // characters of a string are equal or not. class GFG { public static int areCornerEqual(String s) { int n = s.length(); if (n < 2) return -1; if (s.charAt(0) == s.charAt(n-1)) return 1; else return 0; } // Driver code public static void main(String[] args) { String s = "GfG"; int res = areCornerEqual(s); if (res == -1) System.out.println("Invalid Input"); else if (res == 1) System.out.println("Equal"); else System.out.println("Not Equal"); } } |
chevron_right
filter_none
Python3
# Python program to check # if the first and the # last characters of a # string are equal or not. st = "GfG"if(st[0] == st[-1]): # print output # if condition # is satisfied print("Equal") else: # print output # if condition is # not satisfied print("Not Equal") # This code is contributed by # shivi Aggarwal |
chevron_right
filter_none
C#
// Java program to check if the first and the last // characters of a string are equal or not. using System; class GFG { public static int areCornerEqual(String s) { int n = s.Length; if (n < 2) return -1; if (s[0] == s[n - 1]) return 1; else return 0; } // Driver code static public void Main () { String s = "GfG"; int res = areCornerEqual(s); if (res == -1) Console.WriteLine("Invalid Input"); else if (res == 1) Console.WriteLine("Equal"); else Console.WriteLine("Not Equal"); } } // This code is contributed by Ajit. . |
chevron_right
filter_none
PHP
<?php // PHP program to check if // the first and the last // characters of a $are // equal or not. function areCornerEqual($s) { $n = strlen($s); if ($n < 2) return -1; if ($s[0] == $s[$n - 1]) return 1; else return 0; } // Driver code $s = "GfG"; $res = areCornerEqual($s); if ($res == -1) echo ("Invalid Input"); else if ($res == 1) echo ("Equal"); else echo ("Not Equal"); // This code is contributed by // Manish Shaw(manishshaw1) ?> |
chevron_right
filter_none
Output:
Equal
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Java program to swap first and last characters of words in a sentence
- Count substrings with same first and last characters
- Recursive solution to count substrings with same first and last characters
- Count substrings with different first and last characters
- Check whether second string can be formed from characters of first string
- Check length of a string is equal to the number appended at its last
- Check if the first and last digit of number N is prime and their sum is less than K
- Check if characters of a given string can be used to form any N equal strings
- Print the first and last character of each word in a String
- Remove the first and last character of each word in a string
- Capitalize the first and last character of each word in a string
- Reverse every word of the string except the first and the last character
- Remove the first and last occurrence of a given Character from a String
- How to find the first and last character of a string in Java
- Remove first and last character of a string in Java
- Swap the first and last character of a string in Java
- Remove characters from the first string which are present in the second string
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Count of times second string can be formed from the characters of first string
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
