Skip to main content Alex@Berkeley

Alex@Berkeley

Collaborative class notes repository by two Berkeley students named Alex. Sharing insights, summaries, and key concepts from our learnings. Go Bears!

Recent posts

  1. Cracking Dynammic Programming

    All dynamic programming problems may be modeled as a DAG of sub problems. Once you topologically sort that DAG, even tricky challenges, like finding the longest increasing subsequence or stacking cuboids, become as simple as tracing the longest path through your map.

Recent notes