[Documentation Update]: Leetcode 421 solution[medium problem]

[tanyagupta01]

Is there an existing issue for this?

• I have searched the existing issues

Issue Description

Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.

Suggested Change

add a solution to leetcode problem number 421

Rationale

No response

Urgency

High

Acknowledgements

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository
• I have read and followed the Contribution Guidelines
• I have followed the code style guidelines of this project
• I have checked for any existing open issues that my pull request may address
• I have ensured that my changes do not break any existing functionality
• Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently
• I have read the resources for guidance listed below
• I have not used AI-generated content (e.g., ChatGPT, other AI tools)
• I have not used content from existing sites (e.g., text, images)
• I have followed all security rules and only shared trusted resources

[github-actions]

Hi @tanyagupta01! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[github-actions]

Hello @tanyagupta01! Your issue #1385 has been closed. Thank you for your contribution!