UofT-DSI | Algorithms and Data Structures - Assignment 1

[sehroz]

What changes are you trying to make? (e.g. Adding or removing code, refactoring existing code, adding reports)

Adding code to solve the missing numbers problem in the range [0, n].

What did you learn from the changes you have made?

I learned how to efficiently find missing numbers using sets and boolean arrays.

Was there another approach you were thinking about making? If so, what approach(es) were you thinking of?

Adding code to solve the missing numbers problem using a boolean array to track missing numbers in the range.

Were there any challenges? If so, what issue(s) did you face? How did you overcome it?

Understanding the edge cases like an empty list or no missing numbers.

How were these changes tested?

By running multiple test cases to validate the output.

A reference to a related issue in your repository (if applicable)

N/A

Checklist

• I can confirm that my changes are working as intended

[github-actions]

Hello, thank you for your contribution. If you are a participant, please close this pull request and open it in your own forked repository instead of here. Please read the instructions on your onboarding Assignment Submission Guide more carefully. If you are not a participant, please give us up to 72 hours to review your PR. Alternatively, you can reach out to us directly to expedite the review process.