Strings: Convert Roman Numerals to Decimal
Problem Statement: You are given a roman numeral, you need to convert into it’s corresponding decimal value. Example Input: IX Output: 9…
Strings: Count the number of string in 2D character array
Problem Statement: You are given a string and a 2D char array. You need to count the number of times the string is there in the 2D array. The…
Strings: Get the minimum number of inversions needed to make an expression balanced
Problem Statement: You are given a string consisting of “{” and “}”. You need to find the minimum number of inversions…
Strings: Convert a string into its mobile numeric keypad
Problem Statement: You are given a string, you need to convert that string into its equivalent mobile numeric keypad sequence. Example Input :…
Strings: Word Break Problem
Problem Statement: You are given a word and series of dictionary. You need to check if the word can be broken down into multiple words that…
Strings: Check balanced parenthesis
Problem Statement: You are given a set of parenthesis and you need to check if the given parenthesis are in correct exp. Example Input:…
Strings: Divide binary string into sub strings with equal number of 0s and 1s.
Problem Statement: You are given a string, you need to find the maximum count of substrings with equal number of 0s and 1s. Example Input:…
Strings: Permutations of a given string
Problem Statement: You are given a string, you need to find all the permutations of it. Example Input: abc Output: ABC ACB BAC BCA CBA CAB…
Strings: Given a string, print all the subsequence
Problem Statement: You are given a string, you need to find all the subsequence of it. A subsequence in a string is generated by deleting…
Strings: Longest Repeating Subsequence
Problem Statement: Given a string find the length of the longest repeating sub sequence. Here we need to find the sub sequence, not sub…