Maximum XOR of Two Numbers in an Array | using Trie Data Structure | DSA-One Course #100 🎉

Hey guys, In this video, We will be solving a problem known as the Maximum XOR of two numbers in an array. We'll be using the Trie Data Structure to optimize the solution.

🥳 Join our Telegram Community:

🚀 Follow me on:

💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!

Hashtags:
#anujbhaiya #dsaone

Ignore these tags:

maximum xor of two numbers in an array
anuj bhaiya java
trie data structure
dsp anuj bhaiya
java anuj bhaiya
maximum subset xor
anuj kumar sharma
array in dsa
complete java dsa course
concatenation of consecutive binary numbers
data structure
data structures and algorithms java
maximum xor
maximum xor of two numbers
python for data analysis
trie

[sujoyseal]

No BS, No 5 min introduction, No Faltu promotion . Straight to the point.

[sukhbirSinghMehra]

Bhaiya bhale hi views kam aarhe hai last videos mai aap kabhi bhi band mat kijiye ye DSA course ya Koi aur course...All the best to you

[unbelievable]

It really help us a lot than imagined.
Thank you for building such a informative course.
We will be waiting for your next course to start.
I hope you will start it sooner to provide us a lot more things to learn...

[TanishMahi-kh]

Thanks a ton, Anuj! This course helped me a lot to build a great knowledge base of fundamentals especially because I did not study computer science in college. This was a life saver for me to prep for interviews. Once again, Thank you Anuj Bhaiya 😊

[sumittanwar]

Starting today, was checking that course is completed or not!!
just one word thanks <3

[sahilhansofficial]

Congratulations for 100 videos to all🥳🥳🥳
OP bhaiya🥰🤗

[ashutoshkumar]

bhai aag lgadi aag lgadi, patienly waiting for the next one ....

[shubhasaha]

Hi, Anuj Bhaiya this is Shubha 🙂 First of all Thanks a lot for making this wonderful course ❤ so I started learning 2 month it's been and now today at 17 Sept 3.00am I finished this video lecture TBH from this course I gained so much knowledge One thing you know I completed my B.tech in 2021 from Mechanical Engineering currently I'm working at Infosys. ... and I decided to go at Amazon it's my dream and I will do it. Thank you so much bhaiya again in these 2 month I learned so many things .... So, another one is I took a subscription at GFG self paced course so tomorrow onwards I will start for making a good coding skill further .... Again Thank you Bhaiya ❤ Love you bhaiya❤‍🩹❤‍🩹

[AjitSingh-rgzu]

I watched all videos and all the videos are very good for understanding of concepts and selection of questions is very good. Thanks a lot sir

[preetkatiyar]

Big fan bhaiya from your old apni kaksha channel to your golden Anuj Bhaiya new Channel from Day 0 to Day 100 this journey is very awesome and memorable for me
You started this dsa course when no any course on dsa with java is available . THIS COURSE IS PRECIOUS FOR ME AND IT HELPS ME LOTS AND LOTS.
THANKS ANUJ BHAI. And congratulations to you..

[Anonymous-ijcw]

please make topic wise playlist of your dsa course it will be very helpful

[abhishridwivedi]

Thank you bhaiya for this generous and selfless deed of yours. This course has helped me a lot and I want to stay consistent till I make it big. Can you please suggest what should I take up next after finishing this course? Thanks one again🙂.

[adityasarkar]

Hey anuj bhaiya could you please let me by completing these 100 videos playlist is these enough for our placement means all topics are covered or not.

[EkAurEngineer]

Thank you bheya for all your efforts and for completing the dsa playlist . I was start learnig java and dsa from you when you are educator in apnikaksaha and i am finished my dsa here . I t is a great experience and pleasure ton learn things from you . I hope i can meet you personally and thank you personally . Wish me a luck for upcoming placement season . Thank you ❤❤❤

[chandrakant]

Thanks bhaiya for such a great playlist

[chaudharysandeep]

Hello bhaiya.
Is this your cource is enough for product base placement point of view.

[Rajeshkumar-hshi]

Can we use 0, 1 knapsack algo to solve this problem ?

[LaveshGarg]

Amazing bhaiya you are the bestest coding teacher on this planet

[abhishekanand]

Bhaiya, please make video on Segment tree .

[ujjwalkumar]

We can also sort the array and maximise the xor value of two adjacent elements in the sorted array.