added problem 2225

Author: SHA65536

problems/problem2225/find_players_with_zero_or_one_losses.go

@@ -0,0 +1,35 @@
+package problem2225
+
+import "sort"
+
+/*
+You are given an integer array matches where matches[i] = [winneri, loseri] indicates that the player winneri defeated player loseri in a match.
+Return a list answer of size 2 where:
+answer[0] is a list of all players that have not lost any matches.
+answer[1] is a list of all players that have lost exactly one match.
+The values in the two lists should be returned in increasing order.
+
+Note:
+You should only consider the players that have played at least one match.
+The testcases will be generated such that no two matches will have the same outcome.
+*/
+
+func findWinners(matches [][]int) [][]int {
+	var results = [][]int{{}, {}}
+	var losses = make(map[int]int)
+	for i := range matches {
+		win := losses[matches[i][0]]
+		losses[matches[i][0]] = win
+		losses[matches[i][1]]++
+	}
+	for k, v := range losses {
+		if v == 0 {
+			results[0] = append(results[0], k)
+		} else if v == 1 {
+			results[1] = append(results[1], k)
+		}
+	}
+	sort.Ints(results[0])
+	sort.Ints(results[1])
+	return results
+}

problems/problem2225/find_players_with_zero_or_one_losses_test.go

@@ -0,0 +1,38 @@
+package problem2225
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type Result struct {
+	Input    [][]int
+	Expected [][]int
+}
+
+var Results = []Result{
+	{[][]int{{1, 3}, {2, 3}, {3, 6}, {5, 6}, {5, 7}, {4, 5}, {4, 8}, {4, 9}, {10, 4}, {10, 9}},
+		[][]int{{1, 2, 10}, {4, 5, 7, 8}}},
+	{[][]int{{2, 3}, {1, 3}, {5, 4}, {6, 4}},
+		[][]int{{1, 2, 5, 6}, {}}},
+}
+
+func TestFindWinners(t *testing.T) {
+	assert := assert.New(t)
+
+	for _, res := range Results {
+		want := res.Expected
+		got := findWinners(res.Input)
+		assert.Equal(want, got, fmt.Sprintf("%+v", res))
+	}
+}
+
+func BenchmarkFindWinners(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, res := range Results {
+			findWinners(res.Input)
+		}
+	}
+}

readme.md

@@ -281,6 +281,7 @@ Each problem is in it's own directory, with test files. There are helper package
 | 2136 | [Earliest Possible Day of Full Bloom](https://leetcode.com/problems/earliest-possible-day-of-full-bloom) | [My Solution](./problems/problem2136) | ✅ |
 | 2148 | [Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements) | [My Solution](./problems/problem2148) | ✅ |
 | 2165 | [Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/) | [My Solution](./problems/problem2165) | ✅ |
+| 2225 | [Find Players With Zero or One Losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/) | [My Solution](./problems/problem2225) | ✅ |
 | 2259 | [Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result) | [My Solution](./problems/problem2259) | ✅ |
 | 2284 | [Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count) | [My Solution](./problems/problem2284) | ✅ |
 | 2413 | [Smallest Even Multiple](https://leetcode.com/problems/smallest-even-multiple) | [My Solution](./problems/problem2413) | ✅ |