$ whoami

thepointman.dev_

In-depth courses, structured learning paths, and algorithm breakdowns for software engineers who care about fundamentals.

Courses

Step 4

Step 5

Step 1

hardBellman-Ford0

Detect if currency exchange arbitrage is possible using Bellman-Ford on log-transformed rates.

time: O(V · E)space: O(V)

mediumDynamic Programming — 2D0

Maximize the total value of items that fit within a weight capacity, where each item can be used at most once.

time: O(n · W)space: O(W)

Given an array of integers and a target sum, return indices of two numbers that add up to the target.

time: O(n)space: O(n)