Add algorithm to find Two unique numbers using bit manipulation with docsets

[RamachandraBhardwaj]

Implement a function to find two unique numbers in a list where every other number appears twice. The function raises errors for empty lists and non-integer elements.

Describe your change:

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

[RamachandraBhardwaj]

hello @cclauss, hope you're doing good ! Could you please review my PR ? I've followed all conventions for my PR. Please merge this and any feedback if possible ? Thanks !

[RamachandraBhardwaj]

hi, @cclauss , can this be merged or is there any issue? please clarify. Thanks !