TCS CodeVita Mock Test Coding Question 1
Coding Question 1
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
In this superhero epic, the denizens of the Marvel Universe are forced to pick sides when Captain America and Iron Man come to blows over ideological differences.
The government decides to push for the Hero Registration Act, a law that limits a hero’s actions. This results in a division in The Avengers. Iron Man stands with this Act, claiming that their actions must be kept in check otherwise cities will continue to be destroyed, but Captain America feels that saving the world is daring enough and that they cannot rely on the government to protect the world. And here the civil war begins.
They are trying make their team stronger by adding more avengers to their team. There are N avengers lined up.
Rules to add avenger to their team-
- Any team can start first. But they will alternatively only.
- They can select avenger from any side. But if they start from one side they can’t move to other side in current chance.
- They can select consecutive avengers as many they want.
- They will stop only when all the avengers are part of either side.
- Every Avenger has a power associated with him
- There are some spurious avengers who will decrease the overall power of the team.
Both teams will select players optimally. Find the difference of powers of the two teams
Constraints
1<= N <= 10^6
-10^9 <= p[i] <= 10^9
Input
First line contains an integer denoting the number of Avengers(N).
Next lines contain N space separated values denoting power of every avenger(P[i]).
Output
Print the difference of the powers of teams
– Time Limit (secs)
1
Examples :
Input
5
2-78-1 20
Output
2
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector powers(N);
for (int i = 0; i < N; i++) { cin >> powers[i];
}
int teamAPower = 0;
int teamBPower = 0;
sort(powers.begin(), powers.end(), [](int a, int b) {
return abs(a) > abs(b) || (abs(a) == abs(b) && a > b);
});
bool ironmanTurn = true;
for (int i = 0; i < N; i++) {
if (ironmanTurn) {
teamAPower += powers[i];
}
else {
teamBPower += powers[i];
}
ironmanTurn = !ironmanTurn;
}
int powerDifference = abs(teamAPower - teamBPower);
cout << powerDifference << endl;
return 0;
}
import java.util.*;public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
List powers = new ArrayList<>();
for (int i = 0; i < N; i++) {
powers.add(scanner.nextInt());
}
int teamAPower = 0;
int teamBPower = 0; // Sort the powers
Collections.sort(powers, new Comparator() {
@Override
public int compare(Integer a, Integer b) {
int absA = Math.abs(a);
int absB = Math.abs(b);
if (absA == absB) {
return Integer.compare(b, a); // Invert order if absolute values are equal
}
return Integer.compare(absB, absA);
}
});
boolean ironmanTurn = true;
for (int i = 0; i < N; i++) {
if (ironmanTurn) {
teamAPower += powers.get(i);
} else {
teamBPower += powers.get(i);
}
ironmanTurn = !ironmanTurn;
}
int powerDifference = Math.abs(teamAPower - teamBPower);
System.out.println(powerDifference);
}
}
N = int(input())
powers = list(map(int, input().split()))
team_a_power = 0
team_b_power = 0
# Sort the powers
powers.sort(key=lambda x: (abs(x), -x), reverse=True)
# Assign Avengers to teams alternatively
ironman_turn = True
for power in powers:
if ironman_turn:
team_a_power += power
else:
team_b_power += power
ironman_turn = not ironman_turn
power_difference = abs(team_a_power - team_b_power)
print(power_difference)
