Answer:
See explaination for the code
Explanation:
def wordsOfFrequency(words, freq):
d = {}
res = []
for i in range(len(words)):
if(words[i].lower() in d):
d[words[i].lower()] = d[words[i].lower()] + 1
else:
d[words[i].lower()] = 1
for word in words:
if d[word.lower()]==freq:
res.append(word)
return res
Note:
First a dictionary is created to keep the count of the lowercase form of each word.
Then, using another for loop, each word count is matched with the freq, if it matches, the word is appended to the result list res.
Finally the res list is appended.
Doubly linked chain
When a linked chain contains nodes that reference both the next node and the previous node, it is called a doubly linked chain. This type of chain is often used in data structures because it provides a way to easily traverse the data in both directions. However, because each node must reference both the next node and the previous node, doubly linked chains require more memory than singly linked chains.
Learn more here:
brainly.com/question/13100699
#SPJ4
Answer:
Hes really nice
TSUNAMI SUSHI HAS A TSUNAMI OF ADMIN ABUSE!! TSUNAMI SUSHI HAS A TSUNAMI OF ADMIN ABUSE!! TSUNAMI SUSHI HAS A TSUNAMI OF ADMIN ABUSE!! TSUNAMI SUSHI HAS A TSUNAMI OF ADMIN ABUS!Chicken wing
Chicken wing
Hot dog and baloney
Chicken and macaroni
Chillin with my homies
Chicken wings
Chicken wings