Maximum XOR of two numbers in an array

DSC-Banasthali-Vidyapith / Code-Crossroad

This project contains the carefully compiled Data Structures & Algorithm questions asked by the companies that visit Banasthali Vidyapith on-campus.

MIT License

55 stars 78 forks source link

Open Vanshikagarg17 opened 2 years ago

Vanshikagarg17 commented 2 years ago

Problem Description : Given an integer array 'nums', return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.

Example : Input : nums = [3,10,5,25,2,8] Output : 28 Explanation : The maximum result is 5 XOR 25 = 28.

Ridhikalra commented 2 years ago

hey @Ananyaas, Can I work on this issue?

sksinghl498 commented 2 years ago

hey @Vanshikagarg17 I want to work on this issue. pls assign it to me.

swatigupta121 commented 2 years ago

Can you please assign this to me. I would like to work on it.