Find The Sum - Uncommon Alphabets - Uppercase Given two char arrays input1[] and input2[ ] which contains only upper case alphabets,
Step 1: Extract the alphabets which are present only in any one of the array.
(Uncommon alphabets)
Step 2: Get the ascii values of all the extracted alphabets.
Step 3: Calculate the sum of those ascii values, lets us call it as sum1 and calculate
single digit sum for sum1
ile keep adding the digits of sum1 until you arrive at a single digit.
Step 4: Return the single digit as output.
Note :
1. Array size ranges from 1 to 15.
2. All the array elements are upper case alphabets.
Example 1:
input1: ('A', 'B', 'C'}
input2: ('B', 'C')
output: 65 => 6 + 5 = 11
==> 1 + 1 = 2​

If you turn on the lock alpha button , what happens

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

The "instance" relationship shows that something is an object of a