Seating Arrangement Problem HackerRank Solution
Problem Statement:
Akash and Vishal are quit.... facing you and the seat type, i.e. WS, MS or AS.
 |
| Seating Arrangement Problem |
Easy Solution Code in JAVA:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122 | import java.io.BufferedReader;
import java.io.InputStreamReader;
class TestClass2 {
public static void main(String args[] ) throws Exception {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(br.readLine());
if(t>=1 && t<=100000){
for(int y=0;y<t;y++){
int n;// seat number input taken by user;
n=Integer.parseInt(br.readLine());
if(n>=1 && n<=108){
String seatType=getTypeOfSeat(n);
int frontSeatNumber= getfrontFaceSeat(n);
System.out.println(frontSeatNumber +" "+ seatType );
}
}
}
}
public static int getfrontFaceSeat(int n){
//Front Facing find
//n will be between 1-12 or 13-24 or ..so on
int listNo;
if(n%12==0){
listNo=n/12;
}else{
listNo = (n/12) + 1;
}
int strt_of_list= (listNo-1)*(12) + 1;
int end_of_list= listNo* 12;
int frontSeat;
if((end_of_list-n) > (n-strt_of_list))
{
frontSeat = strt_of_list + (end_of_list-n);
return frontSeat;
}
else{
frontSeat=strt_of_list + end_of_list-n;
return frontSeat;
}
}
public static String getTypeOfSeat( int n)
{
//To find Type of Seat WS ,MS ,AS
String seat="";
//check for window Seat for n
int i=1,j=2,k=3;
//for i=1
if(n==1){
seat="WS";
return seat;
}
if(n==2){
seat="MS";
return seat;
}
if(n==3){
seat="AS";
return seat;
}
while((i<=108 || j<=108) || k<=108 )
{
{
//for window seat
i=i+5;
if(n==i){
//it is a wSeat;
seat="WS";
return seat;
}
else{
i=i+1;
if(n==i)
{
//it is a wSeat
seat="WS";
return seat;
}
}
} //done to check for windows seat
{
// for middle seat
//to check for middle seat
j=j+3;
if(n==j){
//it is a middle seat;
seat="MS";
return seat;
}
}//done to check for middle seat
// for aisle seat
k=k+1;
if(n==k)
{
//it is a aisle seat
seat="AS";
return seat;
}
else{
k=k+5;
if(n==k){
//it is a aisle seat
seat="AS";
return seat;
}
}
}
return seat;
}
}
|
Hello Everyone, on this website you will get programming tutorials and projects so please follow us on our social media and subscribe to your feed. For any query, doubts please comment below. You can also react to the post using emoji.
No comments:
Post a Comment