TCS CodeVita Mock Test Coding Question 5
Coding Question 5
In this article, we will discuss about the TCS CodeVita Coding Question which is asked in the TCS placement test along with a detailed solution. This will help you excel your coding problems.
TCS CodeVita Coding Question
Problem Description
You are a caretaker of a waiting room and you have to take care of empty seats such that all the people should sit together. Imagine the seats are in a straight line like in a movie theatre. People are seated on random seats initially. Your task is to make them sit together so that minimum number of people change their position. Also, they can be made to sit together in many ways. Find the number of ways you can make them sit together by requiring only minimal people movement.
“E” depicts an empty seat and “O” depicts an occupied seat. Input will be given in the form of a string.
Example: OEOEO
As we can see, only seat number 1, 3, 5 are occupied and 2 and 4 are empty.
Case 1: If we move 5th person to 2nd position, they can all be together with only one person moving his/her place.
Case 2: If we movement 1st person to 4th position, they can all be together with only one person moving his/her place.
They can all be together with only one movement and this can be done in 2 ways. Print the minimum number of movements required and the number of ways this minimum movement can help achieve the objective.
Note: If they are already sitting together, Print “00” as output.
Constraints
0 <N <= 100000
Input
First line contains an integer N which depicts the number of seats
Second line contains N characters each of which are either “O” or “E”. “O” denotes an occupied seat and “E” denotes an empty seat.
Output
Print minimum number of movements required and the number of ways in which all people can be made to sit together without exceeding minimum number of movements by space
Time Limit (secs)
1
Examples
Input
5
OEOEO
Output
1 2
Explanation:
Given data of 5 seats in the queue,
Seat number 2 and 4 are unoccupied and all the other seats are occupied.
We can make them sit together by moving only one person near to the other. It can be done in 2 ways:
OOOEE (Moving 4 person to 2º position)
EE000 (Moving 1 person to 4 position)
#include < iostream>
#include < vector>
#include < algorithm>
using namespace std;
pair< int, int> min_moves_together(string seats) {
int occupied = count(seats.begin(), seats.end(), 'O');
if (occupied == 0 || occupied == seats.length()) {
return make_pair(0, 0);
}
vector< int> empty_counts;
int current_available = 0;
for (char seat : seats) {
if (seat == 'E') {
current_available += 1;
} else {
if (current_available > 0) {
empty_counts.push_back(current_available);
}
current_available = 0;
}
}
int min_empty_seats = *min_element(empty_counts.begin(), empty_counts.end());
int min_moves = min_empty_seats - 1;
int ways = count(empty_counts.begin(), empty_counts.end(), min_empty_seats);
return make_pair(min_moves * occupied +1, ways);
}
int main() {
int N;
cin >> N;
string seats;
cin >> seats;
pair result = min_moves_together(seats);
cout << result.first << " " << result.second << endl;
return 0;
} import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
String seats = scanner.next();
int[] result = minMovesTogether(seats);
System.out.println(result[0] + " " + result[1]);
}
public static int[] minMovesTogether(String seats) {
int occupied = 0;
for (char seat : seats.toCharArray()) {
if (seat == 'O') {
occupied++;
}
}
if (occupied == 0 || occupied == seats.length()) {
return new int[]{0, 0};
}
int[] emptyCounts = new int[seats.length()];
int currentAvailable = 0;
int index = 0;
for (char seat : seats.toCharArray()) {
if (seat == 'E') {
currentAvailable++;
} else {
if (currentAvailable > 0) {
emptyCounts[index++] = currentAvailable;
}
currentAvailable = 0;
}
}
int minEmptySeats = Integer.MAX_VALUE;
for (int i = 0; i < index; i++) {
minEmptySeats = Math.min(minEmptySeats, emptyCounts[i]);
}
int minMoves = minEmptySeats - 1;
int ways = 0;
for (int i = 0; i < index; i++) {
if (emptyCounts[i] == minEmptySeats) {
ways++;
}
}
return new int[]{minMoves * occupied+1, ways};
}
}def min_moves_together(seats):
occupied = seats.count("O")
if occupied == 0 or occupied == len(seats):
return 0, 0
empty_counts = []
current_available = 0
for seat in seats:
if seat == "E":
current_available += 1
else:
if current_available > 0:
empty_counts.append(current_available)
current_available = 0
min_empty_seats = min(empty_counts)
min_moves = min_empty_seats - 1
ways = empty_counts.count(min_empty_seats)
return min_moves * occupied +1, ways
N = int(input())
seats = input().strip()
min_moves, ways = min_moves_together(seats)
print(min_moves, ways)
Login/Signup to comment