Archives

Master the two-pointer technique with pair sum, palindrome check, and container with most water.

Implement Dijkstra's algorithm for finding shortest paths in weighted graphs.

Implement DFS recursively and iteratively, with applications to path finding and cycle detection.

Implement merge sort using divide and conquer, with time and space analysis.

Implement binary search iteratively and recursively, plus search insert position.

Implement the singleton pattern and understand when to use (and avoid) it.

Implement the factory pattern for creating objects without specifying their concrete classes.

Implement the decorator pattern for adding behavior to objects dynamically.

Implement the strategy pattern with interchangeable sorting algorithms.

Build an event emitter from scratch implementing the observer pattern.

Build a graph with an adjacency list and implement BFS and DFS traversals.

Implement a stack and a queue, then build a queue using two stacks.

Implement a hash map with separate chaining, dynamic resizing, and collision handling.

Implement a binary search tree with insert, search, delete, and in-order traversal.

Build a singly linked list from scratch with insert, delete, search, and reverse operations.

Essential Python concepts: data model, decorators, generators, context managers, type hints, and collections.

Summary of the most important Python features from 3.10 through 3.13.

Essential PHP concepts: OOP, traits, interfaces, closures, generators, SPL data structures, and error handling.

Summary of the most important PHP 8.x features from 8.0 through 8.4.

Essential TypeScript concepts: type system, generics, utility types, type guards, and advanced patterns.

Summary of the most important TypeScript 5.x features, version by version.