AND xor OR

Problem Statement :

```Given an array  of  distinct elements. Let  and  be the smallest and the next smallest element in the interval  where .

.

where , are the bitwise operators ,  and  respectively.

Input Format

First line contains integer N.
Second line contains N integers, representing elements of the array A[] .

Output Format

Print the value of maximum possible value of Si.```

Solution :

```                            ```Solution in C :

In C ++ :

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;

int main() {

int n;
cin>>n;

int * arr;

arr =  new int[n];

for(int i=0;i<n;i++)cin>>arr[i];

stack<int> S;

int m = 0;

for(int i=0;i<n;i++)
{
while(true)
{
if(S.empty())
{
S.push(arr[i]);
break;
}

else if(S.top() < arr[i] )
{
m = max(m, S.top()^arr[i]);
S.push(arr[i]);
break;
}
else
{
S.pop();
}
}
}

stack<int> S2;

for(int i=n-1;i>=0;i--)
{
while(true)
{
if(S.empty())
{
S.push(arr[i]);
break;
}

else if(S.top() < arr[i] )
{
m = max(m, S.top()^arr[i]);
S.push(arr[i]);
break;
}
else
{
S.pop();
}
}
}

cout<<m<<endl;
return 0;
}

In Java :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++){
arr[i] = in.nextInt();
}

Stack<Integer> stack = new Stack<Integer>();
int result = 0;
for(int i = 0; i < n; i++){
while(true){
if(stack.isEmpty()){
break;
} else if(stack.peek() < arr[i]){
result = Math.max(result, stack.peek() ^ arr[i]);
break;
} else{
stack.pop();
}
}
}
stack = new Stack<Integer>();

for(int i = n - 1; i >= 0; i--){
while(true){
if(stack.isEmpty()){
break;
} else if(stack.peek() < arr[i]){
result = Math.max(result, stack.peek() ^ arr[i]);
break;
} else{
stack.pop();
}
}
}

System.out.println(result);
}
}

In C :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

long long int sol(int A, int B)
{
return (((A & B) ^ (A | B)) & (A ^ B));
}

long long int inter(long long int arr[], int n)
{
int i,j;
long long int min1 = 9999999999, min2 = 9999999999, max = -1;
for(i=0;i<n-1;i++)
{
if(sol(arr[i], arr[i+1]) > max)
max = sol(arr[i], arr[i+1]);
if(i+2 <= n-1)
if(arr[i+1] > arr[i] && arr[i+1] > arr[i+2] && sol(arr[i], arr[i+2]) > max)
max = sol(arr[i], arr[i+2]);

}
return max;

}

int main()
{
int n,i;
scanf("%d", &n);
long long int arr[n];
for(i=0;i<n;i++)
{
scanf("%lli", &arr[i]);
}
printf("%lli", inter(arr, n));
return 0;
}

In  Python3 :

n_elements = int(input())
data = list(map(int, input().split()))
assert len(data) == n_elements

res = 0
minima = [data[0]]
for i in range(1, n_elements):
d = data[i]
while len(minima):
x = minima.pop()
res = max(d ^ x, res)
if x < d:
minima.append(x)
break
minima.append(d)
print(res)```
```

Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of