New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

performance: Smallest Range Covering Elements from K Lists #6

Open

saurabhmehta1601 opened this issue May 29, 2023 · 0 comments · May be fixed by #7

saurabhmehta1601 commented May 29, 2023

The performance of code can be improved by removing unnecessary sorting which is redundant.

saurabhmehta1601 linked a pull request

that will close this issue

perf: remove redundant sorting function calls #7

Open

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment