Skip to content

Solved Array-1 problems #1903

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
Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Solved Array-1 problems #1903

wants to merge 1 commit into from

Conversation

aahiawasthee
Copy link

No description provided.

@super30admin
Copy link
Owner

  • Strengths: The student's solution demonstrates a clear understanding of the problem and provides an efficient solution with optimal time complexity. The code is well-commented and easy to follow.
  • Areas for Improvement: The space complexity could be improved by using the output array to store the left products and then computing the right products on the fly, updating the output array in place. This would reduce the space complexity to O(1) (excluding the output array).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@aahiawasthee @super30admin