Service lane - HackerRank.

-


NOTE: If you are copying my code then its an advice to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of the source code.
Calvin is driving his favorite vehicle on the 101 freeway. He notices that the check engine light of his vehicle is on, and he wants to service it immediately to avoid any risks. Luckily, a service lane runs parallel to the highway. The service lane varies in width along its length.
Paradise Highway
You will be given an array of widths at points along the road (indices), then a list of the indices of entry and exit points. Considering each entry and exit point pair, calculate the maximum size vehicle that can travel that segment of the service lane safely.
For example, there are  measurements yielding . If our entry index,  and our exit, , there are two segment widths of  and  respectively. The widest vehicle that can fit through both is . If  and , our widths are  which limits vehicle width to .
Function Description
Complete the serviceLane function in the editor below. It should return an array of integers representing the maximum width vehicle that can pass through each segment of the highway described.
serviceLane has the following parameter(s):
  • n: an integer denoting the size of the  array
  • cases: a two dimensional array of integers where each element is an array of two integers representing starting and ending indices for a segment to consider .
Input Format
The first line of input contains two integers,  and , where  denotes the number of width measurements you will receive and  the number of test cases. The next line has  space-separated integers which represent the array .
The next  lines contain two integers,  and , where  is the start index and  is the end index of the segment being considered.
Constraints
Output Format
For each test case, print the number that represents the largest vehicle type that can pass through the entire segment of the service lane between indexes  and  inclusive.
Sample Input
8 5
2 3 1 2 3 2 3 3
0 3
4 6
6 7
3 5
0 7
Sample Output
1
2
3
2
1

Explanation
Below is the representation of the lane:
   |HIGHWAY|Lane|    ->    Width

0: |       |--|            2
1: |       |---|           3
2: |       |-|             1
3: |       |--|            2
4: |       |---|           3
5: |       |--|            2
6: |       |---|           3
7: |       |---|           3
  1. : From index  through  we have widths  and . Nothing wider than  can pass all segments.
  2. : From index  through  we have widht  and . Nothing wider than  can pass all segments.
  3. :  .
  4. : 
  5. : .


SOURCE CODE




import java.io.*;

import java.util.*;

public class Solution
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int t=sc.nextInt();
int width[]=new int[n];
int ans[]=new int[t];

for(int i=0;i<n;i++)
{
width[i]=sc.nextInt();
}
int cases[][]=new int[t][2];
for(int i=0;i<t;i++)
{
for(int j=0;j<2;j++)
{
cases[i][j]=sc.nextInt();
}
}
for(int i=0;i<t;i++)
{
int start=cases[i][0];
int exit=cases[i][1];
int min=width[start];
for(int k=start;k<=exit;k++)
{
if(width[k]<min)
{
min=width[k];
}
}
ans[i]=min;
}

for(int i=0;i<t;i++)
{
System.out.println(ans[i]);
}
}
}



Click here to Download



OUTPUT








If you have any question then leave a comment below I will do my best to answer that question.

Comments

Post a Comment

Popular posts from this blog

[Question 3] ISC 2017 Computer Practical Paper Solved – Caesar Cipher.

-
Image
Question 3: Caesar Cipher  is an encryption technique which is implemented as ROT13 (‘rotate by 13 places’). It is a simple letter substitution cipher that replaces a letter with the letter 13 places after it in the alphabets, with the other characters remaining unchanged. Write a program to accept a plain text of length L, where L must be greater than 3 and less than 100. Encrypt the text if valid as per the Caesar Cipher. Test your program with the sample data and some random data: Example 1 INPUT :  Hello! How are you? OUTPUT :  The cipher text is: Uryyb? Ubj ner lbh? Example 2 INPUT :  Encryption helps to secure data. OUTPUT :  The cipher text is: Rapelcgvba urycf gb frpher qngn. Example 3 INPUT :  You OUTPUT :  INVALID LENGTH SOURCE CODE    import java.io.*; import java.util.*; public class ISC2017_CaesarCipher {     public static void main(String args[])     {         Scanner sc=new Scanner(System.in);         System.out.pri
Read more

Pattern of your own name.

-
Image
Pattern program of your own name. This is a pattern program, in this program you just have to enter your name and it will give you output in a particular manner. I have created this program when I was in class 10th for my Computer Application project. NOTE:  If you are copying my code then its a advise to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of source code. SOURCE CODE import java.io.*; public class Patter_of_your_Own_Name { public static void main(String args[])throws IOException { int time=1; BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); do { System.out.print("\n\t\t\tPLEASE,ENTER YOUR GOOD NAME IN CAPITAL LETTER           :"); String str=br.readLine(); int flag=0;
Read more

Designing Patterns - Print 'Z'.

-
Image
SOURCE CODE import java.io.*; import java.util.*; public class Z {     public static void main(String args[])     {         Scanner sc=new Scanner (System.in);         System.out.print("Enter a odd number >=5 :");         int n=sc.nextInt();         int a=n/2+1;         System.out.println("\n");         if(n>=5&& n%2!=0 )                     {             for(int i=1;i<=n;i++)             {                 for(int j=n;j>0;j--)                 {                     if(i==1||i==n||j==i)                         System.out.print("Z ");                     else                         System.out.print("  ");                 }                 System.out.println();             }         }         else         System.out.println("Invalid Input.");     } } OUTPUT If you have any question then leave a comment below I will do my best to answer that question.
Read more