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 :
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome
- Count pair of strings whose concatenation of substrings form a palindrome
- Longest palindromic String formed using concatenation of given strings in any order
- Caesar Concatenation
- Pairs whose concatenation contain all digits
- Number of pairs with Pandigital Concatenation
- Lexicographical concatenation of all substrings of a string
- Print Concatenation of Zig-Zag String in 'n' Rows
- Find the number obtained after concatenation of binary representation of M and N
- Ropes Data Structure (Fast String Concatenation)
- Search in an array of strings where non-empty strings are sorted
- Meta Strings (Check if two strings can become same after a swap in one string)
- Count of same length Strings that exists lexicographically in between two given Strings
- Count of strings that become equal to one of the two strings after one removal
- Pairs of complete strings in two sets of strings
- Number of common base strings for two strings
- Longest palindromic string formed by concatenation of prefix and suffix of a string
- Distinct strings such that they contains given strings as sub-sequences
- PHP | 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 firstname.lastname@example.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.