## Find the correct order of alphabets in a given dictionary of ancient origin

Given a dictionary of ancient origin where the words are arranged alphabetically, find the correct order of alphabets in the ancient language.

Coding made easy

Given a dictionary of ancient origin where the words are arranged alphabetically, find the correct order of alphabets in the ancient language.

Find all N-digit numbers with equal sum of digits at even and odd index. N varies from [1 to 9].

Given a string, find first non-repeating character in it by doing only one traversal of it.

Given a string, in-place remove all adjacent duplicates from it. The algorithm should continue removing adjacent duplicates from the string till no duplicate is present in the result.

Given an expression consisting of opening brace ‘{‘ and a closing brace ‘}’, find the minimum number of inversions needed to make the expression balanced.

Given a C-style string and a pattern, in-place replace all non-overlapping occurrences of the pattern in the string by a specified character.

Write a efficient algorithm to construct the longest palindrome by shuffling or deleting characters from a given string.

Given a string and a pattern (having all distinct characters), determine if characters of the string follows specific order as defined by characters of the pattern.

Given N lists of words, print all combinations of phrases that can be formed by picking one word each from each of the given lists.

Write an efficient algorithm to find the longest common prefix (LCP) between given set of strings.

Given two strings, determine if the first string can be transformed into the second string. The only operation allowed is to move any character from the first string to the front. If the string can be transformed, find the minimum number of operations required for the transformation.

Given a string consisting of opening and closing parenthesis, find the length of the longest balanced parenthesis in it.