Union find algorithm

March 26, 2019

Introduction

It is time for me to study lecture notes one more time. I like to take some notes and then find most challenging time complexity analysis, and then make my own notes as well.

Lecture notes

Here is the lecture notes from the university of princeton.edu.

I always confuse with quick find, quick union and union find. What are the differences? I worked on so many union find algorithm on Hackerrank.com, I should go back to review them and write code again.

Longest univalue path 

I asked the algorithm from 2018 to 2019 over 30 times on interviewing.io as a mock interviewer. I learn so many things over hundreds of interviwes last 365 days.

I like to work on union find algorithm and start to use the algorithm on mock interview as well. I started my first one with a senior developer in Sillicon Valley last night. I will continue to explore the algorithm, and learn together from interviewees on this most famous and applicable algorithm. It is so challenging and I could not be more happy to go for my weekly mock interviews.

Union find algorithm

I spent first twenty minutes to discuss with the interviwee last night. Since the interviewee could not relate to union find algorithm at all. It is such great opportunities for us to explore together how to solve the problem. What issues we have and we worked together the basics.

I like to master the algorithm. I already brought so many resources to help me master the algorithm, but I still could not make it this March 2019.

Here are facts:

1. I played hackerrank contest over 20 contests, won gold/ sliver/ bronze medal, a lot of times I had to work on graph algorithm, Krusal algorithm, minimum spanning tree;
2. I worked with my ex-coach last May over 100 minutes, I paid $100 Canada dollars for coaching session.
3. I worked on multiple algorithms tagged union find on leetcode.com. Here is the image.