Given a sequence of integers as an array, determine whether it is possible to obtain a strictly increasing sequence by removing no more than one element from the array. Note: sequence a0, a1, ..., an is considered to be strictly increasing if a0 < a1 < ... < an. Sequences containing only one element are also considered to be strictly increasing. Example For sequence = [1, 3, 2, 1], the output should be solution(sequence) = false. There is no one element in this array that can be removed in order to get a strictly increasing sequence. For sequence = [1, 3, 2], the output should be solution(sequence) = true. You can remove 3 from the array to get the strictly increasing sequence [1, 2]. Alternatively, you can remove 2 to get the strictly increasing sequence [1, 3].

Q1. Given two strings, find the number of common characters between them. Example For s1 = "aabcc" and s2 = "adcaa", the output should be solution(s1, s2) = 3. Strings have 3 common characters - 2 "a"s and 1 "c".

Q3. Write a function that reverses characters in (possibly nested) parentheses in the input string. Input strings will always be well-formed with matching ()s. Example For inputString = "(bar)", the output should be solution(inputString) = "rab"; For inputString = "foo(bar)baz", the output should be solution(inputString) = "foorabbaz"; For inputString = "foo(bar)baz(blim)", the output should be solution(inputString) = "foorabbazmilb"; For inputString = "foo(bar(baz))blim", the output should be solution(inputString) = "foobazrabblim". Because "foo(bar(baz))blim" becomes "foo(barzab)blim" and then "foobazrabblim". Input/Output