init maximum_xor_of_two_numbers_in_an_array

Author: 0xmountaintop

README.md

@@ -69,11 +69,11 @@ cargo test
 0389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/find-the-difference.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/find-the-difference.py) <br>------</br> [Rust](./kamyu104/src/find_the_difference.rs) | _O(n)_ | _O(1)_ | Easy | |
 0393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/utf-8-validation.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/utf-8-validation.py) <br>------</br> [Rust](./kamyu104/src/utf_8_validation.rs) | _O(n)_ | _O(1)_ | Medium | |
 0401 | [Binary Watch](https://leetcode.com/problems/binary-watch/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/binary-watch.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/binary-watch.py) <br>------</br> [Rust](./kamyu104/src/binary_watch.rs) | _O(1)_ | _O(1)_ | Easy | |
+0411 | [~~Minimum Unique Word Abbreviation~~](https://leetcode.com/problems/minimum-unique-word-abbreviation/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/minimum-unique-word-abbreviation.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/minimum-unique-word-abbreviation.py) | _O(2^n)_ | _O(n)_ | Hard | 🔒 |
+0421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-xor-of-two-numbers-in-an-array.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-xor-of-two-numbers-in-an-array.py) <br>------</br> [Rust](./kamyu104/src/maximum_xor_of_two_numbers_in_an_array.rs) | _O(n)_ | _O(n)_ | Medium ||
 
 <!-- 
 
-0411 | [Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/) | [C++](./C++/minimum-unique-word-abbreviation.cpp) [Python](./Python/minimum-unique-word-abbreviation.py) | _O(2^n)_ | _O(n)_ | Hard | 🔒 |
-0421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/) | [C++](./C++/maximum-xor-of-two-numbers-in-an-array.cpp) [Python](./Python/maximum-xor-of-two-numbers-in-an-array.py) | _O(n)_ | _O(n)_ | Medium ||
 0461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [C++](./C++/hamming-distance.cpp) [Python](./Python/hamming-distance.py) | _O(1)_ | _O(1)_ | Easy ||
 0462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | [C++](./C++/minimum-moves-to-equal-array-elements-ii.cpp) [Python](./Python/minimum-moves-to-equal-array-elements-ii.py) | _O(n)_  on average | _O(1)_ | Medium ||
 0477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/) | [C++](./C++/total-hamming-distance.cpp) [Python](./Python/total-hamming-distance.py) | _O(n)_ | _O(1)_ | Medium ||

kamyu104/src/main.rs

@@ -2,6 +2,7 @@ mod binary_watch;
 mod bitwise_and_of_numbers_range;
 mod find_the_difference;
 mod maximum_product_of_word_lengths;
+mod maximum_xor_of_two_numbers_in_an_array;
 mod missing_number;
 mod number_of_1_bits;
 mod power_of_four;

kamyu104/src/maximum_xor_of_two_numbers_in_an_array.rs

@@ -0,0 +1 @@
+