Home
  • More

    More My Portfolio

Array Related Problems

“Everyone should learn how to code, It teaches you how to think.” ― Steve Jobs

Problem #1
  • Problem Statement
  • Solution


#include<stdio.h>

int main(){
    int n,arr[1000],i;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&arr[i]);
    }
    for(i=n-1;i>=0;i--){
        printf("%d ",arr[i]);
    }
    return 0;
}
	
Problem #2
  • Problem Statement
  • Solution

#include<stdio.h>

int main(){
    	int n,arr[1000],i,sum=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
		sum+=arr[i];
	}
	printf("%d",sum);
}
	
Problem #3
  • Problem Statement
  • Solution

#include<stdio.h>

int main(){
    int n,arr[1000],i,sum=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
		if(arr[i]%2==0){
			sum+=arr[i];
		}
	}
	printf("%d",sum);
}
Problem #4
  • Problem Statement
  • Solution

#include<stdio.h>

int main(){
    int n,arr[1000],i,sum=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
		if(i%2==0){
			sum+=arr[i];
		}
	}
	printf("%d",sum);
}
Problem #5
  • Problem Statement
  • Solution

#include<stdio.h>

int main(){
   int n,arr[1000],i,sum=0,temp,j;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
	}
	for( j=0,i=n-1;j<n/2;j++,i--){
		temp=arr[i];
		arr[i]=arr[j];
		arr[j]=temp;
	}
	for(i=0;i<n;i++){
		printf("%d ",arr[i]);
	} 
}
Problem #6
  • Problem Statement
  • Solution

#include<stdio.h>

int main(){
    int arr[1000],i,j,n;
    int max_index=0,max;
    int min_index=0,min;
    scanf("%d",&n);
    
    for(i=0;i<n;i++)
        scanf("%d",&arr[i]);
     
     max=min=arr[0];   
    for(i=0;i<n;i++){
        if(arr[i]>max){
            max=arr[i];
            max_index=i;
        }
        if(arr[i]<min){
            min=arr[i];
            min_index=i;
        }
    }
    printf("Max: %d, index: %d\n",max,max_index);
    printf("Min: %d, index: %d",min,min_index);
}
Problem #7
  • Problem Statement
  • Solution


#include<stdio.h>

int main()
{
	char ara[1000];
	int n,i,c=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf(" %c",&ara[i]);
        if(ara[i]=='a' || ara[i]=='A' || ara[i]=='e' || ara[i]=='E' ||ara[i]=='i' || ara[i]=='I' ||ara[i]=='o'|| ara[i]=='O'|| ara[i]=='u'|| ara[i]=='U'){
           c++;
        }
	}
	printf("Count:%d",c);
}
Problem #8
  • Problem Statement
  • Solution


#include<stdio.h>

int main(){
    int n,arr[1000],i,check,check1[100];
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
	}
	scanf("%d",&check);
	int j=0;
	for(i=0;i<n;i++){
		if(arr[i]==check){
			check1[j]=i;
			j++;
		}
	}
	
	if(i!=n-1){
		printf("FOUND at index position:");
		for(i=0;i<j;i++){
			if(i==0){
				printf("%d",check1[i]);
			}
			else
			printf(", %d",check1[i]);
		}
	}
	else{
		printf("\nNOT FOUND");
	}
}
Problem #9
  • Problem Statement
  • Solution


#include<stdio.h>

int main(){
    int n,arr[1000],i,sum=0,max;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
	}
	int rev_arr[1000],j;
	for(j=n-1,i=0;j>=0;i++,j--){
		rev_arr[i]=arr[j];
	}
	printf("Array A:");
	for(i=0;i<n;i++){
		printf("%d ",arr[i]);
	}
	printf("\nArray B:");
	for(i=0;i<n;i++){
		printf("%d ",rev_arr[i]);
	}
}

Problem #10
  • Problem Statement
  • Solution


#include<stdio.h>

int main(){
    int i,n1,n2,arr1[10000]={0},arr2[1000]={0},temp[1000]={0};
    scanf("%d",&n1);
    for(i=0;i<n1;i++)
        scanf("%d",&arr1[i]);
        
    scanf("%d",&n2);
    
    for(i=0;i<n2;i++)
        scanf("%d",&arr2[i]);
    
    if(n1 > n2){
        for(i=0;i<n1;i++)
        {
            temp[i]=arr1[i];
            arr1[i]=0;
        }
        for(i=0;i<n2;i++){
            arr1[i]=arr2[i];
            arr2[i]=0;
        }
        for(i=0;i<n1;i++){
            arr2[i]=temp[i];
            temp[i]=0;
        }
    }
    else if(n1 < n2){
        for(i=0;i<n2;i++)
        {
            temp[i]=arr2[i];
            arr2[i]=0;
        }
        for(i=0;i<n1;i++){
            arr2[i]=arr1[i];
            arr1[i]=0;
        }
        for(i=0;i<n2;i++){
            arr1[i]=temp[i];
            temp[i]=0;
        }
    }
    printf("Array A:");
    for(i=0;i<n2;i++)
        printf("%d ",arr1[i]);

    printf("\nArray B:");
    for(i=0;i<n1;i++)
        printf("%d ",arr2[i]);
}

Problem #11
  • Problem Statement
  • Solution


#include<stdio.h>

int main(){
	int n,arr[1000],i;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
	}
	for(i=0;i<n;i++){
	    if(arr[i]%3==0){
	        arr[i]=-1;
        }
    }
    for(i=0;i<n;i++)
        printf("%d ",arr[i]);
    
}

Problem #12
  • Problem Statement
  • Solution


#include<stdio.h>

int main(){
	int n,arr[1000],i,j,temp;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&arr[i]);
	}
	for(i=0;i<n;i++){
	    for( j=0;j<n-1;j++){
	        if(arr[j]>arr[j+1]){
	            temp=arr[j+1];
	            arr[j+1]=arr[j];
	            arr[j]=temp;
            }
        }
    }
    for(i=0;i<n;i++)
        printf("%d ",arr[i]);   
}

Special fun
  • Problem Statement
  • Solution


#include<stdio.h>

int main(){
    int n,arr[1000],i,temp,k=0,j;
    scanf("%d",&n);
    
    for(i=0;i<n;i++)
        scanf("%d",&arr[i]);
        
    for(i=0;i<n;i++){
	    for(k=i+1;k<n;k++){
	        if(arr[i]==arr[k]){
	          if(k==i+1){
	               for(j=i;j<n;j++){
	               arr[j]=arr[j+1];
                }
                i--;
              }
              else{
                   for(j=k;j<n;j++){
	               arr[j]=arr[j+1];
                }
              }
                n--;
            }
        }
    }
    for(i=0;i<n;i++)
        printf("%d ",arr[i]);
}

© , Designed & Coded by Robiuddin Robi. Using Now UI Kit Pro.

Have you tried once by yourself first?