Implement XOR of Two Numbers without Using XOR Operator

[Kamini8707]

Description:
I would like to add a new feature to the repository that implements the XOR operation for two numbers using only AND, OR, and NOT bitwise operators. This approach avoids the direct use of the XOR (^) operator and instead derives the XOR logic using fundamental bitwise operations.

Feature Details:
The XOR of two numbers can be computed using the formula:
XOR(A, B) = (A OR B) AND NOT (A AND B)
The program will take two integers as input and return the result of their XOR operation.
This addition will showcase how basic bitwise operations can be combined to replicate the behavior of more complex operators like XOR.

Example:
Input: 5, 3
Output: 6 (since 5 XOR 3 = 6)

Labels:
new algorithm, gssoc-ext, hacktoberfest, level2

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it

[Kamini8707]

Please assign me this issue