You're given a list and a string. The list contains different words. Create a function, given the list and the string, that returns a list with booleans whether the words occur in the string or not. For example, the inputs (['trading', 'interview'], 'ncdtradingpmwinterkow') should return [True, False]. Try to write this function as short and efficient as possible.

# Implementing the check_word_occurrence function def check_word_occurrence(word_list: list, target_string: str) -> list: # Initialize an empty list to store the boolean results result = [] # Iterate through each word in the word_list for word in word_list: # Check if the word occurs in the target_string result.append(word in target_string) return result # Implementing the test function def test_check_word_occurrence(): assert check_word_occurrence(['trading', 'interview'], 'ncdtradingpmwinterkow') == [True, False] assert check_word_occurrence(['hello', 'world'], 'dcipehieqldn') == [False, False] assert check_word_occurrence(['origin', 'trail'], 'nbwtrailncjworiginkwnsj') == [True, True] print("All tests passed!") # Run the test function test_check_word_occurrence()

Complete Training For Your Trading Interview

Interview Questions Programming Words in a String

Unlock

Sorry, you don't have access to this interview question. Sign up to practice with our wide range of interview questions or use the filters to find free examples!

Related Questions

Title	Category	Subcategory	Difficulty	Status
All Vowels	Programming	String Manipulation	Easy	Unlock
Common Prefix Algorithm	Programming	String Manipulation	Medium	Unlock
Consecutive Letters	Programming	String Manipulation	Medium	Unlock
Count Number of Homogenous Substrings	Programming	String Manipulation	Medium	Unlock
Group Anagrams	Programming	String Manipulation	Medium	Unlock
Palindrome Checker	Programming	String Manipulation	Medium	Unlock
Smallest String	Programming	String Manipulation	Easy	Unlock
Summing Up Strings #1	Programming	String Manipulation	Hard	Unlock
Summing Up Strings #2	Programming	String Manipulation	Hard	Unlock
Word Frequency	Programming	String Manipulation	Easy	Unlock

Discussion

Please log in to see the discussion.

Back to all Questions

The Interview Guide for Quants and Traders

Words in a String

What do you think of this page?