Algorithms & Data Structures for Interviews
An intermediate course that assumes prior Python knowledge (variables, loops, functions, and lists) — finish 'Python Basics' first. Preparation for NVIDIA-style algorithm interview rounds: arrays and two pointers, hash maps, sliding window, binary search, sorting, linked lists, stacks and queues, trees and BSTs, heaps, graphs (BFS/DFS), and recursion with backtracking. Every lesson emphasizes thinking aloud, time and space complexity, and real-hardware performance reasoning — locality, constant factors, and memory-vs-speed trade-offs.
