| Fizz Buzz Leetcode | In Fizz Buzz problem we have given a number n, print the string representation of numbers from 1 to read more |
| Next Permutation | In the next permutation problem we have given a word, find the lexicographically read more |
| Repeated Substring Pattern | In repeated substring patterns we have given a string check if it can be constructed by taking a read more |
| Letter Case Permutation | In letter case permutation we have given a string consisting of alphabets and numbers only, each read more |
| Longest Common Prefix using Sorting | In the Longest Common Prefix using Sorting problem we have given a set of strings, find the longest read more |
| Word Break | Word Break is a problem that beautifully illustrates a whole new concept. We have all heard of read more |
| Word Pattern | We have all come across word patterns like “ABBA”, “AABB” and so on. We read more |
| Regular Expression Matching | In the Regular Expression Matching problem we have given two strings one (let’s assume it x) read more |
| Reorganize String | In Reorganize String problem we have given a string containing some characters “a-z” read more |
| String Compression | In the String Compression problem, we have given an array a[ ] of type char. Compress it as the read more |
| Valid Parentheses | In Valid Parentheses problem we have given a string containing just the characters ‘(‘, read more |
| Longest Common Prefix using Trie | In the Longest Common Prefix using Trie problem we have given a set of strings, find the longest read more |
| Valid Number | In the Valid Number problem we have given a string, check if it can be interpreted into a valid read more |
| Find the Closest Palindrome number | Problem In Find the Closest Palindrome number problem we have given a number n. Find a number which read more |
| Count and Say | Count and Say in which we have given a number N and we need to find the Nth term of the count and read more |
| Find unique character in a string | In Find unique character in a string problem, we have given a string containing only lower case read more |
| Integer to Roman | Integer to Roman conversion. We have given a number N and we need to print the Roman number of N. read more |
| Rabin Karp Algorithm | Rabin Karp Algorithm used to find the pattern string in the given text string. There are so many read more |
| Isomorphic Strings | Isomorphic Strings – Given two strings we need to check if for every occurrence of a read more |
| String comparison containing wildcards | In String comparison containing wildcards problem, we have given two strings second string contains read more |
| Check whether strings are k distance apart or not | Given two strings and an integer k, write a function to check whether the given strings are k read more |
| Program to toggle all characters in a string | Given a string, write a function to toggle all characters of the given string. Here toggle means read more |
| Check length of a string is equal to the number appended at its last | Given a string that is appended with a number at last, write a function that checks whether the read more |
| Generate all binary strings without consecutive 1’s | Given an integer k, write a function to print all binary strings of size k with no consecutive read more |
| Check if all rows of a matrix are circular rotations of each other | Given a matrix, write a function to find whether all rows are circular rotations of each other or read more |
| Sort a string according to another string | Given two input strings, a pattern and a string. We need to sort the string according to the order read more |
| Check if string can become empty by recursively deleting given sub-string | Check if the given input string can be deleted completely by deleting given input sub-string read more |
| Smallest palindrome after replacement | Given input string contains lower case alphabets characters and dots(.). We need to replace all read more |
| Check if string follows order of characters by a pattern or not | Check if characters in the given input string follows the same order as determined by characters read more |
| split-four-distinct-strings | Check if the given input string can split into 4 strings such that each string is non-empty and read more |
| Even sub-string count | In the given input string of digits, find the count of substrings which when convert into integer read more |
| Reverse string without temporary variable | Write a function to reverse a string without using extra variable. Example Input string : read more |
| Recursive Palindrome check | Write a recursive function to check if given string is palindrome or not. Examples Racecar – is a read more |
| Minimum number of characters to be removed to make a binary string alternate | Given a binary string, write a function that will find minimum number of characters that can be read more |
| Print all palindromic partitions of a string | Given a string, write a function to print all possible palindromic patitioning of s Example INPUT read more |
| Count of character pairs at same distance as in english alphabets | Given a string, write a function that will print the number of pairs whose elements are at same read more |
| Minimum characters to be added at front to make string palindrome | Given a string, write a function to find the minimum characters to be added at front to make string read more |
| Convert a string that is repetition of a substring of length k | Given a string and legth k, write a function to check whether is it possible to convert it to a read more |
| Nth character in Concatenated Decimal string | Given a string in which all decimals are concatenated , write a function to find the Nth character read more |
| Kth Non-repeating character | In the given string, find the kth non-repeating character. Example Input string : read more |
| Compare two version numbers | Given two input strings, which are in form of version numbers. A version number looks like a.b.c.d read more |
| Remove minimum characters so that two strings become anagrams | Given two input strings, fins minimum number characters to be removed from these two strings such read more |
| Generate all binary strings from given pattern | The given input string consists of 0, 1 and ? (wildcard char), we need to generate all possible read more |
| Print all possible ways to break a string in bracket form | For the give input string, find all possible ways to break the given string in bracket form. read more |
| Caesar Cipher | The Caesar Cipher technique is one of the earliest technique of encryption. That is, Ex(x) = (x + read more |
| Longest common subsequence withpermutations | Find the longest string whose permutations are sub-sequences of given two strings. Output longest read more |
| Perfect reversible string | Check that if reverses of all possible substrings of input string are present in string or not. If read more |
| Longest palindrome can be formed by removing or rearranging characters | Find the longest palindrome that can be constructed by removing or rearranging characters from the read more |
| Longest common prefix (word by word) | In the given input set of strings, write a program to find the longest common prefix. Examples read more |
| Longest common prefix (Character by character) | In the given input set of strings, write a program to find the longest common prefix. Examples: read more |
| Permutations (STL) | Print all the permutations of the input string using STL functions. Example Input string : read more |
| Calculate sum of all numbers present in a string | Given a string of alpha numeric characters, write a function that will calculate all the numbers read more |
| Longest Common Prefix (Using Divide and Conquer) | Given a array of strings, write a function that will print the longest common prefix If there is no read more |
| Lower Case To Upper Case | Given a string with only lower case letters, write a function that will print the same string but read more |
| Longest Common Prefix (Using Biary Search) | Given a array of strings, write a function that will print the longest common prefix If there is no read more |
| Print shortest path to print a string on screen | Given screen containing aplhabets from A-Z and input string, by using remote we can go from one read more |
| Remove Extra Spaces from a string | Given a string, write a function to remove all extra spaces from the given string Example INPUT s = read more |
| Change gender of a given string | Given a string, write a function that will toggle all the gender specific words in the input string read more |
| Count number of substrings with k distinct characaters | Given a string(which has only lowercase allphabets) and a value k, write a function that will print read more |
| Removing spaces from a string using stringstream | Given a string, write a function which uses stringstream to remove spaces from the given string read more |
| PANGRAM CHECK | Check if the given string is Pangram or not. Pangram : A sentence(string) containing every letter read more |
| Repeated subsequence of length 2 or more | In the given string, find if there is any subsequence of length 2 0r more. The sub-sequences should read more |
| Palindrome permutations of a string | For the given input string, print all the possible palindromes that can be generated using read more |
| Split a string | Write a program to Split a given input string by any delimiter. Example a) Input string : read more |
| 1`s and 2`s complement of binary number | For the given binary number, print its 1`s and 2`s complement. 1`s complement of a binary is read more |
| Longest Common Extension | Given a string s and some of the pairs (L,R), write a function that will output the length of the read more |
| Convert string1 to string2 in one edit | Edits 1. Add a character. 2. Delete a character. 3. Change a character. find if read more |
| Find First non-repeating character in a string | In the given stream of characters(string), find the first non-repeating character. Example Input read more |
| Remove recurring digits in a given number | Given a numer which is represented in string, write a function that will remove recurring digits in read more |
| Recursively print all the sentences that can be formed from list of word lists | Given a list of word lists, write a functions to print all possible sentences one by one by taking read more |
| Online algorithm for checking palindrome in a stream | Given a stream of characters(charcaters are recieved one by one), write a function that will print read more |
| Check if two given strings are isomorphic to each other | Given two strings s1 and s2, write a function that says whether the given strings are isomorphic or read more |
| Length of longest valid substring | Given a string which contains opnening and closing paranthesis, write a function that will find the read more |
| Program to add two binary digits | Given two binary strings, write a function that print the sum of the giiven two binary strings. read more |
| Recursive Implementation of atoi() | atoi() function takes an string(which is a number) as an argument and returns its value Example read more |
| Reverse a string without affecting special characters | Given a string which contains special characters(such as %,&,*,^,$) and read more |
| Recursive function to do substring search | Given two strings s1 and s2, write a recursive function that returns TRUE if s2 is present in s1 read more |
| Print Longest common subsequence | Given two strings s1 and s2, write a function that will find the longest subsequence present in read more |
| Rotate string to get lexicographically minimum string | Write a function to find lexicographically minimum string in a circular string(array). Example a) read more |
| Number of sub-strings which recursively add up to 9 | Given a string which represent a number, we need to write a function to find the number of read more |
| Palindrome string (number) | Check whether the given string is palindrome or not. Given string is form of positive number. read more |
| Print all possible words from phone digits | Given a string of numbers, each number represents a number on the QWERTY keyboards, texts and read more |
| Shortest Superstring Problem | Given array of strings, write a function that will print the smallest string that contains each read more |
| Transform one string to another using minimum number of given operations | Given two strings s1 and s2, write a function that will convert s1 to s2(if possible) by using only read more |
| Print string of odd length in ‘X’ format | Given a string of odd length, write a function that will print the string in X format as show below read more |
| Minimum insertions to form a shortest palindrome | Given a string, write a function that will print the least number of charcaters that should be read more |
| print all palindromic partitions | Given a string, write a function that will print all palindromic partitions of a given string read more |
| Check rearranged string can form a palindrome | Check if the input string can be rearranged such that it can be a palindrome. Example Input string read more |
| Palindromes in a given range | Print all the palindromes in the given range of numbers. Example Input : {100, 200} Output : 101, read more |
| String(represents an integer) to value | Write a function which converts the given string(which represents an integer) to its value. Example read more |
| Count the number of words | In the given string, find the numbers of words in it. Words can be separated by space (or) new line read more |
| Print all anagrams together in a sequence of words | Given a sequence of words, print all anagrams together. Example Input : words[] =[“apt, are, ear, read more |
| Lexicographic rank of string | Find the lexicographic rank of a string. (string without duplicates) Example Input string : read more |
| Remove spaces from a string | Given a string, write a function that will print the given string without spaces Example: INPUT : read more |
| Find, second, frequent, character | Given a string, write a function that will find the second most frequent character Example INPUT : read more |
| Find the second most frequent character | Given a string, write a function that will find the second most frequent character Example INPUT : read more |
| Check if a given string is a rotation of a palindrome | Given a string, write a function that will return TRUE if it is a rotation of any palindrom else read more |
| Sort an array of strings | Given an array of strings, write a function to sort them alphabetically Example INPUT : arr[] = read more |
| Recursively remove all adjacent duplicates | Given a string, write a function that will recursively remove all adjacent duplicates. Example 1 read more |
| Remove ‘b’ and ‘ac’ from a given string | Given a string, write a function to eliminate all “b” and “ac” in the read more |
