Daily Leetcode Challenge | JAN 14 | Java + Python | Find the Prefix Common Array of Two Arrays

[@darshankumar5546]

//java-MOST OPTIMAL // tc=O(n) // sc=O(n) class Solution { public int[] findThePrefixCommonArray(int[] A, int[] B) { int n=A.length; int commonEleCount=0; int[] ans=new int[n]; Set sett=new HashSet(n); for(int i=0;i

[@darshankumar5546]

Python documentaion for set: docs.python.org/2/library/sets.html

[@ollieorion369]

Great Video 😌 Sir

[@darshankumar5546]

Thanks 🙂

[@darshankumar5546]

#python3-MOST OPTIMAL # tc=O(n) # sc=O(n) class Solution: def findThePrefixCommonArray(self, A: List[int], B: List[int]) -> List[int]: ans=[] commonEleCount=0 n=len(A) sett=set() for i in range(n): if(A[i] in sett): commonEleCount+=1 else: sett.add(A[i]) if(B[i] in sett): commonEleCount+=1 else: sett.add(B[i]) ans.append(commonEleCount) return ans #i=0 commonEleCount=4 ans=[0,2,3,4] #set={1,3,2,4}

[@darshankumar5546]

# python - not optimal class Solution: def findThePrefixCommonArray(self, A: List[int], B: List[int]) -> List[int]: ans=[] n=len(A) setA=set() setB=set() for i in range(n): setA.add(A[i]) setB.add(B[i]) if(A[i]==B[i] and i>0): ans.append(ans[-1]+1) else: ans.append(len(setA&setB)) return ans