## InfyTQ 2019 : Find the position from where the parenthesis is not balanced

Given a string str consisting of parenthesis from [ “(” , “)” , “{” , “}” , “[” , “]” ]. If the String is… Read More »

- Repeated Character Whose First Appearance is Leftmost
- Convert character array to string in C++
- Count substrings that contain all vowels | SET 2
- Find the longest string that can be made up of other strings from the array
- Minimum number of times A has to be repeated such that B is a substring of it
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Check whether two strings contain same characters in same order
- Rearrange characters in a string such that no two adjacent are same using hashing
- Java program to check whether a string is a Palindrome
- Generate all permutations of a string that follow given constraints
- Minimum number of adjacent swaps to convert a string into its given anagram
- Check if two strings are same ignoring their cases
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Program to generate all possible valid IP addresses from given string | Set 2
- Maximize the happiness of the groups on the Trip
- Implement a Dictionary using Trie
- InfyTQ 2019 : Find the position from where the parenthesis is not balanced
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Minimum rotations required to get the same String | Set-2
- Check if a string can be obtained by rotating another string d places
- Append a digit in the end to make the number equal to the length of the remaining string
- Count of substrings which contains a given character K times
- C++ program to compare two Strings using Operator Overloading
- Reverse individual words with O(1) extra space
- Minimum number of sub-strings of a string such that all are power of 5
- Persistent Trie | Set 1 (Introduction)
- Total number of odd length palindrome sub-sequence around each centre
- Find uncommon characters of the two strings | Set 2

Given a string str consisting of parenthesis from [ “(” , “)” , “{” , “}” , “[” , “]” ]. If the String is… Read More »

Given a string str consisting of a sentence, the task is to find the count of words in the given sentence that end with the… Read More »

Given a string s of size N. The task is to find the largest substring which consists of same characters Examples: Input : s =… Read More »

Given string str of size N. The task is to write a recursive function to replace all occurrences of pi with 3.14 in the given… Read More »

Given a string s, the task is to encrypt the string in the following way: If the frequency of current character is even, then increment… Read More »

Given a string str containing lowercase English characters, we can perform the following two operations on the given string: Remove the entire string. Remove a… Read More »

Given string str of size N consists of lower-case English alphabets. The task is to find the arrangement of the characters of the string such… Read More »

Given a string str of lowercase English alphabets, the task is to check whether the string is a vowel prime or not. A string is… Read More »

Given two strings A and B. The task is to find the minimum number of times A has to be repeated such that B is… Read More »

Given an array of characters arr[] of size N and an integer K. You have to insert the characters into an empty string one by… Read More »

Given a string str representing a string, the task is to convert the given string into an integer. Examples: Input: str = “1234” Output: 1234… Read More »

Given a string str of lower case English alphabets. One can choose any two characters in the string and replace all the occurrences of the… Read More »

Given a string array arr[], the task is to find the longest sub-sequence of the array with at least one character appearing in all the… Read More »

Given a balanced parenthesis string which consists of ‘(‘ and ‘)‘. The task is to find the number of balanced parenthesis substrings in the given… Read More »

Given a string str in which an integer is appended in the end (with or without leading zeroes). The task is to find a single… Read More »