There are two string operators. The first is the concatenation operator (‘.‘), which returns the concatenation of its right and left arguments. The second is the concatenating assignment operator (‘.=‘), which appends the argument on the right side to the argument on the left side.
Input : string1: Hello string2 : World! Output : HelloWorld! Input : string1: geeksfor string2: geeks Output : geeksforgeeks
Code #2 :
Code #3 :
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.
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome
- Longest palindromic String formed using concatenation of given strings in any order
- Count pair of strings whose concatenation has every vowel
- Count of pairs of strings whose concatenation forms a palindromic string
- Count pair of strings whose concatenation of substrings form a palindrome
- Ropes Data Structure (Fast String Concatenation)
- Longest palindromic string formed by concatenation of prefix and suffix of a string
- Lexicographical concatenation of all substrings of a string
- Find the number obtained after concatenation of binary representation of M and N
- Caesar Concatenation
- Minimum flips required to convert given string into concatenation of equal substrings of length K
- Check if given string is a substring of string formed by repeated concatenation of z to a
- Pairs whose concatenation contain all digits
- Print Concatenation of Zig-Zag String in 'n' Rows
- Check if a string is concatenation of another given string
- Minimize cost to convert given string into concatenation of equal substrings of length K
- Number of pairs with Pandigital Concatenation
- Pairs of complete strings in two sets of strings
- Meta Strings (Check if two strings can become same after a swap in one string)
- Number of common base strings for two strings
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.