DSA Crash Course [Part 76] - Counts Paths Walkthrough

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

Code along and test your work in the following editor workspace: <https://structy.net/problems/count-paths?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/**](https://www.linkedin.com/in/alvin-zablan-b73a92117/)

DSA Crash Course [Part 75] - Count Paths Approach

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

> Write a function, *count_paths*, that takes in a grid as an argument. In the grid, 'X' represents walls and 'O' represents open spaces. You may only move down or to the right and cannot pass through walls. The function should return the number of ways possible to travel from the top-left corner of the grid to the bottom-right corner.

```
grid = [
["O", "O"],
["O", "O"],
]

count_paths(grid) # -> 2
```

```
grid = [
["O", "O", "X"],
["O", "O", "O"],
["O", "O", "O"],
]

count_paths(grid) # -> 5
```

```
grid = [
["O", "O", "O"],
["O", "O", "X"],
["O", "O", "O"],
]

count_paths(grid) # -> 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 73] - Minimum Change Approach

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

> Write a function *min_change* that takes in an amount and a list of coins. The function should return the minimum number of coins required to create the amount. You may use each coin as many times as necessary.
>
> If it is not possible to create the amount, then return -1.

```
min_change(8, [1, 5, 4, 12]) # -> 2, because 4+4 is the minimum coins possible
```

```
min_change(13, [1, 9, 5, 14, 30]) # -> 5
```

```
min_change(23, [2, 5, 7]) # -> 4
```

```
min_change(102, [1, 5, 10, 25]) # -> 6
```

```
min_change(200, [1, 5, 10, 25]) # -> 8
```

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 69] - Tribonacci Approach

In this lesson, Alvin explores the strategy to solving the following problem using dynamic programming:

> Write a function *tribonacci* that takes in a number argument, *n*, and returns the *n*\-th number of the Tribonacci sequence.
>
> The 0-th and 1-st numbers of the sequence are both 0.
>
> The 2-nd number of the sequence is 1.
>
> To generate further numbers of the sequence, calculate the sum of previous three numbers.
>
> Solve this recursively.

```
tribonacci(0) # -> 0
```

```
tribonacci(1) # -> 0
```

```
tribonacci(2) # -> 1
```

```
tribonacci(5) # -> 4
```

```
tribonacci(7) # -> 13
```

```
tribonacci(14) # -> 927
```

```
tribonacci(20) # -> 35890
```

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 61] - Shortest Path Approach

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

> Write a function, *shortest_path*, that takes in a list of edges for an undirected graph and two nodes (\*node_A\*, *node_B*). The function should return the length of the shortest path between *A* and *B*. Consider the length as the number of edges in the path, not the number of nodes. If there is no path between *A* and *B*, then return -1. You can assume that *A* and *B* exist as nodes in the graph.

```
edges = [
['w', 'x'],
['x', 'y'],
['z', 'y'],
['z', 'v'],
['w', 'v']
]

shortest_path(edges, 'w', 'z') # -> 2
```

```
edges = [
['w', 'x'],
['x', 'y'],
['z', 'y'],
['z', 'v'],
['w', 'v']
]

shortest_path(edges, 'y', 'x') # -> 1
```

```
edges = [
['a', 'c'],
['a', 'b'],
['c', 'b'],
['c', 'd'],
['b', 'd'],
['e', 'd'],
['g', 'f']
]

shortest_path(edges, 'a', 'e') # -> 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 45] - Tree Includes Approach

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

> Write a function, *tree_includes*, that takes in the root of a binary tree and a target value. The function should return a boolean indicating whether or not the value is contained in the tree.

```
a = Node("a")
b = Node("b")
c = Node("c")
d = Node("d")
e = Node("e")
f = Node("f")
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f

#      a
#    /   \
#   b     c
#  / \     \
# d   e     f

tree_includes(a, "e") # -> True
```

```
a = Node("a")
b = Node("b")
c = Node("c")
d = Node("d")
e = Node("e")
f = Node("f")
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f

#      a
#    /   \
#   b     c
#  / \     \
# d   e     f

tree_includes(a, "a") # -> True
```

```
a = Node("a")
b = Node("b")
c = Node("c")
d = Node("d")
e = Node("e")
f = Node("f")
a.left = b
a.right = c
b.left = d
b.right = e
c.right = f

#      a
#    /   \
#   b     c
#  / \     \
# d   e     f

tree_includes(a, "n") # -> 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 23] - Linked List Warm Up Lecture

In this lecture, Alvin goes over how to implement a linked list in python.

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 13] - Pair Sum Walkthrough

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

Code along and test your work in the following editor workspace: <https://structy.net/problems/pair-sum?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/>

How to Crack System Design Interviews - Part 2: Clarifying Requirements

In a system design interview, the first step is gathering requirements, focusing on how users will interact with the system. Here's how we approach this:

- **Understand user needs:** We consider the basic functions users will need, such as applying filters, viewing original images, and deleting images.
- **Confirm and prioritize:** We check with the interviewer to ensure we've captured all the key requirements and prioritize the most important ones.
- **Identify trade-offs:** We analyze potential trade-offs, such as image quality versus storage needs, and quantify them whenever possible.
- **Set realistic expectations:** We avoid aiming for perfection and instead focus on creating a practical design that meets the core requirements.
- **Provide concrete examples:** We use real-world examples to illustrate our understanding of system design concepts and demonstrate our ability to make informed decisions.

[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.

Growth And Promotion 2/6: Author Intro

This video covers the course outline and Ethan's background:

- The career growth recipe: explaining the magic loop.
- Beyond the basics: Advanced tactics for high performers, guidance for leaders.
- Prioritization: How to make time to focus on your growth, specific steps to ensure that you do the most valuable work
- Summary: re-iterating key points.

Starting at Amazon as a Senior Manager, then Director, then Vice President, Ethan has had decades of experience at top tech companies. This career growth course is developed from his own knowledge and input from his extensive network of fellow coaches and executives.

- Connect with [**Ethan on LinkedIn**](https://www.linkedin.com/in/ethanevansvp/)
- Taro members get a discount to join [Ethan's Level Up community](https://levelupwithethanevans.substack.com/taro25)

Break Into Tech And Become A Software Engineer [Part 18] - Work For Free

In this lesson, Brian discusses the value of working for free as a way to gain experience, while emphasizing that it’s not truly "free" but a trade for validation and learning.

This lesson covers:

- How free work is a way to gain experience and build credibility, but it’s essential to set clear deliverables and avoid being taken advantage of
- Approaching local businesses with well-defined projects to solve real problems, not just offering technical solutions, and using these opportunities to practice communication skills
- Sharing your experiences online, requesting recommendations, and using badges to validate your work and make yourself more attractive to future employers

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/>

Break Into Tech And Become A Software Engineer [Part 16] - Leverage Your Warm Network

In this lesson, Brian emphasizes the importance of leveraging your existing personal network, not just online platforms, to find job opportunities in tech.

This lesson covers:

- Using family, friends, and former colleagues to generate warm leads for software development positions, as many opportunities may exist close to home
- The concept of "seven degrees of separation" to illustrate how connections through your network can lead to valuable job prospects
- How reaching out to people within your network can provide unexpected opportunities, even from places like past jobs or local companies

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/>

Break Into Tech And Become A Software Engineer [Part 14] - Networking Without Being Weird

In this lesson, Brian emphasizes the importance of authentic online networking and provides strategies to build genuine connections without being cringy.

This lesson covers:

- Avoiding the common mistake of sending unsolicited requests for jobs or favors and focusing on building relationships instead
- Engaging with others by commenting on their posts and asking genuine questions to foster meaningful interactions
- Curating your feed by following like-minded individuals who share valuable content, ensuring that your online experience is constructive and positive

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/>

Break Into Tech And Become A Software Engineer [Part 8] - It's All About Time Management

In this lesson, Brian addresses the challenge of finding time to code amidst a busy life, offering practical strategies for better time management.

This lesson covers:

- Identifying time-wasting activities and making sacrifices, like cutting back on social media or entertainment, to create more time for learning
- Planning the most important task of the day the night before and waking up 30-45 minutes earlier to focus on it without distractions
- Working in short, productive sprints to maximize efficiency and avoid burnout

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/>

Paper Reading: LLaMA  Open and Efficient Foundation Language Models

Session Led By: [Mike A](https://www.linkedin.com/in/malik-mike-a-32b63818b/)

Join us for the first installment of our three-part paper reading series on the LLaMA series of Large Language Models (LLMs).\
\
In this session, we will explore the foundational concepts and innovations behind the initially released LLaMA models, introduced by Meta AI back in early 2023. The first series of LLaMA models, ranging from 7B to 65B parameters, and how they opened the door to efficient, open-weight LLMs that can be trained on publicly available datasets.

This event will cover the groundbreaking at the time techniques used to train LLaMA models, which outperformed previous state-of-the-art models like GPT-3 on many benchmarks, despite being significantly smaller. We'll focus on the details of their unique training approach, data mixture, and architectural enhancements. We will also discuss the impressive zero-shot and few-shot capabilities of these models on tasks, highlighting the efficiency and accessibility that made these models popular within the open-source community.

This session is a must-attend for researchers, developers, and AI enthusiasts interested in the recent history behind the latest advancements in language modeling and AI research as we build our understanding of the LLaMA models towards the latest releases from Meta AI. Whether you're keen to understand the intricacies of LLMs, explore the potential of open-source AI models, or gain insights into the future of efficient AI by reflecting on the past, this paper reading will provide valuable knowledge and stimulate thought-provoking considerations.

Mark your calendars for an enlightening hour of "LLaMA: Open and Efficient Foundation Language Models" and be part of the journey to explore the future of AI language models through a review of the past.

Become An Open Source Master [Part 23] - Be Like Water

It's hard to play well with others when we're very stubborn. Instead, "*be like water*":

- Adapt our contributions to fit the project's philosophy and guidelines.
- Observe and learn from other successful pull requests in the project.
- Be patient and work with the maintainers to get our changes approved.

The viral bad pull request mentioned: <https://github.com/A11yance/axobject-query/pull/354> 

The full process of making a contribution in a big, scary project: [Fixing a Bug in Google Chrome as a First-Time Contributor](https://cprimozic.net/blog/fixing-a-bug-in-google-chrome/)

Connect with James:

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

Become An Open Source Master [Part 20] - Share What You Learn

Share what you learn as you go on your open-source journey. We can add comments to the code, write wiki pages or articles, or even file issues in the codebase to better understand. When we're ready to start contributing, we should pick a task, dive into the code, and start experimenting with it by adding print statements or breakpoints. This will help us get familiar with the code and the build process so that we can be more effective when making meaningful contributions.

Video reference: [10 Things I Learned from the jQuery Source](https://www.youtube.com/watch?v=i_qE1iAmjFg)

[How to learn a new codebase fast](https://www.jointaro.com/lesson/DX27hiXPJ4G7Czk2mwLL/how-to-learn-a-new-codebase-fast/).

Connect with James:

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

Become An Open Source Master [Part 19] - What Opinions Do The Authors Have?

Be aware of the human element in open-source projects. We should understand and follow the project's coding style, including linting and formatting preferences. If the project lacks a style guide or linting rules, we can offer to help create them, but we should always do so with the approval of the original maintainers.

Connect with James:

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

Become An Open Source Master [Part 15] - Find The Project Community

It's important to understand the bigger picture instead of focusing on every single line of code. Some questions worth asking when approaching a new codebase are: 

- what is the purpose of the code
- what are the opinions of the developers
- how is the code structured?

Connect with James:

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

Become An Open Source Master [Part 5] - The Benefits Of Open Source

We'll discuss the reasons why you should get involved in open source and the benefits it can bring, both professionally and personally.

- **Work on code that matters:** Contribute to projects used by others, gaining a sense of achievement and pride.
- **Improve your coding skills:** Receive feedback and learn from experienced developers, improving your coding abilities and knowledge.
- **Build relationships:** Connect with maintainers, contributors, and users, expanding your network and learning opportunities.
- **Enhance your professional portfolio:** Showcase your skills and experience to potential employers through your open source contributions.
- **Grow your personal reputation:** Gain recognition and build valuable connections within the open source community.

Connect with James: 

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

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.