Test Lead

You are given a string 'STR' of lowercase English alphabets. You need to find the repeated character present first in the string.

Example:

If the string is: “abccba”, then the first repeated character is ‘c’, but the repeated character that is present first in the string is ‘a’. You need to print ‘a’.

Note:

Keep in mind that you need to print the repeated character that is present first in the string and not the first repeating character.

Alice was recently studying subsequence. She discovered that it is possible to make an array of ‘N’ integers say ‘arr1’, a subsequence of another array of ‘M’ integers, say ‘arr2’, by inserting 0 or more integers into the array ‘arr2’. As she is busy with her studies, she asked you to find the minimum number of integers that need to be inserted into ‘arr2’ to make ‘arr1’ a subsequence of ‘arr2’.

Note :

1) ‘arr1’ consists of distinct positive integers, and ‘arr2’ can contain duplicates.
2) You are allowed to insert integers at any position in ‘arr2’. For example, if ‘arr2’  = {1, 2, 3}, you can insert 4 at 2nd position to make it {1, 4, 2, 3}.

You are given a string 'STR' of length 'N' consisting of lowercase English Alphabet letters. Your task is to return the count of minimum characters to be added to make the string a palindrome.

You can add any number of characters at any positions in the string like in the beginning, or between two characters of the string or at the end of the string.

For example:

For the given string “deed”, the string is already a palindrome, thus, minimum characters needed to be added are 0. 

Similarly, for the given string “abb”, the minimum characters needed is 1 i.e. ‘a’ which is to be added to the end of the string,  which makes the string “abba”, which is a palindrome.   

Introduction.

Questions about projects.

Discussion about salary.