Thank you for your contribution. Interesting project!
- has this been on the chrome web store already?
- your first algorithm complexity is O(N^2), can you improve this Similar Sponsor by sorting your sponsors by start time - which takes O(NlogN) then do the check in O(N)? At least, you can improve the inner loop by
for (var j = i + 1instead ofj = 0. - You might use hash table or just set to remove the duplicates, such as ES6
[...new Set(Array)]see this
Your contribution has been evaluated according to Utopian policies and guidelines, as well as a predefined set of questions pertaining to the category.
To view those questions and the relevant answers related to your post, click here.
Need help? Chat with us on Discord.
Thanks for your suggestions, I'll look into adding those.
No, it's not on the chrome store yet, but it should be by the end of this week. (hopefully)
Thank you for your review, @justyy! Keep up the good work!