Skip to main content
Given an array of positive numbers. Print the numbers which have longest continuous range.
  Ex.  INPUT  :  

    Enter array size  :  8
    Enter arryay elements  :  1 3 10 7 9 2 4 6
    
    OUTPUT  :

    1 2 3 4

  Ex.  INPUT  :  

    Enter array size  :  8
    Enter arryay elements  :  1 3 9 7 8 2 4 6
    
    OUTPUT  :
    6 7 8 9

PROGRAM:

#include <stdio.h>

int main(void) {
// your code goes here
int a,b[100],count=0,n=0,i,j,l,min,max,k;
scanf("%d",&a);
for(i=0;i<a;i++)
{
    scanf("%d",&b[i]);
}
for(i=0;i<a;i++)
{
    min=b[i];
    max=b[i];
    count=0;
    for(j=0;j<a;j++)
    {
       for(k=0;k<a;k++)
       {
           if(b[k]==max+1)
           {
               max=b[k];
               count++;
               if(count>=n)
               {
                   n=count;
                   l=b[i];
               }
               break;
           }
       }
    }
}
for(i=0;i<=n;i++)
{
    printf("%d ",l);
    l++;
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

zoho taxi question (3rd Round)

Taxi application Design a Call taxi booking application -There are n number of taxi’s. For simplicity, assume 4. But it should work for any number of taxi’s. -The are 6 points(A,B,C,D,E,F) -All the points are in a straight line, and each point is 15kms away from the adjacent points. -It takes 60 mins to travel from one point to another -Each taxi charges Rs.100 minimum for the first 5 kilometers and Rs.10 for the subsequent kilometers. -For simplicity, time can be entered as absolute time. Eg: 9hrs, 15hrs etc. -All taxi’s are initially stationed at A. -When a customer books a Taxi, a free taxi at that point is allocated -If no free taxi is available at that point, a free taxi at the nearest point is allocated. -If two taxi’s are free at the same point, one with lower earning is allocated -Note that the taxi only charges the customer from the pickup point to the drop point. Not the distance it travels from an adjacent point to pickup the customer. -If no taxi is free a...
Post a Comment
..

Inser 0 after Consecutive (K times) Of 1 is Found

Example: Input: Number of bits: 12 Bits: 1 0 1 1 0 1 1 0 1 1 1 1 Consecutive K: 2 Output: 1 0 1 1 0 0 1 1 0 0 1 1 0 1 1 0 //JAVA CODE import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc= new Scanner(System. in ); int n = sc.nextInt(); int k=sc.nextInt(); int []a = new int [n]; int temp= 0 ; //Inputs for ( int i= 0 ;i<n;i++) a[i]=sc.nextInt(); //print for ( int i= 0 ;i<n;i++){ System. out .print(a[i]+ " " ); if (a[i]== 1 ){ temp++; if (temp==k) { System. out .print( "0 " ); temp= 0 ; } } else temp= 0 ; } } }
4 comments
..

QUESTION You’re given an even number n. If n=4, you have to print the following pattern : 4444 4334 4334 4444 If n=6, then the pattern should be like this : 666666 655556 654456 654456 655556 666666

// JAVA CODE import java.util.*; import java.lang.*; import java.io.*; class zohoquestion{     public static void main(String args[]) {         Scanner sc= new Scanner(System.in);         int n=sc.nextInt();int limit=0;         int s=n;         int a[][]= new int[n][n];         int l=0;int r=n-1;         while(limit<n){             for(int i=l;i<=r;i++){                 for(int j=l;j<=r;j++)                     if(i==l || i==r || j==l || j==r)                     a[i][j]=n;             }             l++;r--;n--;limit++;         }         for(int i=0;i<s;i++){ ...
4 comments
..