Return a version of the given string, where for every star (*) in string the star and thr chars immediately to its left and right are gone. So "ab*cd" yields "ad" and "ad**cd" also yields "ad".
Given a string and dictionary of words, form a word by removing minimum number of characters. Characters can be removed in-order only.
Given 2 strings, a and b, return a string of the form shorterString+longerString+shorterString, with the shorter string on the outside and the longer string on the inside. The strings will not be the same length, but they may be empty (length 0). If input is "hi" and "hello", then output will be "hihellohi".
Write a c program that rotate elements of an array by the value of configured number "n". For example: Input array[ ] = { 2, 3, 5, 6, 8, 9} value of n = 2 Output array[] = { 5, 6, 8, 9, 2, 3} I am looking for efficient program.
Given a string and a non empty word string, return a string made of each char just before and just after every appearance the word in the string. Ignore cases where there is no char before or after the word, and a char may be included twice if it is between two words.
If inputs are abcXY123XYijk and XY output should be c123
Given two strings, append them together (known as "concatenation") and return the result. However, if the concatenation creates a double-char, then omit one of the chars. If the inputs are "Mark" and "Kate" then the output should be "markate". (The output should be in lowercase).
