A Disk Defragmenter should be used
Answer:
ypite58eitetustietiejtejtejte6jhyeyry7ryjr
Answer:
Answer explained below
Explanation:
I have given two approaches in implementing the solution.
1. Using the for loop, in which you have to iterate over all the elements in list 1 and check in list 2
2. Use the set intersection method. As intersection will give u the common elements. And we can get there length by using len method.
I have added the code along with the snapshot and inline comment for the ease of you to understand. Please check the methods below. You can use either of them.
METHOD-1:
********** CODE *****************
def matches(tickets,winner):
tickets = set(tickets)
winner = set(winner)
counter = 0 #To Count the common elements
for i in tickets: # Iterate over all the elements in tickets.
if i in winner: # Check the element in the winner list
counter = counter+1
return counter
METHOD -2:
********** CODE ********************
def matches(tickets, winner):
tickets = set(tickets)
winner = set(winner)
return len(tickets.intersection(winner))
Whats the question if its true or false, then true
Explanation:
HTML is used to create web pages, documents.
hope this helps u
