Fundamentals

• Welcome to the Foundation Course
• Computer Components
• Values, Variables, and Types
• Memory Size of Types
• The Stack and Heap
• References vs Values
• Why Data Structures Matter

Algorithm Complexity

• Counting Operations
• Constant vs Linear Time
• Quadratic Time
• Best, Worst, and Average Case
• Space Complexity

Array Basics

• What is an Array?
• Reading and Updating Elements
• Iterating Through Arrays
• Searching in Arrays
• Adding and Removing at End
• Adding and Removing at Middle

Practice Problems

• Find Maximum
• Count Occurrences
• Remove Element
• Merge Sorted Arrays
• Rotate Array

Advanced

• Dynamic Arrays

String Basics

• What is a String?
• String Indexing
• String Iteration
• String Concatenation
• String Comparison
• String Methods
• String Immutability
• Character Counting

Practice Problems

• Is Palindrome
• Reverse String
• Is Anagram
• Remove Vowels
• String Compression

Linked List Basics

• What is a Linked List?
• Nodes and Pointers
• Traversing a Linked List
• Insert at Head and Tail
• Deleting Nodes
• Linked List vs Array

Practice Problems

• Remove N-th Node from Linked List
• Delete All Occurrences from Linked List
• Delete Node Without Head Access
• Doubly Linked Lists

Queue Basics

• The FIFO Model
• Queue Operations
• Queue with Array
• Queue with Linked List
• Real-World Queue Examples

Practice Problems

• Simulate Print Queue
• Time Needed to Buy Tickets
• Josephus Problem

Hash Table Basics

• The Lookup Problem
• What is Hashing?
• Hash Functions
• Collision Handling
• Hashing to Bucket Index
• Using Built-in Hash Tables
• Sets - Uniqueness

Practice Problems

• Contains Duplicate
• Count Frequencies
• Two Sum
• Valid Anagram
• First Unique Character
• Intersection of Arrays

Stack Basics

• Stack - The LIFO Model
• Stack Operations
• Stack Applications

Practice Problems

• Valid Parentheses
• Remove Adjacent Duplicates in String
• Backspace String Compare
• Evaluate Reverse Polish Notation

Advanced

• Implementing Stack with Array
• Stack vs Queue - LIFO vs FIFO

Basic Sorting Algorithms

• Why Sorting Matters
• Selection Sort
• Insertion Sort
• Bubble Sort

Practice Problems - Implementations

• Practice: Counting Swaps

Comparing and Using Sorts

• Comparing Basic Sorting Algorithms
• Using Built-in Sort Functions

Custom Sorting

• Sorting with Custom Criteria

Practice Problems - Custom Sorting

• Sort Characters by Frequency
• Largest Number from Array
• Relative Sort Array

Sorting Applications

• When to Sort First

Practice Problems - Applications

• Arithmetic Progression
• Minimum Absolute Difference Pairs
• Maximum Product of Three

Advanced Concepts

• Beyond Basic Sorting