Answer:
def words_in_both(a, b):
a1 = set(a.lower().split())
b1 = set(b.lower().split())
return a1.intersection(b1)
common_words = words_in_both("She is a jack of all trades", 'Jack was tallest of all')
print(common_words)
Explanation:
Output:
{'all', 'of', 'jack'}
Answer:
val > max
Explanation:
Assuming the values array is already created, inside the loop, we need to check if the val, a value in the values array, is greater than max. If it is greater than the max, that means it is our new max. Then we would set the max as the val. This way, if there is any value greater than max, it will be our max at the end of the loop.
Answer:
RecursiveCalls.backwardsAlphabet(startingLetter);
Explanation:
The statement that is needed is a single-line statement. Since the class RecursiveCalls is already in the same file we can simply use that class and call its function without making a new class object. Once we call that class' function we simply pass the variable startingLetter (which is already provided) as the sole parameter for the function in order for it to run and use the letter 'z' as the starting point.
RecursiveCalls.backwardsAlphabet(startingLetter);
Answer:
A. add level
D. Delete level
E. Copy level
F. Move up or down
Explanation:
I just did it on edg. 2020
