Determine whether two strings are anagram or not
Given two strings, determine if they are anagrams or not. Two strings 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.
Category: String
Convert a number into a corresponding excel column name
Given a positive number, convert the number to the corresponding Excel column name.
Check if strings can be derived from each other by circularly rotating them
Check if a given string can be derived from another string by circularly rotating it. The rotation can be in a clockwise or anti-clockwise rotation.
Check if a repeated subsequence is present in a string or not
Given a string, check if a repeated subsequence is present in it or not. The repeated subsequence should have a length of 2 or more.
Longest Palindromic Substring Problem
Given a string, find the maximum length contiguous substring of it that is also a palindrome.
Check if a string is a rotated palindrome or not
Given a string, check if it is a rotated palindrome or not. For example, CBAABCD is a rotated palindrome as it is a rotation of palindrome ABCDCBA.
Check if a set of moves is circular or not
Check if a given set of moves is circular or not. A move is circular if its starting and ending coordinates are the same. The moves can contain instructions to move one unit in the same direction (M), to change direction to the left of current direction (L), and to change direction to the right of current direction (R).
Check if a sentence is syntactically correct or not
Given a simple sentence and a set of syntax rules, validate if it is syntactically correct or not.
Recursive program to print reverse of a string
Given a string, print it backwards using recursion.
Remove all extra spaces from a string
Write a program to in-place remove all extra spaces from a string. There maybe leading spaces, trailing spaces, or consecutive spaces between words of the string.
Find all occurrences of the given string in a character matrix
Given an M × N matrix of characters, find all occurrences of a given string in the matrix. We are allowed to search the string in all eight possible directions. Note that there should not be any cycles in the output path.
Evaluate a postfix expression
Write code to evaluate a given postfix expression efficiently. For example, 82/ will evaluate to 4 (8/2), 138×+ will evaluate to 25 (1+8×3) and 545×+5/ will evaluate to 5 ((5+4×5)/5).