Try it on GfG Practice Given two matrices, the task is to multiply them. Matrices can either be square or rectangular: Examples: (Square Matrix Multiplication) Input: m1[m][n] = { {1, 1}, {2, 2} } m2[n][p] = { {1, 1}, {2, 2} } Output: res[m][p] = { {3, 3}, {6, 6} } (Rectangular Matrix…

Given an image represented by m x n matrix, rotate the image by 90 degrees in clockwise direction. Please note the dimensions of the result matrix are going to n x m for an m x n input matrix. Input: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Output: 13 9 5 1 14 10 6 2 15 11 7 3 16 12 8 4 Another…

In Java, a String is the type of object that can store a sequence of characters enclosed by double quotes, and every character is stored in 16 bits, i.e., using UTF 16-bit encoding. A string acts the same as an array of characters. Java provides a robust and flexible API for handling strings,…

In C++, strings are sequences of characters that are used to store words and text. They are also used to store data, such as numbers and other types of information in the form of text. Strings are provided by header file in the form of std::string class. Creating a String Before using strings,…

A String in C programming is a sequence of characters terminated with a null character '\0'. The C String is work as an array of characters. The difference between a character array and a C string is that the string in C is terminated with a unique character '\0'. Declaration Declaring a string in C…

Strings are sequences of characters. The differences between a character array and a string are, a string is terminated with a special character ‘\0’ and strings are typically immutable in most of the programming languages like Java, Python and JavaScript. Below are some examples of strings: "geeks"…

Try it on GfG Practice Given a string s, the task is to find the length of the string. Examples: Input: s = "abc" Output: 3 Input: s = "GeeksforGeeks" Output: 13 Input: s = "" Output: 0 Using In-built methods Every programming language offers a built-in method as well to find the length C++ // C++…

In PHP, strings are one of the most commonly used data types. A string is a sequence of characters used to represent text, such as words and sentences. Strings are enclosed in either single quotes (' ') or double quotes (" "). You can create a string using single quotes (' ') or double quotes ("…

JavaScript strings are the sequence of characters. They are treated as Primitive data types. In JavaScript, strings are automatically converted to string objects when using string methods on them. This process is called auto-boxing. The following are methods that we can call on strings. slice()…

In C#, a string is a sequence of Unicode characters or an array of characters. The range of Unicode characters will be U+0000 to U+FFFF. The array of characters is also termed as the text. So the string is the representation of the text. A string is an important concept, and sometimes people get…

A string is a sequence of characters. Python treats anything inside quotes as a string. This includes letters, numbers, and symbols. Python has no character data type so single character is a string of length 1. Python s = "GfG" print(s[1]) # access 2nd char s1 = s + s[0] # update print(s1) # print…

Given a string str and an array of indices chars[] that describes the indices in the original string where the characters will be added. For this post, let the character to be inserted in star (*). Each star should be inserted before the character at the given index. Return the modified string after…

Try it on GfG Practice Given a string and a position (0-based indexing), remove the character at the given position. Examples: Input : s = "abcde", pos = 1 Output : s = "acde" Input : s = "a", pos = 0 Output : s = "" Approach - By Using Built-In Methods C++ #include using namespace std; string…

Given a string s, a character c and an integer position pos, the task is to insert the character c into the string s at the specified position pos. Examples: Input: s = "Geeks", c = 'A', pos = 3 Output: GeeAks Input: s = "HelloWorld", c = '!', pos = 5 Output: Hello!World Table of Content…

Try it on GfG Practice Given a character ch and a string s, the task is to find the index of the first occurrence of the character in the string. If the character is not present in the string, return -1. Examples: Input: s = "geeksforgeeks", ch = 'k' Output: 3 Explanation: The character 'k' is…

Try it on GfG Practice Given two strings, the task is to check if these two strings are identical(same) or not. Consider case sensitivity. Examples: Input: s1 = "abc", s2 = "abc" Output: Yes Input: s1 = "", s2 = "" Output: Yes Input: s1 = "GeeksforGeeks", s2 = "Geeks" Output: No Approach - By Using…

Try it on GfG Practice Given a string s, the task is to check if it is a binary string or not. A binary string is a string which only contains the characters '0' and '1'. Examples: Input: s = "01010101010" Output: true Input: s = "geeks101" Output: false Approach: The idea is to iterate over all the…

Given a string s, containing lowercase alphabetical characters. The task is to print all non-empty substrings of the given string. Examples : Input : s = "abc" Output : "a", "ab", "abc", "b", "bc", "c" Input : s = "ab" Output : "a", "ab", "b" Input : s = "a" Output : "a" [Expected Approach] - Using…

Try it on GfG Practice Given a string s, the task is to reverse the string. Reversing a string means rearranging the characters such that the first character becomes the last, the second character becomes second last and so on. Examples: Input: s = "GeeksforGeeks" Output: "skeeGrofskeeG" Explanation…

String concatenation is the process of joining two strings end-to-end to form a single string. Examples Input: s1 = “Hello”, s2 = “World” Output: “HelloWorld” Explanation: Joining “Hello” and “World” results in “HelloWorld”. Input: s1 = “Good”, s2 = “Morning” Output: “GoodMorning” Explanation:…

Try it on GfG Practice Given a string and a character, remove all the occurrences of the character in the string. Examples: Input : s = "geeksforgeeks" c = 'e' Output : s = "gksforgks" Input : s = "geeksforgeeks" c = 'g' Output : s = "eeksforeeks" Input : s = "geeksforgeeks" c = 'k' Output : s =…

Try it on GfG Practice Given two strings txt and pat, the task is to find if pat is a substring of txt. If yes, return the index of the first occurrence, else return -1. Examples : Input: txt = "geeksforgeeks", pat = "eks" Output: 2 Explanation: String "eks" is present at index 2 and 9, so 2 is the…

Try it on GfG Practice Given a string s, the task is to check if it is palindrome or not. Example: Input: s = "abba" Output: 1 Explanation: s is a palindrome Input: s = "abc" Output: 0 Explanation: s is not a palindrome Using Two-Pointers - O(n) time and O(1) space The idea is to keep two pointers,…

Try it on GfG Practice Given a binary string, count the number of substrings that start and end with 1. Examples: Input: "00100101" Output: 3 Explanation: three substrings are "1001", "100101" and "101" Input: "1001" Output: 1 Explanation: one substring "1001" Recommended Practice Count Substrings…

Try it on GfG Practice Given a sentence having lowercase characters, the task is to convert it to Camel Case. In Camel Case, words are joined without spaces, the first word keeps its original case, and each subsequent word starts with an uppercase letter. Examples: Input: "i got intern at…

Given a string S, the task is to find the length of the longest substring between any pair of occurrences of same character. Examples: Input: S = "accabbacc" Output: 6 Explanation: The longest substring satisfying the required conditions is "cabbac", which lies between S[1](= 'c') and s[8](= 'c').…

Given a string s, the task is to identify all characters that appear more than once and print each as a list containing the character and its count. Examples: Input: s = "geeksforgeeks" Output: ['e', 4], ['g', 2], ['k', 2], ['s', 2] Explanation: Characters e, g, k, and s appear more than once. Their…

Try it on GfG Practice Given two strings s1 and s2 consisting of lowercase characters, the task is to check whether the two given strings are anagrams of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different.…

Try it on GfG Practice Given two strings s1 and s2, find if the first string is a Subsequence of the second string, i.e. if s1 is a subsequence of s2. A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.…

Given a string, find the minimum and the maximum length words in it. Examples: Input : "This is a test string" Output : Minimum length word: a Maximum length word: string Input : "GeeksforGeeks A computer Science portal for Geeks" Output : Minimum length word: A Maximum length word: GeeksforGeeks…

Try it on GfG Practice Given a string containing of '0', '1' and '?' wildcard characters, generate all binary strings that can be formed by replacing each wildcard character by '0' or '1'. Example : Input: str = "1??0?101" Output: 10000101 10001101 10100101 10101101 11000101 11001101 11100101…

Try it on GfG Practice Given a number n, count number of n length strings with consecutive 1's in them. Examples: Input : n = 2 Output : 1 There are 4 strings of length 2, the strings are 00, 01, 10 and 11. Only the string 11 has consecutive 1's. Input : n = 3 Output : 3 There are 8 strings of…

Given string s containing only lowercase characters, the task is to print the characters along with their frequency in the order of their occurrence and in the given format explained in the examples below. Examples: Input: s = "geeksforgeeks" Output: g2 e4 k2 s2 f1 o1 r1 Input: str = "elephant"…

Try it on GfG Practice Given a sequence of strings, the task is to find out the second most repeated (or frequent) string in the given sequence. You may assume that no two words are the second most repeated, there will be always a single word. Examples: Input: ["aaa", "bbb", "ccc", "bbb", "aaa",…

Try it on GfG Practice Given a string s, find the number of pairs of characters that are same. Pairs (s[i], s[j]), (s[j], s[i]), (s[i], s[i]), (s[j], s[j]) should be considered different. Examples : Input: air Output: 3 Explanation : 3 pairs that are equal are (a, a), (i, i) and (r, r) Input :…

Try it on GfG Practice Given a string s of lowercase English letters, the task is to find the first non-repeating character. If there is no such character, return '$'. Examples: Input: s = "geeksforgeeks" Output: 'f' Explanation: 'f' is the first character in the string which does not repeat. Input:…

Try it on GfG Practice Given a string S of length n, the task is to find the earliest repeated character in it. The earliest repeated character means, the character that occurs more than once and whose second occurrence has the smallest index. Example: Input: s = "geeksforgeeks" Output: e…

Try it on GfG Practice Write a method to replace all the spaces in a string with ‘%20’. You may assume that the string has sufficient space at the end to hold the additional characters and that you are given the “true” length of the string. Examples: Input: "Mr John Smith", 13 Output:…

Given a string s, the task is to print the frequency of each of the characters of s in alphabetical order. Example: Input: s = "aabccccddd" Output: a2b1c4d3 Since it is already in alphabetical order, the frequency of the characters is returned for each character. Input: s = "geeksforgeeks" Output:…

Given n binary strings, the task is to find their sum which is also a binary string. Examples: Input: arr[] = ["1101", "111"] Output: "10100" Explanation: Input : arr[] = ["1", "10", "11"] Output : "110" [Approach] Bit-by-bit addition with carry A simple idea is to initialise res = "0" and preform…