## Total number of odd length palindrome sub-sequence around each centre

Given a string str, the task is to find the number of odd length palindromic sub-sequences around of str with str[i] as centre i.e. every… Read More »

- Print all permutations of a string in Java
- Methods to concatenate string in C/C++ with Examples
- Check for balanced parentheses in Python
- Coviam Software Developer Internship Experience
- Java Program to print distinct permutations of a string
- Find the first maximum length even word from a string
- Count common characters in two strings
- Repeated Character Whose First Appearance is Leftmost
- Arcesium Interview Experience ( FTE On-Campus)
- Operations required to make the string empty
- Java ArrayList to print all possible words from phone digits
- Check whether two strings contain same characters in same order
- Program to find the kth character after decrypting a string
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Count of words that are present in all the given sentences
- Generate all permutations of a string that follow given constraints
- Minimum length substring with exactly K distinct characters
- Count occurrences of a string that can be constructed from another given string
- Maximize the happiness of the groups on the Trip
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Find the minimum number of preprocess moves required to make two strings equal
- Find the longest string that can be made up of other strings from the array
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Maximize the value of A by replacing some of its digits with digits of B
- Check if two strings are same ignoring their cases
- Minimum steps to delete a string by deleting substring comprising of same characters
- Print the longest prefix of the given string which is also the suffix of the same string
- Minimum rotations required to get the same String | Set-2
- Convert character array to string in C++
- Find k-th character of decrypted string | Set - 2

Given a string str, the task is to find the number of odd length palindromic sub-sequences around of str with str[i] as centre i.e. every… Read More »

Given a string consisting of numerical alphabets, a character C and an integer K, the task is to find the number of possible substrings which… Read More »

Given a string str consisting of digits, the task is to find the number of possible 4 digit sub-sequences which are of the form (x,… Read More »

Given a string str and an integer K, the task is to find the length of the longest sub-string S’ such that every character in… Read More »

Given a string str, the task is to answer Q queries where every query consists of two integers L and R and we have to… Read More »

Given a string, we need to find the minimum number of rotations required to get the same string. In this case, we will only consider… Read More »

Given four integers l, m, x and y. The task is to check whether it is possible to make a binary string consisting of l… Read More »

Given a string, the task is to count the number of adjacent pairs such that the first element of the pair is a consonant and… Read More »

A trip to mystical land is going to be organized in ByteLand, the city of Bytes. Unfortunately, there are limited seats say A and there… Read More »

Given two strings s1 and s2, the task is to find whether the two string contain the same characters that occur in the same order.… Read More »

Given a string S of length N consisting of lower-case English albhabets and an integer ‘l’, find the number of distinct sub-strings of length ‘l’… Read More »

Given an array of strings arr[] and Q queries where each each query consists of a string str, the task is to find the longest… Read More »

Given a string str of lower case alphabets and a non-negative integer K. The task is to find the number of pairs of characters in… Read More »

Given two strings str1 and str2, the task is to find and print the uncommon characters of the two given strings in sorted order without… Read More »

Given a string str, the task is to count the number of ways a palindromic sub-string could be formed by concatenation of three sub-strings x,… Read More »