We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
defbeautifulPairs(A,B):# Write your code herecount=0iflen(A)==1:returncountforiinA:ifiinB:count+=1B.remove(i)if(count<len(A)):returncount+1else:returnlen(A)-1
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Beautiful Pairs
You are viewing a single comment's thread. Return to all comments →
Solution of Beautiul Pairs