From 56295d5342a74ff2fe770b7c8d0acc6dad94db11 Mon Sep 17 00:00:00 2001 From: Yevhen Dubinin Date: Mon, 26 Feb 2024 15:51:06 -0800 Subject: [PATCH] Update README.md add Leetcode section --- README.md | 11 +++++++++++ 1 file changed, 11 insertions(+) diff --git a/README.md b/README.md index 6d2cfd5..4da4827 100644 --- a/README.md +++ b/README.md @@ -12,3 +12,14 @@ Grad it here: [UnionFind.swift](UnionStreet/UnionFind.swift) # Problem **Union Find** algorithm that I often has to write from scratch myself for [Leetcode](https://leetcode.com) solutions. I have seen Union Find being implemented in a form of `struct` or `class` instead of inline functions with two arrays. This project exists so one can quickly copy-and-paste a `UnionFind` data structure to a [Swift] Leetcode solutions. + +# Goals + +1. Simple AF +2. Tested + +# Leetcode + +Problems that *can* be solved with `Union Find` data structure. + +* [2709. Greatest Common Divisor Traversal](https://leetcode.com/problems/greatest-common-divisor-traversal/)