Given an array of words representing your dictionary, you test words to see if it can be made into another word in dictionary. T
his will be done by removing characters one at a time. Each word represents its own first element of its string chain, so start with a string chain length of 1. Each time you remove a character, increment your string chain by 1. In order to remove a character the resulting word must be in your original dictionary. Your goal is to determine the longest string chain available for a given dictionary. for example, given a dictionary [a, and, ab, bear] the word and could be reduced to an and the word an to a. The single character a can not be reduced to any further as the null string is not in the dictionary. This would be the longest string chain, having a length 3. The word bear can not be reduced at all.
1 answer:
You might be interested in
Answer:
(d) 2 pF
Explanation: the charge on capacitor is given by the expression
Q=CV
where Q=charge
C=capacitance
V=voltage across the plate of the capacitor
here we have given Q=500 pF, V=250 volt
using this formula C=
=500××
=2×
=2 pF