DSA Crash Course [Part 18] - Recursion Intro Lecture

In this lecture, Alvin introduces the mental model we should use when applying recursion.

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 17] - Intersection Walkthrough

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

Code along and test your work in the following editor workspace: <https://structy.net/problems/intersection?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 16] - Intersection Approach

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

> Write a function, *intersection*, that takes in two lists, *a*,\_b\_, as arguments. The function should return a new list containing elements that are in both of the two lists.
>
> You may assume that each input list does not contain duplicate elements.

```
intersection([4,2,1,6], [3,6,9,2,10]) # -> [2,6]
```

```
intersection([2,4,6], [4,2]) # -> [2,4]
```

```
intersection([4,2,1], [1,2,4,6]) # -> [1,2,4]
```

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 15] - Pair Product Walkthrough

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

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

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

> Write a function, *pair_product*, that takes in a list and a target product as arguments. The function should return a tuple containing a pair of indices whose elements multiply to the given target. The indices returned must be unique.
>
> Be sure to return the indices, not the elements themselves.
>
> There is guaranteed to be one such pair whose product is the target.

```
pair_product([3, 2, 5, 4, 1], 8) # -> (1, 3)
```

```
pair_product([3, 2, 5, 4, 1], 10) # -> (1, 2)
```

```
pair_product([4, 7, 9, 2, 5, 1], 5) # -> (4, 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/>

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

DSA Crash Course [Part 12] - Pair Sum Approach

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

> Write a function, *pair_sum*, that takes in a list and a target sum as arguments. The function should return a tuple containing a pair of indices whose elements sum to the given target. The indices returned must be unique.
>
> Be sure to return the indices, not the elements themselves.
>
> There is guaranteed to be one such pair that sums to the target.

```
pair_sum([3, 2, 5, 4, 1], 8) # -> (0, 2)
```

```
pair_sum([4, 7, 9, 2, 5, 1], 5) # -> (0, 5)
```

```
pair_sum([4, 7, 9, 2, 5, 1], 3) # -> (3, 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/>

DSA Crash Course [Part 11] - Most Frequent Char Walkthrough

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

Code along and test your work in the following editor workspace: <https://structy.net/problems/most-frequent-char?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 10] - Most Frequent Char Approach

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

> Write a function, *most_frequent_char*, that takes in a string as an argument. The function should return the most frequent character of the string. If there are ties, return the character that appears earlier in the string.
>
> You can assume that the input string is non-empty.

```
most_frequent_char('bookeeper') # -> 'e'
```

```
most_frequent_char('david') # -> 'd'
```

```
most_frequent_char('abby') # -> 'b'
```

```
most_frequent_char('mississippi') # -> 'i'
```

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 9] - Anagrams Walkthrough

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

Code along and test your work in the following editor workspace <https://structy.net/problems/anagrams?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 8] - Anagrams Approach

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

> Write a function, *anagrams*, that takes in two strings as arguments. The function should return a boolean indicating whether or not the strings are anagrams. Anagrams are strings that contain the same characters, but in any order.

```
anagrams('restful', 'fluster') # -> True
```

```
anagrams('cats', 'tocs') # -> False
```

```
anagrams('monkeyswrite', 'newyorktimes') # -> True
```

```
anagrams('paper', 'reapa') # -> 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 7] - Big-O Examples Lecture

In this lecture, Alvin shows examples of code with different Big-O complexities.

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 6] - Big-O Basics Lecture

In this lecture, Alvin goes over the basics of Big-O notation and how to use it to describe the complexity of algorithms.

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 5] - Is Prime Walkthrough

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

Code along and test your work in the following editor workspace: <https://structy.net/problems/is-prime?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 4] - Is Prime Approach

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

> Write a function, *is_prime*, that takes in a number as an argument. The function should return a boolean indicating whether or not the given number is prime.
>
> A prime number is a number that is only divisible by two distinct numbers: 1 and itself.
>
> For example, 7 is a prime because it is only divisible by 1 and 7. For example, 6 is not a prime because it is divisible by 1, 2, 3, and 6.
>
> You can assume that the input number is a positive integer.

```
is_prime(2) # -> True
```

```
is_prime(3) # -> True
```

```
is_prime(4) # -> False
```

```
is_prime(5) # -> True
```

```
is_prime(6) # -> False
```

```
is_prime(7) # -> True
```

```
is_prime(8) # -> False
```

```
is_prime(2017) # -> True
```

```
is_prime(2048) # -> 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 3] - Max Value Walkthrough

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

Code along and test your work in the following editor workspace: <https://structy.net/problems/max-value?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 2] - Max Value Approach

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

> Write a function, *max_value*, that takes in a list of numbers as an argument. The function should return the largest number in the list.\
> \
> Solve this without using any built-in list methods.\
> \
> You can assume that the list is non-empty.

```
max_value([4, 7, 2, 8, 10, 9]) # -> 10
```

```
max_value([10, 5, 40, 40.3]) # -> 40.3
```

```
max_value([-5, -2, -1, -11]) # -> -1
```

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 1] - Course Welcome

Welcome to our crash course for data structures and algorithms! This incredibly in-depth course will help you master core data structures and algorithms concepts, even if you're a complete beginner with the topic. This course is exactly for you if:

- You want to be efficient with your study time
- You don't enjoy solely grinding LeetCode because it's slow and frustrating
- You want to actually understand the concepts instead of merely memorizing patterns

This course is special because it's carefully engineered to be a smooth and effective ride:

- Problems are specifically chosen to be a progressive sequence, building on top of one another
- The overall difficulty of the problems you'll solve will gradually increase
- You will be able to visualize the underlying data structures and algorithms with animated explanations
- Learn the implementation with concrete code walkthroughs

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 11: Conclusion

This concludes the System Design Interview course! To maximize your performance in upcoming interviews, we recommend:

- **Reviewing the course content:** Shortly before your interview, revisit the course material and use it as a checklist to ensure you've grasped the key concepts.

- **Focusing on communication:** Remember that the interview assesses your ability to communicate effectively, demonstrate knowledge of existing systems, and showcase problem-solving skills.

- **Practicing and preparing:** Thorough preparation is crucial for success in system design interviews. Utilize the resources and strategies discussed throughout the course to enhance your skills and increase your confidence.

- **Remembering your value:** Regardless of the interview outcome, your competence and skills as an engineer remain valuable.

Good luck with your interviews!

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

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.

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.