DSA Crash Course [Part 59] - Largest Component Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

> Write a function, *largest_component*, that takes in the adjacency list of an undirected graph. The function should return the size of the largest connected component in the graph.

```
largest_component({
  0: [8, 1, 5],
  1: [0],
  5: [0, 8],
  8: [0, 5],
  2: [3, 4],
  3: [2, 4],
  4: [3, 2]
}) # -> 4
```

```
largest_component({
  1: [2],
  2: [1,8],
  6: [7],
  9: [8],
  7: [6, 8],
  8: [9, 7, 2]
}) # -> 6
```

```
largest_component({
  3: [],
  4: [6],
  6: [4, 5, 7, 8],
  8: [6],
  7: [6],
  5: [6],
  1: [2],
  2: [1]
}) # -> 5
```

If you need additional support taking these DSA skills and actually applying them, take [**Alvin's**](https://www.linkedin.com/in/alvin-zablan-b73a92117/) *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: [**https://www.linkedin.com/in/alvin-zablan-b73a92117/**](https://www.linkedin.com/in/alvin-zablan-b73a92117/)

DSA Crash Course [Part 57] - Connected Components Count Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

> Write a function, *connected_components_count*, that takes in the adjacency list of an undirected graph. The function should return the number of connected components within the graph.

```
connected_components_count({
  0: [8, 1, 5],
  1: [0],
  5: [0, 8],
  8: [0, 5],
  2: [3, 4],
  3: [2, 4],
  4: [3, 2]
}) # -> 2
```

```
connected_components_count({
  1: [2],
  2: [1,8],
  6: [7],
  9: [8],
  7: [6, 8],
  8: [9, 7, 2]
}) # -> 1
```

```
connected_components_count({
  3: [],
  4: [6],
  6: [4, 5, 7, 8],
  8: [6],
  7: [6],
  5: [6],
  1: [2],
  2: [1]
}) # -> 3
```

If you need additional support taking these DSA skills and actually applying them, take [**Alvin's**](https://www.linkedin.com/in/alvin-zablan-b73a92117/) *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: [**https://www.linkedin.com/in/alvin-zablan-b73a92117/**](https://www.linkedin.com/in/alvin-zablan-b73a92117/)

DSA Crash Course [Part 55] - Undirected Path Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

> Write a function, *undirected_path*, that takes in a list of edges for an undirected graph and two nodes (\*node_A\*, *node_B*). The function should return a boolean indicating whether or not there exists a path between *node_A* and *node_B*.

```
edges = [
('i', 'j'),
('k', 'i'),
('m', 'k'),
('k', 'l'),
('o', 'n')
]

undirected_path(edges, 'j', 'm') # -> True
```

```
edges = [
('i', 'j'),
('k', 'i'),
('m', 'k'),
('k', 'l'),
('o', 'n')
]

undirected_path(edges, 'm', 'j') # -> True
```

```
edges = [
('i', 'j'),
('k', 'i'),
('m', 'k'),
('k', 'l'),
('o', 'n')
]

undirected_path(edges, 'l', 'j') # -> True
```

```
edges = [
('i', 'j'),
('k', 'i'),
('m', 'k'),
('k', 'l'),
('o', 'n')
]

undirected_path(edges, 'k', 'o') # -> False
```

If you need additional support taking these DSA skills and actually applying them, take [**Alvin's**](https://www.linkedin.com/in/alvin-zablan-b73a92117/) *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: [**https://www.linkedin.com/in/alvin-zablan-b73a92117/**](https://www.linkedin.com/in/alvin-zablan-b73a92117/)

DSA Crash Course [Part 53] - Has Path Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

> Write a function, *has_path*, that takes in a dictionary representing the adjacency list of a directed acyclic graph and two nodes (\_src\_, *dst*). The function should return a boolean indicating whether or not there exists a directed path between the *source* and *destination* nodes.

```
graph = {
'f': ['g', 'i'],
'g': ['h'],
'h': [],
'i': ['g', 'k'],
'j': ['i'],
'k': []
}

has_path(graph, 'f', 'k') # True
```

```
graph = {
'f': ['g', 'i'],
'g': ['h'],
'h': [],
'i': ['g', 'k'],
'j': ['i'],
'k': []
}

has_path(graph, 'f', 'j') # False
```

If you need additional support taking these DSA skills and actually applying them, take [**Alvin's**](https://www.linkedin.com/in/alvin-zablan-b73a92117/) *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: <https://www.linkedin.com/in/alvin-zablan-b73a92117/>

DSA Crash Course [Part 47] - Tree Min Value Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

> Write a function, *tree_min_value*, that takes in the root of a binary tree that contains number values.
>
> The function should return the minimum value within the tree.
>
> You may assume that the input tree is non-empty.

```
a = Node(3)
b = Node(11)
c = Node(4)
d = Node(4)
e = Node(-2)
f = Node(1)
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f

#      3
#    /   \
#   11    4
#  / \     \
# 4   -2    1

tree_min_value(a) # -> -2
```

```
a = Node(5)
b = Node(11)
c = Node(3)
d = Node(4)
e = Node(14)
f = Node(12)
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f

#      5
#    /   \
#   11    3
#  / \     \
# 4   14    12

tree_min_value(a) # -> 3
```

```
a = Node(-1)
b = Node(-6)
c = Node(-5)
d = Node(-3)
e = Node(-4)
f = Node(-13)
g = Node(-2)
h = Node(-2)
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f
e.left = g
f.right = h

#        -1
#      /   \
#    -6    -5
#   /  \     \
# -3   -4   -13
#      /       \
#    -2        -2

tree_min_value(a) # -> -13
```

If you need additional support taking these DSA skills and actually applying them, take [**Alvin's**](https://www.linkedin.com/in/alvin-zablan-b73a92117/) *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: <https://www.linkedin.com/in/alvin-zablan-b73a92117/>

DSA Crash Course [Part 46] - Tree Includes Walkthrough

In this lesson, Alvin walks through the python implementation for the *tree_includes* problem.

Code along and test your work in the following editor workspace: <https://structy.net/problems/tree-includes?language=py>

If you need additional support taking these DSA skills and actually applying them, take [**Alvin's**](https://www.linkedin.com/in/alvin-zablan-b73a92117/) *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: <https://www.linkedin.com/in/alvin-zablan-b73a92117/>

DSA Crash Course [Part 43] - Tree Sum Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

> Write a function, *tree_sum*, that takes in the root of a binary tree that contains number values. The function should return the total sum of all values in the tree.

```
a = Node(3)
b = Node(11)
c = Node(4)
d = Node(4)
e = Node(-2)
f = Node(1)
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f

#       3
#    /    \
#   11     4
#  / \      \
# 4   -2     1

tree_sum(a) # -> 21
```

```
a = Node(1)
b = Node(6)
c = Node(0)
d = Node(3)
e = Node(-6)
f = Node(2)
g = Node(2)
h = Node(2)
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f
e.left = g
f.right = h

#      1
#    /   \
#   6     0
#  / \     \
# 3   -6    2
#    /       \
#   2         2

tree_sum(a) # -> 10
```

```
tree_sum(None) # -> 0
```

If you need additional support taking these DSA skills and actually applying them, take [**Alvin's**](https://www.linkedin.com/in/alvin-zablan-b73a92117/) *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: <https://www.linkedin.com/in/alvin-zablan-b73a92117/>

How to Crack System Design Interviews - Part 10: Preparation Resources

This video outlines resources and strategies to prepare for system design interviews. We can improve our performance by:

- **Building a strong vocabulary:** Familiarizing ourselves with key technologies and concepts (e.g., Amazon S3, Apache Kafka) helps us communicate ideas effectively and demonstrate practical understanding.

- **Developing theoretical knowledge:** We can gain a solid theoretical foundation through courses like Interview Ready, which covers high-level and low-level design concepts, design trade-offs, and other essential topics.

- **Gaining practical experience:** Mock interviews provide invaluable practice and build confidence for the real interview. Consider using free platforms or seeking discounts if available.

- **Utilizing online assessment tools:** If time is limited, leverage automated online judges to assess and reinforce understanding of system design components and their placement.

- **Prioritizing human interaction:** While online tools are helpful, prioritize mock interviews with experienced individuals for the most effective preparation and feedback.

A few tools mentioned: 

- Mock Interviews: [joinTaro.com/perks](https://www.jointaro.com/perks/)
- [Automated Design Judge](https://interviewready.io/question-list/system-design-judge/?_aff=JOINTARO)
- [General Resources for SD](https://interviewready.io/resources)

[Gaurav Sen](https://www.linkedin.com/in/gkcs/) has conducted 1000s of system design interviews while working at Uber and building his [YouTube channel](https://www.youtube.com/@gkcs) to 500K+ subscribers. His platform [InterviewReady](https://interviewready.io/?_aff=JOINTARO) combines video explainers, live Zoom classes, and an automated System Design Judge.

Why Big Tech Companies Do Open Source (From A Director at Meta)

Companies like Meta, Google, Microsoft, and Hugging Face have made enormous contributions to open source. These companies often allocate tens or hundreds of millions of dollars to creating or maintaining open source software. Why? 

- These companies often rely on the software for their production code
- Companies can use popular open-source projects as a tool to recruit top engineers
- Engineers familiar with a company's software will onboard faster

[Paper Reading] Deploy ML Models from Lab to Production

Session led by: [Akshika Wijesundara PhD](https://www.linkedin.com/in/akshika/)

If you don't have a Taro Premium membership, you can get it with a discount with Akshika's special link here: [**https://www.jointaro.com/r/akshikw802/**](https://www.jointaro.com/r/akshikw802/)

**WHAT YOU'LL LEARN**

- **Discover the benefits of CI/CD pipelines:** Learn how CI/CD pipelines streamline the model building, testing, and deployment processes, enabling rapid iteration and continuous improvement.
- **Containerize your ML code:** Understand the steps and advantages of containerizing your machine learning code to ensure consistency, portability, and efficient resource management.
- **Leverage the AWS stack for ML workloads:** Explore how to effectively utilize AWS as your cloud infrastructure provider to run and scale your machine learning workloads with ease and reliability.

**WHY THIS TOPIC MATTERS**

MLOps isn't just about fancy models - it's about getting them working for real! Learn how to deploy, maintain, and collaborate on ML projects, making you a highly-demand expert who can turn machine learning into real-world impact.

[Paper Reading] ROSE: Robust Caches for Amazon Product Search

Session led by: [Dharin Shah](https://www.linkedin.com/in/dharinshah/)

ROSE introduces a robust caching system that tolerates misspellings and typos while maintaining the efficiency of traditional caches. The core innovation is a randomized hashing schema that allows ROSE to index and retrieve a vast set of queries with constant memory and time. This system is robust against query intent, typos, and grammatical errors, offering theoretical guarantees of its performance.

Extensive experiments on real-world datasets highlight ROSE's effectiveness and efficiency, showcasing significant improvements in Amazon's search engine performance across key business metrics.\
\
In this session we deep dive into the query caching layer at Amazon that allows for far better and robust search performance

[**https://drive.google.com/file/d/13YwkeCc1XwnRVDVkcuE7MKt2r7aqld24/view**](https://drive.google.com/file/d/13YwkeCc1XwnRVDVkcuE7MKt2r7aqld24/view)

Taro Book Club: The Pragmatic Programmer - Session 4

Session led by: [Bikram Kashyap](https://www.linkedin.com/in/kashyapbikram/)

In this #taro-bookclub discussion, we'll further go over [**"The Pragmatic Programmer"**](https://www.amazon.com/Pragmatic-Programmer-Journeyman-Master/dp/020161622X) by Andrew Hund & David Thomas.

Here's the agenda:

- Power of Plain Text
- Shell Games
- Power Editing
- Version Control
- Debugging
- Text Manipulation
- Engineering Daybooks

Please send your questions ahead of time to [**Bikram Kashyap**](https://www.linkedin.com/in/kashyapbikram/) in the [**Taro Premium**](https://www.jointaro.com/membership/) Slack, so that they can be included in the discussion. [***If you don't have the book***](https://taropremium.slack.com/archives/C05CKBHPNTU/p1723491587867879) *or want more details on how this all works, check out the #taro-bookclub channel in the Taro Premium Slack as well!*

Get ready for another engaging and informative session!

Break Into Tech And Become A Software Engineer [Part 12] - Pick A Platform

In this lesson, Brian emphasizes the value of choosing the right platform for writing online, with a strong recommendation for LinkedIn.

This lesson covers:

- Why LinkedIn is a great platform for building a professional presence, with less anonymity and trolling compared to platforms like X or TikTok
- The advantage of standing out on LinkedIn, where recruiters and employers are more active, making it easier to connect with professionals
- How while platforms like X and TikTok offer cutting-edge tech content, LinkedIn provides a safer environment to network with verified professionals and receive genuine feedback

If you need extra help breaking into tech, join Brian's exclusive, cohort-based bootcamp (just 10 students per batch). Use this special link for $800 off: <https://www.parsity.io/taro>

Connect with Brian on LinkedIn: <https://www.linkedin.com/in/brianjenney/>

Become An Open Source Master [Part 13] - Dipping Your Toes Into A Project

We can contribute to open source projects in many ways, even without writing code. We can triage issues, work on documentation, improve the website design, or provide translations. We can also become an advocate for the project by promoting it on social media, writing articles, or creating training courses. By contributing to the broader ecosystem, we can help the project succeed and build our own reputation in the community.

Connect with James:

- GitHub: <https://github.com/jamesgpearce>
- Twitter (X): <https://twitter.com/jamespearce>

Become An Open Source Master [Part 12] - Identify A First Task

We can start contributing to open source projects by looking for existing issues that we can solve. We can use the "help wanted" or "good first issue" tags to find suitable tasks. Contributing to open source projects is a great way to get involved in the community and make the project better. Check out TinyBase as an example: <https://github.com/tinyplex/tinybase/issues>

Connect with James:

- GitHub: <https://github.com/jamesgpearce>
- Twitter (X): <https://twitter.com/jamespearce>

Become An Open Source Master [Part 9] - Solve A Need

When choosing an open-source project to contribute to, we should:

- **Focus on solving a need:** Choose a project that you'll benefit from and have a passion for working on.
- **Assess the project's health:** Look for signs of active maintenance, such as merged pull requests and recent activity.
- **Seek insights from others:** Talk to people who have worked on the project to get their perspectives on the community and development process.

Connect with James: 

- GitHub: <https://github.com/jamesgpearce>
- Twitter (X): <https://twitter.com/jamespearce>

How Managers Hire Great Engineers [Part 25] - Conclusion

Congratulations on making it to the end of the course!

Start a career discussion in Taro: <https://www.jointaro.com/questions/create/>

Join Taro events: <https://www.jointaro.com/events/>

Connect with John Egan on LinkedIn: <https://www.linkedin.com/in/jwegan/>

How Managers Hire Great Engineers [Part 4] - The Recruiting Funnel

In order to master the recruiting funnel, you must know the key terms and strategies for optimizing the hiring process. After this lesson, you will:

- Learn the definitions of sourcing, outreach, and closing, and how they fit into the recruiting funnel
- Understand industry averages for recruiting metrics and how to use them to benchmark your process
- Discover where managers can have the highest impact in the recruiting funnel, particularly at the top and bottom stages
- Gain insights on how to troubleshoot and improve conversion rates throughout the funnel
- Focus on attracting and closing top talent to make your recruiting process more efficient

Connect with John Egan on LinkedIn: <https://www.linkedin.com/in/jwegan/>

How Managers Hire Great Engineers [Part 12] - Outreach Basics

So you've found a great candidate - Now it's time to get them into your interview loop. From this lesson, you will:

- Understand the benchmark for a good response rate when sourcing candidates, with 15% as the target for moving candidates forward in the recruitment process
- Learn that email outreaches typically yield higher response rates than LinkedIn InMails and why finding a candidate’s personal email can be more effective
- Discover the advantages of outreach coming directly from an engineering manager rather than a recruiter to significantly increase the likelihood of a response
- Explore tools and methods for finding candidate emails, including using services like Clearbit and experimenting with Gmail to predict email addresses
- Gain insights into how personalizing the outreach process by handling initial replies and interactions can make a meaningful impact on recruitment outcomes

Connect with John Egan on LinkedIn: [https://www.linkedin.com/in/jwegan/​](https://www.linkedin.com/in/jwegan/%E2%80%8B)

Clear Communication For SWEs [Part 10] - Rephrasing For Clarity

In this video, I delve into the art of rephrasing for clarity, emphasizing its significance in reaching a wider audience and maintaining engagement. Techniques like simplifying language, breaking down complex ideas, using synonyms, and restating key points are explored with practical examples. Viewers are encouraged to apply these strategies to enhance message comprehension and audience connection.

Connect with me on LinkedIn: <https://www.linkedin.com/in/ryan-wiens/>

Tech Career Growth Videos

Our instructional videos provide software engineers with insights needed for career growth. Masterclasses go incredibly in-depth on a specific tech topic while case studies are real examples from established engineering leaders.