Answer would be Option 2 -- O(n^2) because

// loops n times i.e. O(n)
return second.reduce((acc, current) =&gt; {
    // spread operator operation would be O(n) every time
    return firstSet.has(current) ? [...acc, current] : acc;
}, []);

Hence, overall time complexity would be O(n^2).

P.S. This is not the best way to find intersection and approach can be improved so please do not use this code anywhere. Code is written in a certain way to test logic.

For useful and amazing frontend and programming tutorials: https://bit.ly/devtools-yt

This feels empty

0 day

0 day

Study Guides

Top JavaScript Multiple Choice Questions (MCQ) with Answers | Frontend Interview Questions | Beginner Friendly

Top JavaScript Array Interview Questions | Problem Solving | Array Polyfills

Frontend Coding Challenges | JavaScript | ReactJS | DevKode DOM Challenge

Advanced JavaScript Interview Questions | Problem Solving | Frontend Interview Questions

Top JavaScript Promises Interview Questions | Problem Solving | Promise Polyfills

Video Tutorials

Contribution Opportunities

Grow with like-minded people,

Join the devtools.tech community

Stay in the know

Instagram

YouTube

Twitter