Add: Accounts Merge

Author: openset

problems/accounts-merge/accounts_merge.go

@@ -1 +1,45 @@
 package accounts_merge
+
+import "sort"
+
+func accountsMerge(accounts [][]string) [][]string {
+	n := len(accounts)
+	owner := make(map[string]string, n)
+	parent := make(map[string]string, n*2)
+	for _, a := range accounts {
+		for i := 1; i < len(a); i++ {
+			parent[a[i]] = a[i]
+			owner[a[i]] = a[0]
+		}
+	}
+	for _, a := range accounts {
+		r := root(a[1], parent)
+		for i := 2; i < len(a); i++ {
+			p := root(a[i], parent)
+			parent[p] = r
+		}
+	}
+	union := make(map[string][]string, n)
+	for email, p := range parent {
+		r := root(p, parent)
+		union[r] = append(union[r], email)
+	}
+	res := make([][]string, 0, len(union))
+	for p, emails := range union {
+		t := make([]string, len(emails)+1)
+		t[0] = owner[p]
+		if len(emails) > 1 {
+			sort.Strings(emails)
+		}
+		copy(t[1:], emails)
+		res = append(res, t)
+	}
+	return res
+}
+
+func root(e string, parent map[string]string) string {
+	if parent[e] == e {
+		return e
+	}
+	return root(parent[e], parent)
+}

problems/accounts-merge/accounts_merge_test.go

@@ -1 +1,34 @@
 package accounts_merge
+
+import (
+	"reflect"
+	"testing"
+)
+
+type caseType struct {
+	input    [][]string
+	expected [][]string
+}
+
+func TestAccountsMerge(t *testing.T) {
+	tests := [...]caseType{
+		{
+			input: [][]string{
+				{"John", "johnsmith@mail.com", "john00@mail.com"},
+				{"John", "johnnybravo@mail.com"},
+				{"John", "johnsmith@mail.com", "john_newyork@mail.com"},
+				{"Mary", "mary@mail.com"},
+			},
+			expected: [][]string{
+				{"John", "john00@mail.com", "john_newyork@mail.com", "johnsmith@mail.com"},
+				{"John", "johnnybravo@mail.com"}, {"Mary", "mary@mail.com"},
+			},
+		},
+	}
+	for _, tc := range tests {
+		output := accountsMerge(tc.input)
+		if !reflect.DeepEqual(output, tc.expected) {
+			t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
+		}
+	}
+}