Matching Leetcode 102 Answer Style #820

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

Merged

Ahmad-A0 merged 1 commit into neetcode-gh:main from Mark-777-0:main

Aug 15, 2022

Contributor

Mark-777-0 commented Aug 14, 2022

This code is cleaner and runs faster than the previous, it also matches the solution here https://github.com/neetcode-gh/leetcode/blob/main/python/102-Binary-Tree-Level-Order-Traversal.py

File(s) Modified: 1-Two-Sum.py, 2-Add-Two-Numbers.py, etc...
Language(s) Used: _python
Submission URL: https://leetcode.com/submissions/detail/mysubmission/


          Matching Other Questions

55bef9b

This runs faster as well

Collaborator

Ahmad-A0 commented Aug 15, 2022

Thanks, @Mark-777-0!

Ahmad-A0 merged commit 89f92c9 into neetcode-gh:main

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

Labels

None yet