Master the core BST operations (insert, delete, search) and their properties, understand BST limitations and the concept of balanced trees, with complete TypeScript code.

Master recursive and iterative templates for DFS in binary trees, graphs, and 2D arrays, and use TypeScript to solve classic problems such as path sum, island perimeter, and permutations.

Understand the principles and implementation of difference arrays, and use TypeScript to solve common problems like range increments and flight booking statistics.

Master the core ideas of divide and conquer—decompose, solve, and combine—by implementing merge sort, quicksort, quickselect, and more in TypeScript.

Master the core concepts of DP (optimal substructure, overlapping subproblems, state transitions) and use TypeScript to solve classic problems such as climbing stairs, the knapsack problem, longest common subsequence, and edit distance.

Build an adjacency list representation of graphs and implement depth-first search, breadth-first search, topological sort, and course schedule problems in TypeScript.

Understand how hash tables work, tips for using Map and Set in JavaScript/TypeScript, and how hashing applies to common frontend scenarios like deduplication, caching, and counters.

Master the principles and TypeScript implementation of max-heaps and min-heaps to solve high-frequency problems like TopK, merging K sorted lists, and finding the median in a data stream.