I Respawned As A Super Coder In A World With AI

A FIELD GUIDE · VERIFIED NOV 2026

— the respawn guide, by Big Poppa Code

One path · 66 sessions · 342 side quests

Start the path Browse the library

410pages

66sessions

26exercises

9languages

23patterns

SCROLL

00 / THE PATH

66 sessions. Your pace.

Each session points at its side quests. Three sessions a week suggests 22 weeks. Choose your own days.

W01U1 W02U1·2 W03U2 W04U2·3 W05U3 W06U3·4 W07U4 W08U4 W09U4 W10U4 W11U4·5 W12U5·6 W13U6 W14U7 W15U7·8 W16U8·9 W17U9 W18U9·10 W19U10 W20U11 W21U11·12 W22U12

Latest: 12.5 Coronation Day

Act I · FoundationAct II · The cheat skillAct III · The kingdom

01 / SIDE QUESTS

Ten tracks. 342 side quests.

The library the path points into.

28 pages

01Algorithms

Big O, sorting, searching, recursion, and the interview patterns.

Big O

17 pages

02Data Structures

Lists, hash maps, trees, heaps, tries, and graphs.

ArrayList

29 pages

03Practice

AlgoCasts exercises, a try-it-first gate, and two project skeletons.

Reverse string

68 pages

04Languages

JavaScript, then eight more languages on the same five-step path.

JavaScript

40 pages

05System Design

The 45-minute framework, the numbers, and the walkthroughs.

The 45-Minute System Design Interview

24 pages

06Design Patterns

All 23 Gang of Four patterns as runnable JavaScript.

Abstract Factory

12 pages

07Security

OWASP Top 10:2025, with the vulnerable line and the fix.

A01:2025 Broken Access Control

3 pages

08Mindset

Grit, and the four moves that make a skill yours.

The Ultimate Guide to Knowing What the Heck You're Talking About

11 pages

09Atelier

Build a polished portfolio with CSS, visual walkthroughs, and working examples.

Tokens and type

104 pages

10Explained

The series, with a writeup under each video.

HTML, CSS, and JavaScript

02 / WHICH PATTERN WHEN

Read the tell, name the pattern.

31 tells. The strip filters as you type.

31 ROWS

sorted array + targetbinary searchtwo pointersbinary-search.js

contiguous subarray / substringsliding windowprefix sumsliding-window.js

subarray sum equals k / count subarraysprefix sum + hash maphash-maps.js

top k / kth largest / kth smallestheap (size k)quickselectheaps.js

k-way merge / "k sorted lists"min-heap of headsheaps.js

running mediantwo heapsheaps.js

next greater / next smaller / spanmonotonic stackstacks-queues.js

sliding window max/minmonotonic dequesliding-window.js

shortest path, unweightedBFSgraphs.js

shortest path, weighted non-negativeDijkstragraphs.js

shortest path, negative edgesBellman-Fordgraphs.js

all combinations / permutations / subsetsbacktrackingbacktracking.js

count ways / min cost / max value, overlapping subproblemsdynamic programmingdynamic-programming.js

optimal substructure + greedy-choice worksgreedy (prove exchange argument)intervals.js

connected components / "union" / "same group"union-findDFSgraphs.js

dependencies / prerequisites / orderingtopological sortgraphs.js

prefix matching / autocomplete / many wordstrietries.js

intervals / meetings / overlapssort by start, then sweepintervals.js

max non-overlapping intervalssort by end, greedyintervals.js

linked list middle / cyclefast & slow pointerslinked-lists.js

in-place array of 1..ncyclic sortindex as hasharrays.js

duplicate in array of 1..n, O(1) spaceFloyd cycle on indicesarrays.js

majority elementBoyer-Moore votingarrays.js

matching brackets / nested structurestackstacks-queues.js

grid traversalBFSDFS with directions arraymatrices.js

multi-source spread (rotting, distance to nearest)multi-source BFSmatrices.js

minimize the maximum / "min capacity such that..."binary search on the answerbinary-search.js

XOR / parity / "appears once"bit manipulationbit-manipulation.js

n <= 20 and subsetsbitmask enumerationbit-manipulation.js

LRU / LFUMap insertion orderDLL + maphash-maps.js

string equality under rotation/patternKMPhashingstrings.js

Full table

03 / NAIVE VS OPTIMAL

Same tests. Two shapes.

Write a function called same, which accepts two arrays. The function should return true if every value in the array has its corresponding value squared in the second array. The frequency of values must be the same.

Naive · sameO(n²)

function same(arr1, arr2) {  if (arr1.length !== arr2.length) {    return false;  }   for (let i = 0; i < arr1.length; i++) {    let correctIndex = arr2.indexOf(arr1[i] ** 2);    if (correctIndex === -1) {      return false;    }    arr2.splice(correctIndex, 1);  }  return true;}function same(arr1, arr2) {
  if (arr1.length !== arr2.length) {
    return false;
  }

  for (let i = 0; i < arr1.length; i++) {
    let correctIndex = arr2.indexOf(arr1[i] ** 2);
    if (correctIndex === -1) {
      return false;
    }
    arr2.splice(correctIndex, 1);
  }
  return true;
}

Optimal · goodSameO(n)

function goodSame(arr1, arr2) {  if (arr1.length !== arr2.length) {    return false;  }  const fc1 = arr1.reduce((acc, item, idx) => {    if (acc[item]) {      acc[item]++;    } else {      acc[item] = 1;    }    return acc;  }, {});  const fc2 = arr2.reduce((acc, item, idx) => {    if (acc[item]) {      acc[item]++;    } else {      acc[item] = 1;    }    return acc;  }, {});   for (const key in fc1) {    if (fc1[key] !== fc2[parseInt(key, 10) ** 2]) {      return false;    }  }  return true;}function goodSame(arr1, arr2) {
  if (arr1.length !== arr2.length) {
    return false;
  }
  const fc1 = arr1.reduce((acc, item, idx) => {
    if (acc[item]) {
      acc[item]++;
    } else {
      acc[item] = 1;
    }
    return acc;
  }, {});
  const fc2 = arr2.reduce((acc, item, idx) => {
    if (acc[item]) {
      acc[item]++;
    } else {
      acc[item] = 1;
    }
    return acc;
  }, {});

  for (const key in fc1) {
    if (fc1[key] !== fc2[parseInt(key, 10) ** 2]) {
      return false;
    }
  }
  return true;
}

Why it is faster: `indexOf` inside the loop rescans the second array every time, so the work is n × n. Counting each array once into a frequency object makes every lookup O(1), so the work is two passes.

All four pairs

04 / LANGUAGES

Nine languages. Four frameworks. One path.

Five steps each, then four frontend guides.

JavaScriptbackend Pythonbackend Rubybackend Gobackend Javabackend C#backend PHPbackend Rustbackend Dartbackend Reactfrontend Vuefrontend Angularfrontend Sveltefrontend

You do not need to know everything. You need to know what you are talking about.

— The Ultimate Guide to Knowing What the Heck You're Talking About · Mindset
Read the guide

Learn for free. Work with me when you’re ready.
Optional $20 thank-you · Source reviews: $197 per started 1,000 lines · Portfolio reviews: $497

Support & work with me →