Maximum XOR of Two Numbers in an Array | Leeetcode 421 | Live coding session 🔥🔥🔥 | O(n) Easy

preview_player
Показать описание
Here is the solution to "Valid Mountain Array" leetcode question. Hope you have a great time going through it.

1) 0:00 Explaining the problem out loud
2) 1:50 Understanding the Algorithm
3) 2:00 Approach
3) 12:00 Coding it up

👉 Solutions

Java 👉🏼

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series: 🔥🔥🔥

🔥🔥🔥 Leetcode Monthly Contest Playlist

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

Best solution on youtube... you explained it so simply.. very nicely explained

pavniujla
Автор

Can someone help me understand significance of keeping TrieNode root decleration private

sadashivshinde
Автор

Thanks for this nice explanation, just a doubt why u used >>> instead of >> ?

omnamahshivaya
Автор

How did it occur to you that Trie can be used here?

vartmaan
Автор

There's one another approach where we need to only iterate. I think it's TC is O(N) and SC as O(1) thus here we don't need any trie. Correct me If I'm wrong :|

adityapandey