Hello **Programmers/Coders,** Today we are going to share ** solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for **Fighting Pits** **in Java-HackerRank Problem**. We are providing the **correct and tested solutions** of coding problems present on **HackerRank**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**Introduction To Algorithm**

The word **Algorithm** means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.

**Advantages of Algorithms:**

- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.

** Link for the Problem** – Fighting Pits – Hacker Rank Solution

Fighting Pits – Hacker Rank Solution

**Problem:**

Meereen is famous for its fighting pits where fighters fight each other to the death.

Initially, there are fighters and each fighter has a strength value. The fighters are divided into teams, and each fighter belongs exactly one team. For each fight, the Great Masters of Meereen choose two teams, and , that must fight each other to the death. The teams attack each other in alternating turns, with team always launching the first attack. The fight ends when all the fighters on one of the teams are dead.

Assume each team always attacks optimally. Each attack is performed as follows:

- The attacking team chooses a fighter from their team with strength .
- The chosen fighter chooses
*at most*fighters from other team and kills all of them.

The Great Masters don’t want to see their favorite fighters fall in battle, so they want to build their teams carefully and know who will win different team matchups. They want you to perform two type of queries:

`1 p x`

Add a new fighter with strength to team . It is guaranteed that this new fighter’s strength value will not be less than any current member of team .`2 x y`

Print the name of the team that would win a matchup between teams and in their current state (recall that team always starts first). It is guaranteed that .

Given the initial configuration of the teams and queries, perform each query so the Great Masters can plan the next fight.

**Note:** You are determining the team that *would* be the winner if the two teams fought. No fighters are actually dying in these matchups so, once added to a team, a fighter is available for all future potential matchups.

**Input Format**

The first line contains three space-separated integers describing the respective values of (the number of fighters), (the number of teams), and (the number of queries).

Each line of the subsequent lines contains two space-separated integers describing the respective values of fighter ‘s strength, , and team number, .

Each of the subsequent lines contains a space-separated query in one of the two formats defined in the *Problem Statement* above (i.e., `1 p x`

or `2 x y`

).

**Constraints**

- It is guaranteed that both teams in a query matchup will always have at least one fighter.

**Scoring**

This challange has binary scoring. This means you will get a full score if your solution passes all test cases; otherwise, you will get points.

**Output Format**

After each type query, print the name of the winning team on a new line. For example, if and are matched up and wins, you would print .

**Sample Input**

7 2 6 1 1 2 1 1 1 1 2 1 2 1 2 2 2 2 1 2 2 2 1 1 2 1 1 2 1 2 1 2 2 2 1

**Sample Output**

1 2 1 1

**Explanation**

Fighting Pits– Hacker Rank Solution

import java.io.*; import java.util.*; import java.util.stream.Collectors; public class Solution { static class Team { int sum = 0; final List<Integer> p = new ArrayList<>(); void add(int power) { p.add(power); sum += power; } int member(int i) { return p.get(i); } int members() { return p.size(); } void opt() { p.sort(Integer::compareTo); } } /* * Complete the fightingPits function below. */ static void fightingPits(int k, List<List<Integer>> teams, int[][] queries, BufferedWriter writer) throws IOException { List<List<Integer>> powers = teams.stream().map( t -> { t.sort(Integer::compareTo); List<Integer> res = new ArrayList<>(); int acc = 0; for (int p : t) { acc += p; res.add(acc); } return res; } ).collect(Collectors.toList()); for (int[] q : queries) { if (q[0] == 1) { int tI = q[2] - 1; List<Integer> p = powers.get(tI); if (p.isEmpty()) { p.add(q[1]); } else { p.add(p.get(p.size() - 1) + q[1]); } } else { int xI = q[1] - 1, yI = q[2] - 1; final List<Integer> x = powers.get(xI); final List<Integer> y = powers.get(yI); int xJ = x.size() - 1, yJ = y.size() - 1; int winner; while (true) { if (x.get(xJ) >= y.get(yJ)) { winner = xI + 1; break; } yJ -= x.get(xJ) - (xJ < 1 ? 0 : x.get(xJ - 1)); if (yJ < 0) { winner = xI + 1; break; } if (x.get(xJ) <= y.get(yJ)) { winner = yI + 1; break; } xJ -= y.get(yJ) - (yJ < 1 ? 0 : y.get(yJ - 1)); if (xJ < 0) { winner = yI + 1; break; } } writer.write(String.valueOf(winner)); writer.newLine(); } } } public static void main(String[] args) throws IOException { BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out)); BufferedReader reader = new BufferedReader(new InputStreamReader( System.in // new FileInputStream("/home/malik/Загрузки/input04.txt") )); String[] nkq = reader.readLine().split(" "); int n = Integer.parseInt(nkq[0].trim()); int k = Integer.parseInt(nkq[1].trim()); int q = Integer.parseInt(nkq[2].trim()); List<List<Integer>> teams = new ArrayList<>(k); for (int i = 0; i < k; i++) teams.add(new LinkedList<>()); for (int fightersRowItr = 0; fightersRowItr < n; fightersRowItr++) { String[] fightersRowItems = reader.readLine().split(" "); teams.get(Integer.parseInt(fightersRowItems[1]) - 1).add(Integer.parseInt(fightersRowItems[0])); } int[][] queries = new int[q][3]; for (int queriesRowItr = 0; queriesRowItr < q; queriesRowItr++) { String[] queriesRowItems = reader.readLine().split(" "); for (int queriesColumnItr = 0; queriesColumnItr < 3; queriesColumnItr++) { int queriesItem = Integer.parseInt(queriesRowItems[queriesColumnItr].trim()); queries[queriesRowItr][queriesColumnItr] = queriesItem; } } fightingPits(k, teams, queries, writer); reader.close(); writer.close(); } }