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.
functionbeautifulPairs(A:number[],B:number[]):number{letcounter:number=0;/* * Looping through the A array and finding if there are any matched in the, * if there are then we count up and remove the element from the B array to * prevent duplicates being counted again */A.forEach((num)=>{if(B.includes(num)){counter++;constindexToRemove:number=B.indexOf(num);B.splice(indexToRemove,1)}})returncounter===A.length?counter-1:counter+1;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Beautiful Pairs
You are viewing a single comment's thread. Return to all comments →
Here is my typescript solution: