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 complete data structures and algorithms course on Structy. 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 the entire Structy DSA learning experience.

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

Crash Course: Beginner Data Structures And Algorithms Concepts

Overview

Course Welcome

Core Problems And Concepts

Max Value Approach

Max Value Walkthrough

Is Prime Approach

Is Prime Walkthrough

Big-O Examples Lecture

Array and String Basics

Anagrams Approach

Anagrams Walkthrough

Most Frequent Char Approach

Most Frequent Char Walkthrough

Pair Sum Approach

Pair Sum Walkthrough

Pair Product Approach

Pair Product Walkthrough

Intersection Approach

Intersection Walkthrough

Recursion Basics

Recursion Intro Lecture

Recursion Warm Up Lecture

Sum Numbers Recursive Approach

Sum Numbers Recursive Walkthrough

Linked Lists

Linked List Intro Lecture

Linked List Warm Up Lecture

Linked List Values Approach

Linked List Values Walkthrough

Sum List Approach

Sum List Walkthrough

Linked List Find Approach

Linked List Find Walkthrough

Get Node Value Approach

Get Node Value Walkthrough

Reverse List Approach

Reverse List Walkthrough

Zipper Lists Approach

Zipper Lists Walkthrough

Intermission: Go Deeper

Want To Learn More DSA With Alvin?

Binary Trees

Binary Tree Intro Lecture

Binary Tree Warm Up Lecture

Depth First Values Approach

Depth First Values Walkthrough

Breadth First Values Approach

Breadth First Values Walkthrough

Tree Sum Approach

Tree Sum Walkthrough

Tree Includes Approach

Tree Includes Walkthrough

Tree Min Value Approach

Tree Min Value Walkthrough

Max Root to Leaf Path Sum Approach

Max Root to Leaf Path Sum Walkthrough

Graphs

Graph Intro Lecture

Graph Warm Up Lecture

Has Path Approach

Has Path Walkthrough

Undirected Path Approach

Undirected Path Walkthrough

Connected Components Count Approach

Connected Components Count Walkthrough

Largest Component Approach

Largest Component Walkthrough

Shortest Path Approach

Shortest Path Walkthrough

Island Count Approach

Island Count Walkthrough

Minimum Island Approach

Minimum Island Walkthrough

Dynamic Programming

Fibonacci Approach

Fibonacci Walkthrough

Tribonacci Approach

Tribonacci Walkthrough