Any efficient way to do this?

#1

#include
using namespace std;

int main () {

int n,m,i,ans=0,res=0;
cin>>n>>m;
for(int i=n;i<=m;i++){
	for(int j=i+1;j<=m;j++){
		res = i^j;
		ans=max(ans,res);
	}
}

cout<<ans;
return 0;

}

#2

Hello @talhashamim001 you can solve this question in the optimised way using TRIE.
have you read that data structure?
there must be the video for that in your course.
if you have any doubt you can ask here:
Happy Learning!!

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.