Ilya Amursky

Latest

Dev weekly digest: Axios supply chain attack, Next.js Adapters, and Pretext goes viral

Dev weekly digest: Axios supply chain attack, Next.js Adapters, and Pretext goes viral

Axios npm package hit by a North Korea-linked supply chain attack, Next.js 16.2 ships a platform-agnostic Adapter API, Pretext rewrites text layout without the DOM, and the React Compiler gets a Rust port. Plus: TanStack Start RSC, Transformers.js v4, RedwoodSDK 1.0, and more.

AI weekly digest: Gemma 4 drops under Apache 2.0, Anthropic finds emotion vectors in Claude, and Axios gets hijacked

AI weekly digest: Gemma 4 drops under Apache 2.0, Anthropic finds emotion vectors in Claude, and Axios gets hijacked

Google ships Gemma 4 under Apache 2.0, Anthropic finds functional emotion vectors inside Claude, Axios gets hijacked by North Korean hackers, Claude Code source leaks via npm, and OpenAI's $122B raise meets shifting investor sentiment.

How I got 60 FPS in RDR2 on server hardware

How I got 60 FPS in RDR2 on server hardware

Intel Xeon and NVIDIA Quadro 24 GB. A dozen benchmark runs, one unexpected discovery, and RDR2 running at 60 FPS in 4K.

Programming problem: Min Stack

Programming problem: Min Stack

Maintain two stacks in parallel: one for values and one tracking the current minimum at each level. This makes `getMin` O(1) instead of scanning the full stack, and avoids rebuilding the array on every `pop`.

Programming problem: Valid Parentheses

Programming problem: Valid Parentheses

Push opening brackets onto a stack; for each closing bracket, check if it matches the top. If the stack is empty at the end, the string is valid. O(n) time versus the string-slicing approach, which rebuilds the string on every matched pair.

Programming problem: Baseball Game

Programming problem: Baseball Game

Use a stack to simulate the game: push scores for numbers, `D`, and `+`, pop for `C`. After processing all operations, sum the remaining stack. Straightforward O(n) simulation with no tricky edge cases.

Programming problem: Concatenation of Array

Programming problem: Concatenation of Array

Pre-allocate an array of double length, then fill both halves in a single pass — writing each element at index `i` and `i + n`. Runs in O(n) time with a clean, spread-free approach.