Тёмный

Max XOR of 2 numbers in an array | Leetcode  

Techdose
Подписаться 177 тыс.
Просмотров 3,9 тыс.
50% 1

This video explains about finding the maximum XOR of 2 numbers in an array. We will learn the TRIE implementation to solve this problem which is one of the most intuitive approach.
-------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: +91 8918633037
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: +91 8918633037
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
🟢 TELEGRAM channel ( 𝐏𝐃𝐅 𝐨𝐟 𝐯𝐢𝐝𝐞𝐨): t.me/codewithTECHDOSE
🔵 LinkedIn: / surya-pratap-kahar-47b...
🔴INSTAGRAM: / surya.pratap.k
-------------------------------------------------------------------------------------------------------------------------
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

Опубликовано:

 

16 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 4   
@mohammadkaif8143
@mohammadkaif8143 11 месяцев назад
Too good, very well explained.
@anirudhrs7656
@anirudhrs7656 4 месяца назад
can we fix the max value and search for negation of max value in trie instead of searching the negation of each a value with max value. here traversal will reduce for to only traversing trie one time(32 bits) + o(n) for insertion
@xxRAP13Rxx
@xxRAP13Rxx Год назад
Thanks for the video!
@DebapriyaChandra
@DebapriyaChandra Год назад
Trie 🫥
Далее
Rank Transform of an Array | Leetcode 1331
9:05
Просмотров 2,3 тыс.
Maximum Swap | 4 techniques | Leetcode 670
19:05
Check If Array Pairs Are Divisible by k | Leetcode 1497
12:53
If Your Tech Job is Comfortable, You're in Danger
20:57
Tutorials for Beginners
Просмотров 237