## Sum of the alphabetical values of the characters of a string

You are given an array of strings str, the task is to find the score of a given string s from the array. The score… Read More »

- Java program to check whether a string is a Palindrome
- Largest substring with same Characters
- InfyTQ 2019 : Find the position from where the parenthesis is not balanced
- C++ program to compare two Strings using Operator Overloading
- Swap characters in a String
- Rearrange the characters of the string such that no two adjacent characters are consecutive English alphabets
- Sort an array of strings according to string lengths using Map
- Convert an unbalanced bracket sequence to a balanced sequence
- Check whether two strings are anagrams of each other using unordered_map in C++
- Maximum number of given operations to remove the entire string
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Maximum String Partition
- Number of substrings that start with "geeks" and end with "for"
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Round the given number to nearest multiple of 10 | Set-2
- Count number of substrings of a string consisting of same characters
- String Range Queries to find the number of subsets equal to a given String
- Count of words ending at the given suffix in Java
- Program to duplicate Vowels in String
- Count all substrings having character K
- Lexicographically smallest string of length N and sum K
- Compare two strings considering only alphanumeric characters
- Minimum given operations required to convert a given binary string to all 1's
- Minimum operations required to convert a binary string to all 0s or all 1s
- Encrypt the given string with the following operations
- Check duplicates in a stream of strings
- Frequency of a substring in a string using pthread
- Queries for rotation and Kth character of the given string in constant time
- Recursive program to replace all occurrences of pi with 3.14 in a given string
- Minimum number of substrings the given string can be splitted into that satisfy the given conditions

You are given an array of strings str, the task is to find the score of a given string s from the array. The score… Read More »

Given a string, the task is to count the number of words whose sum of Ascii values is less than and greater than or equal… Read More »

Given two strings A and B, both strings contain characters a and b and are of equal lengths. There is one _ (empty space) in… Read More »

Given a string, find minimum no of swaps(not necessarily adjacent) to convert it into a string which have similar characters side by side. Examples: Input… Read More »

Given an integer N and a lowercase string. The string is repeated infinitely. The task is to find the No. of occurrences of a given… Read More »

Given a string including lowercase alphabets and numeric digits. The task is to construct another string which consist of sum of digits followed by sum… Read More »

Given a string str consisting of lowercase English alphabets, the task is to find the total number of palindromic sub-strings present in the sorted form… Read More »

Given a number in the form of a string. The task is to find the maximum sum and product of m consecutive digits that are… Read More »

Given a string str. The task is to count the minimum number of elements to be removed so that pairwise consecutive elements are same Examples:… Read More »

Given a string of length N of lowercase characters containing 0 or more vowels, the task is to find the count of vowels occurred in… Read More »

Given two strings, the task is to check whether the frequencies of a character(for each character) in one string is a multiple or a factor… Read More »

Given a number N, the task is to find the smallest number not less than N, which has all digits odd. Examples: Input: N =… Read More »

Given a string str, the task is to count the number of alphabets having ascii in the range [l, r]. Examples: Input: str = “geeksforgeeks”… Read More »

Given an incomplete bracket sequence S. The task is to find the number of closing brackets ‘)’ needed to make it a regular bracket sequence… Read More »

Given an integer N. The task is to find the lexicographically smallest permutation of integer of the form: 12345…N such that no digit occurs at… Read More »