Educational Codeforces Round 167 (Rated for Div. 2) D. Smithing Skill
884. Uncommon Words from Two Sentences
A sentence is a string of single-space separated words where each word consists only of lowercase letters.
A word is uncommon if it appears exactly once in one of the sentences, and does not appear in the other sentence.
Given two sentences
s1ands2, return a list of all the uncommon words. You may return the answer in any order.
3292. Minimum Number of Valid Strings to Form Target II
You are given an array of strings
wordsand a stringtarget.A string
xis called valid ifxis a prefix of any string inwords.Return the minimum number of valid strings that can be concatenated to form
target. If it is not possible to formtarget, return-1.A prefix of a string is a substring that starts from the beginning of the string and extends to any point within it.
3291. Minimum Number of Valid Strings to Form Target I
You are given an array of strings
wordsand a stringtarget.A string
xis called valid ifxis a prefix of any string inwords.Return the minimum number of valid strings that can be concatenated to form
target. If it is not possible to formtarget, return-1.A prefix of a string is a substring that starts from the beginning of the string and extends to any point within it.
3290. Maximum Multiplication Score
You are given an integer array
aof size 4 and another integer arraybof size at least 4.You need to choose 4 indices
i0,i1,i2, andi3from the arraybsuch thati0 < i1 < i2 < i3. Your score will be equal to the valuea[0] * b[i0] + a[1] * b[i1] + a[2] * b[i2] + a[3] * b[i3].Return the maximum score you can achieve.