CareerCup

Code Written in C

#include <stdio.h>

void print(int a[],int len){
  int i=0;
  for(;i<len;i++){
 printf("%d\t",a[i]);
  }
  puts("");
}

int main()
{
  int a[]={1,3,5,7,2,4,6,8};
  int len=(sizeof(a)/sizeof(int)),mid=len/2;
  int hit=1,dup=mid,i=0;
  while(hit<=mid){
   dup=mid++;
  while(dup!=hit){
  int temp=a[dup-1];
  a[dup-1]=a[dup];
  a[dup]=temp;
  dup--;
  }
  hit+=2;
  }
  print(a,len);
    return 0;
}

C code using recursion to print pascals triangle

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

int fact(int n){
int j=1,fact=1;
while(j<=n){
fact=fact*j;
j++;
}
return fact;
}

void draw_line(int i,int j){
printf("1 ");
for(;j<i;j++){
printf("%d ",fact(i)/(fact(i-j)*fact(j)));
}
puts("1");
}

void rec_pascal(int i,int n){
if(i==n)
return;
if(i==1){
printf("1\n");
}
draw_line(i,1);
rec_pascal(i+1,n);
}

int main()
{
int n=5;
rec_pascal(1,n);
    return 0;
}

C Code to solve the above problem is as follows

#include <stdio.h>
#include <ctype.h>

int main()
{
 char s[10000];
 char *p,*q;
 gets(s);
 p=s; q=s;
 int count=1;
 while(*p && *q){
if(*q==' '){
q++;
printf(" ");
p=q;
count++;
continue;
}
if(count%2==1){
if(!isupper(*q))
{*q=*q-32;
printf("%c",*q);}
q++;
}
else{
while(*q!=' ' && *q)
q++;
char *preserve=q;
q--;
while(q!=p){
printf("%c",*q);
q--;
}
printf("%c",*q);
q=preserve;
}
 }
    return 0;
}

Code written in C

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

int draw_line(int start,int limit,int flag){
int count=0,copy=start;
while(count<limit-1){
printf("%d*",++start);
count++;
}
printf("%d\n",++start);
if(flag==0)
return start;
else return copy;
}

int rev_print(int i,int n){
if(i<=1)
{
    printf("1");
    return 1;
}
else{
 draw_line(i-n,n,1);
 return rev_print(i-n,n-1);
}
}


int print(int i,int n){
if(i==1){
printf("1\n");
return 1;
}
else{
   int k=print(i-1,n);
   int ret=draw_line(k,i,0);
   if(i==n)
    rev_print(ret,n);
   return ret;
}
}

int main()
{
  int n=4;
 print(n,n);
    return 0;
}

The below code is written in java

int ar1[] = {1, 5, 5} ,
ar2[] = {3, 4, 5, 5, 10}, 
ar3[] = {5, 5, 10, 20}   ; 
int s1=ar1.length,s2=ar2.length,s3=ar3.length;
int i=0,j=0,k=0;
while(i<s1 && j<s2 && k<s3)
{
	if((ar1[i]==ar2[j])&&(ar2[j]==ar3[k]))
   {System.out.println(ar1[i]);i++;j++;k++;}
	else{
		if(ar1[i]<ar2[j])
			{i++;continue;}
		else if(ar1[i]>ar2[j])
			{j++;continue;}
		if(ar2[j]<ar3[k])
			{j++;continue;}
		else if(ar2[j]>ar3[k])
			{k++;continue;}
	}
}

public static void subsets(int a[],int sum){
HashMap<Integer, Integer>hm=new HashMap<Integer,Integer>();
for(Integer i:a)
if(hm.get(sum-i)==null)
hm.put(i,0);
else hm.put(i, sum-i);

System.out.println(hm);
}