---
title: "Discussion on \"LeetCode 421 Maximum XOR of Two Numbers in an Array(Med, Java, O(n))\" | Hashnode"
description: "Discussion on \"LeetCode 421 Maximum XOR of Two Numbers in an Array(Med, Java, O(n))\". Greedy Bit Construction with XOR Property Verification: Building Maximum XOR One Bit at a Time"
url: "https://hashnode.com/posts/leetcode-421-maximum-xor-of-two-numbers-in-an-arraymed-java-on/687370905a38ad603443da32"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [LeetCode 421 Maximum XOR of Two Numbers in an Array(Med, Java, O(n))](https://huanganni.hashnode.dev/leetcode-421-maximum-xor-of-two-numbers-in-an-arraymed-java-on?utm_source=hashnode&utm_medium=feed)

Greedy Bit Construction with XOR Property Verification: Building Maximum XOR One Bit at a Time

Jul 13, 2025 · 5 min read · huanganni.hashnode.dev  
Read the article

-   [#array](https://hashnode.com/tag/array)
-   [#hash-table](https://hashnode.com/tag/hash-table)
-   [#bit-manipulation](https://hashnode.com/tag/bit-manipulation)
-   [#trie](https://hashnode.com/tag/trie)
-   [#java](https://hashnode.com/tag/java)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#leetcode-medium](https://hashnode.com/tag/leetcode-medium)
-   [#faang](https://hashnode.com/tag/faang)
-   [#interview-preparations](https://hashnode.com/tag/interview-preparations)

## Written by

[Anni Huang](https://hashnode.com/@HuangAnni)

@HuangAnni · Singapore

  
[View profile](https://hashnode.com/@HuangAnni)

LLM Training Operation Specialist @ ByteDance | Ex-Master of IT in Business (AI track) at SMU

I’m Anni Huang, an AI researcher-in-training currently at ByteDance, specializing in LLM training operations with a coding focus. I bridge the gap between engineering execution and model performance, ensuring the quality, reliability, and timely delivery of large-scale training projects.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
