## Find all possible palindromic substrings in a string

Given a string, find all possible palindromic substrings in it.

Coding made easy

Given a string, find all possible palindromic substrings in it.

Given two strings, determine if they are isomorphic. Two strings X and Y are called isomorphic if all occurrences of each character in X can be replaced with another character to get Y and vice-versa.

Find all interleavings of given strings that can be formed from all the characters of first and second string where order of characters is preserved.

Given a binary pattern that contains ‘?’ wildcard character at few positions, find all possible combinations of binary strings that can be formed by replacing the wildcard character by either 0 or 1.

Given two strings, determine if they are anagrams or not. Any word that exactly reproduces the letters in another order is an anagramap. In other words, X and Y are anagrams if by rearranging the letters of X, we can get Y using all the original letters of X exactly once.

Given a positive number, convert the number into corresponding excel column name.

Check if given string can be derived from another string by circularly rotating it. The rotation can be in clockwise or anti-clockwise rotation.

Given a string, check if repeated subsequence is present in the string or not. The repeated “subsequence” (not “substring”) should have length of 2 or more.

Given a string, find maximum-length contiguous substring of it that is also a palindrome. For example, the longest palindromic substring of “bananas” is “anana”.

Given a string, check if it is a rotated palindrome or not.

Check if given set of moves is circular or not. The move is circular if its starting and ending coordinates are the same. The moves can contain instructions to move one unit in same direction (M), to change direction to left of current direction (L) and to change direction to right of current direction (R).

Given a simple sentence and a set of syntax rules, validate if it is syntactically correct or not. A simple sentence if syntactically correct if it fulfills given rules. The following are given rules.

Given a string, reverse it iteratively.

Write code to efficiently evaluate given postfix expression.