Week 2 — Phase 3

What did I learn this week?
Aside from all the information I gather from the repository, I’ve been preparing myself for my mock interview, mainly about graphs because, aside from Binary trees I’ve barely used any other algorithm like Dijkstra, Depth First Search or Breadth First Search I only had a basic knowledge because they are good examples to learn about BigO notation. I started from the basic, defining classes and nodes and how to visit each node.
I have been working on my interview, and, at the same time I have been trying to calculate their complexity. Probably the most difficult part is knowing in which cases some algorithms are better than others. Some algorithms, in the book, seem to be fast but sometimes you can find that there are research about how you can make the algorithm faster.

Status:

Also I have been working with the Matplotlib library because it was a library I used a lot in my career and wanted to contribute to it, unfortunately there wasn’t any issue I could take because some of it was taken or because, as I said before, some contributions are worth more than others. Instead I cloned the repository and tried to figure out how some things works and hope there is an open issue or find another repository that uses this library (there are some out there but are small libraries). I keep working on understanding the issue and answering my questions for the repository I choose.

My biggest problem in this phase was be able to find a repository to work on but as I was writing the essay I found that the issue I was looking into was still open so I just sent a request to work on it. I have been following the thread so now I’ll keep working on it.
Issue: https://github.com/matplotlib/matplotlib/issues/20452