### Right Least Max Problem

Replace the no by least max no of right side( if no then substitute -1)
Input:    43 3 91 95 25 32 80
Output:  80 25 95 -1 32 -1 -1

```int main(){
int a[] = {43,3,91,95,25,32,80};
int i,max,j,temp,k,count;
int n = sizeof(a)/sizeof(a[0]);

clrscr();
for(i=0; i<n; i++){
max = 0;
count=0;
for(j=i+1;j<n;j++){
count++;
if(a[i]<a[j]){
if(max==0)
max=a[j];
else if(max>a[j])
max = a[j];
}
}
if(max>a[i] && count>1)
a[i] = max;
else
a[i] = -1;
}

for(i=0;i<n;i++)
printf("%5d",a[i]);

getch();
}```

### C Questions

C Questions
C Questions

Note : All the programs are tested under Turbo C/C++ compilers.
It is assumed that,
Programs run under DOS environment, The underlying machine is an x86 system, Program is compiled using Turbo C/C++ compiler.
The program output may depend on the information based on this assumptions (for example sizeof(int) == 2 may be assumed).
Predict the output or error(s) for the following:

void main()
{
int const * p=5; printf("%d",++(*p));
}
Compiler error: Cannot modify a constant value.
Explanation:
p is a pointer to a "constant integer". But we tried to change the value of the "constant integer".
main()
{
char s[ ]="man"; int i;
for(i=0;s[ i ];i++)
printf("\n%c%c%c%c",s[ i ],*(s+i),*(i+s),i[s]);
}
aaaa nnnn
Explanation

### Zoho Interview | Set 1 (Advanced Programming Round)

Third Round: (Advanced Programming Round) Here they asked us to create a “Railway reservation system” and gave us 4 modules. The modules were:
1. Booking
2. Availability checking
3. Cancellation
4. Prepare chart
We were asked to create the modules for representing each data first and to continue with the implementation phase.

My Solution :