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.
Write code to efficiently evaluate given postfix expression.
Given an balanced expression that can contain opening and closing parenthesis, check if the expression contains any duplicate parenthesis or not.
Given an string containing opening and closing braces, check if it represents a balanced expression or not.
Write a program to determine if a given string is palindrome or not. A palindromic string is a string that remains the same when its characters are reversed.
Given a huge set of strings with duplicate strings present, find first k-maximum occurring words in it.
Given a huge set of strings with duplicate strings present, find the maximum occurring word in it. If two words have same count, return any one of them.