Leetcode - Maximum XOR of Two Numbers in an Array (Python)

preview_player
Показать описание
September 2020 Leetcode Challenge
Leetcode - Maximum XOR of Two Numbers in an Array
Рекомендации по теме
Комментарии
Автор

I like how you flat out state you didn't come up with the solution. It makes u relateable.

CEOofTheHood
Автор

I think this is the way we actually solve. We don't just know a solution. Other videos are way too straight forward. This way we can know what possibilities can we can explore and not just have a single way in the mind.

Good work

sidharthpanda
Автор

Glad I found this solution compared to the Trie solution ( 6000 ms) which took 100's of hundred lines of code was a little bit complex to understand.

edwardteach
Автор

Doing this problem with a Trie first will make this clever solution more apparent.

atharm.
Автор

ughh, this problem is just bleaghhhh.good to know i wasn't the only one who took a peek at the solution too ^.^;

janmichaelaustria
Автор

Somehow my 2700ms brute force solution in JS was accepted lol

rtqld
Автор

Bitwise are the worst I always struggle to visualize the left shift and right shift part in these types of problems plus these are never asked in any Interviews round.

siddharthsingh
Автор

you explained it so well compared to the Geeksforgeeks videos on the same topic

andrewvirtual