duoan/TorchCode

🔥 LeetCode for PyTorch — practice implementing softmax, attention, GPT-2 and more from scratch with instant auto-grading. Jupyter-based, self-hosted or try online.

Jupyter Notebook

4,677

41 commits

updated Jul 31, 2026

See the code

README


title: TorchCode emoji: 🔥 colorFrom: red colorTo: yellow sdk: docker app_port: 7860 pinned: false

🔥 TorchCode

Crack the PyTorch interview.

Practice implementing operators and architectures from scratch — the exact skills top ML teams test for.

An interactive coding platform, but for tensors. Self-hosted. Jupyter-based. Instant feedback.

PyTorch Jupyter Docker Python License: MIT

GitHub stars GitHub Container Registry Hugging Face Spaces Problems GPU

Star History Chart


🎯 Why TorchCode?

Top companies (Meta, Google DeepMind, OpenAI, etc.) expect ML engineers to implement core operations from memory on a whiteboard. Reading papers isn't enough — you need to write softmax, LayerNorm, MultiHeadAttention, and full Transformer blocks code.

TorchCode gives you a structured practice environment with:

Feature
🧩41 curated problemsThe most frequently asked PyTorch interview topics
⚖️Automated judgeCorrectness checks, gradient verification, and timing
🎨Instant feedbackColored pass/fail per test case, just like competitive programming
💡Hints when stuckNudges without full spoilers
📖Reference solutionsStudy optimal implementations after your attempt
📊Progress trackingWhat you've solved, best times, and attempt counts
🔄One-click resetToolbar button to reset any notebook back to its blank template — practice the same problem as many times as you want
Open In ColabOpen in ColabEvery notebook has an "Open in Colab" badge + toolbar button — run problems in Google Colab with zero setup

No cloud. No signup. No GPU needed. Just make run — or try it instantly on Hugging Face.


🚀 Quick Start

Option 0 — Try it online (zero install)

Launch on Hugging Face Spaces — opens a full JupyterLab environment in your browser. Nothing to install.

Or open any problem directly in Google Colab — every notebook has an Open In Colab badge.

Option 0b — Use the judge in Colab (pip)

In Google Colab, install the judge from PyPI so you can run check(...) without cloning the repo:

!pip install torch-judge

Then in a notebook cell:

from torch_judge import check, status, hint, reset_progress
status()           # list all problems and your progress
check("relu")      # run tests for the "relu" task
hint("relu")       # show a hint

Option 1 — Pull the pre-built image (fastest)

docker run -p 8888:8888 -e PORT=8888 ghcr.io/duoan/torchcode:latest

If the registry image is unavailable for your platform, use Option 2 instead. This is the common path on Apple Silicon / arm64.

Option 2 — Build locally

make run

make run will try the prebuilt image first and automatically fall back to a local build when needed.

Open http://localhost:8888 — that's it. Works with both Docker and Podman (auto-detected).

Option 3 — Standalone Web UI (Next.js + FastAPI)

For a modern, standalone coding experience with an integrated IDE and dual-pane layout:

  1. Start Backend (FastAPI):
    pip install -r api/requirements.txt
    python -m uvicorn api.main:app --port 8000 --reload
    
  2. Start Frontend (Next.js):
    cd web
    npm install
    npm run dev
    
  3. Open http://localhost:3000 in your browser.

TorchCode UI Preview


📋 Problem Set

Frequency: 🔥 = very likely in interviews, ⭐ = commonly asked, 💡 = emerging / differentiator

🧱 Fundamentals — "Implement X from scratch"

The bread and butter of ML coding interviews. You'll be asked to write these without torch.nn.

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
1ReLU Open In Colabrelu(x)Easy🔥Activation functions, element-wise ops
2Softmax Open In Colabmy_softmax(x, dim)Easy🔥Numerical stability, exp/log tricks
16Cross-Entropy Loss Open In Colabcross_entropy_loss(logits, targets)Easy🔥Log-softmax, logsumexp trick
17Dropout Open In ColabMyDropout (nn.Module)Easy🔥Train/eval mode, inverted scaling
18Embedding Open In ColabMyEmbedding (nn.Module)Easy🔥Lookup table, weight[indices]
19GELU Open In Colabmy_gelu(x)Easy⭐Gaussian error linear unit, torch.erf
20Kaiming Init Open In Colabkaiming_init(weight)Easy⭐std = sqrt(2/fan_in), variance scaling
21Gradient Clipping Open In Colabclip_grad_norm(params, max_norm)Easy⭐Norm-based clipping, direction preservation
31Gradient Accumulation Open In Colabaccumulated_step(model, opt, ...)Easy💡Micro-batching, loss scaling
40Linear Regression Open In ColabLinearRegression (3 methods)Medium🔥Normal equation, GD from scratch, nn.Linear
3Linear Layer Open In ColabSimpleLinear (nn.Module)Medium🔥y = xW^T + b, Kaiming init, nn.Parameter
4LayerNorm Open In Colabmy_layer_norm(x, γ, β)Medium🔥Normalization, running stats, affine transform
7BatchNorm Open In Colabmy_batch_norm(x, γ, β)Medium⭐Batch vs layer statistics, train/eval behavior
8RMSNorm Open In Colabrms_norm(x, weight)Medium⭐LLaMA-style norm, simpler than LayerNorm
15SwiGLU MLP Open In ColabSwiGLUMLP (nn.Module)Medium⭐Gated FFN, SiLU(gate) * up, LLaMA/Mistral-style
22Conv2d Open In Colabmy_conv2d(x, weight, ...)Medium🔥Convolution, unfold, stride/padding

🧠 Attention Mechanisms — The heart of modern ML interviews

If you're interviewing for any role touching LLMs or Transformers, expect at least one of these.

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
23Cross-Attention Open In ColabMultiHeadCrossAttention (nn.Module)Medium⭐Encoder-decoder, Q from decoder, K/V from encoder
5Scaled Dot-Product Attention Open In Colabscaled_dot_product_attention(Q, K, V)Hard🔥softmax(QK^T/√d_k)V, the foundation of everything
6Multi-Head Attention Open In ColabMultiHeadAttention (nn.Module)Hard🔥Parallel heads, split/concat, projection matrices
9Causal Self-Attention Open In Colabcausal_attention(Q, K, V)Hard🔥Autoregressive masking with -inf, GPT-style
10Grouped Query Attention Open In ColabGroupQueryAttention (nn.Module)Hard⭐GQA (LLaMA 2), KV sharing across heads
11Sliding Window Attention Open In Colabsliding_window_attention(Q, K, V, w)Hard⭐Mistral-style local attention, O(n·w) complexity
12Linear Attention Open In Colablinear_attention(Q, K, V)Hard💡Kernel trick, φ(Q)(φ(K)^TV), O(n·d²)
14KV Cache Attention Open In ColabKVCacheAttention (nn.Module)Hard🔥Incremental decoding, cache K/V, prefill vs decode
24RoPE Open In Colabapply_rope(q, k)Hard🔥Rotary position embedding, relative position via rotation
25Flash Attention Open In Colabflash_attention(Q, K, V, block_size)Hard💡Tiled attention, online softmax, memory-efficient

🏗️ Architecture & Adaptation — Put it all together

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
26LoRA Open In ColabLoRALinear (nn.Module)Medium⭐Low-rank adaptation, frozen base + BA update
27ViT Patch Embedding Open In ColabPatchEmbedding (nn.Module)Medium💡Image → patches → linear projection
13GPT-2 Block Open In ColabGPT2Block (nn.Module)Hard⭐Pre-norm, causal MHA + MLP (4x, GELU), residual connections
28Mixture of Experts Open In ColabMixtureOfExperts (nn.Module)Hard⭐Mixtral-style, top-k routing, expert MLPs

⚙️ Training & Optimization

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
29Adam Optimizer Open In ColabMyAdamMedium⭐Momentum + RMSProp, bias correction
30Cosine LR Scheduler Open In Colabcosine_lr_schedule(step, ...)Medium⭐Linear warmup + cosine annealing

🎯 Inference & Decoding

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
32Top-k / Top-p Sampling Open In Colabsample_top_k_top_p(logits, ...)Medium🔥Nucleus sampling, temperature scaling
33Beam Search Open In Colabbeam_search(log_prob_fn, ...)Medium🔥Hypothesis expansion, pruning, eos handling
34Speculative Decoding Open In Colabspeculative_decode(target, draft, ...)Hard💡Accept/reject, draft model acceleration

🔬 Advanced — Differentiators

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
35BPE Tokenizer Open In ColabSimpleBPEHard💡Byte-pair encoding, merge rules, subword splits
36INT8 Quantization Open In ColabInt8Linear (nn.Module)Hard💡Per-channel quantize, scale/zero-point, buffer vs param
37DPO Loss Open In Colabdpo_loss(chosen, rejected, ...)Hard💡Direct preference optimization, alignment training
38GRPO Loss Open In Colabgrpo_loss(logps, rewards, group_ids, eps)Hard💡Group relative policy optimization, RLAIF, within-group normalized advantages
39PPO Loss Open In Colabppo_loss(new_logps, old_logps, advantages, clip_ratio)Hard💡PPO clipped surrogate loss, policy gradient, trust region
41OPD Loss Open In Colabopd_loss(student_logits, teacher_logits, ...)Hard💡On-policy distillation, reverse KL, multi-teacher alignment

⚙️ How It Works

Each problem has two notebooks:

FilePurpose
01_relu.ipynb✏️ Blank template — write your code here
01_relu_solution.ipynb📖 Reference solution — check when stuck

Workflow

1. Open a blank notebook           →  Read the problem description
2. Implement your solution         →  Use only basic PyTorch ops
3. Debug freely                    →  print(x.shape), check gradients, etc.
4. Run the judge cell              →  check("relu")
5. See instant colored feedback    →  ✅ pass / ❌ fail per test case
6. Stuck? Get a nudge              →  hint("relu")
7. Review the reference solution   →  01_relu_solution.ipynb
8. Click 🔄 Reset in the toolbar  →  Blank slate — practice again!

In-Notebook API

from torch_judge import check, hint, status

check("relu")               # Judge your implementation
hint("causal_attention")    # Get a hint without full spoiler
status()                    # Progress dashboard — solved / attempted / todo

📅 Suggested Study Plan

Total: ~12–16 hours spread across 3–4 weeks. Perfect for interview prep on a deadline.

WeekFocusProblemsTime
1🧱 FoundationsReLU → Softmax → CE Loss → Dropout → Embedding → GELU → Linear → LayerNorm → BatchNorm → RMSNorm → SwiGLU MLP → Conv2d2–3 hrs
2🧠 Attention Deep DiveSDPA → MHA → Cross-Attn → Causal → GQA → KV Cache → Sliding Window → RoPE → Linear Attn → Flash Attn3–4 hrs
3🏗️ Architecture + TrainingGPT-2 Block → LoRA → MoE → ViT Patch → Adam → Cosine LR → Grad Clip → Grad Accumulation → Kaiming Init3–4 hrs
4🎯 Inference + AdvancedTop-k/p Sampling → Beam Search → Speculative Decoding → BPE → INT8 Quant → DPO Loss → GRPO Loss → PPO Loss → OPD Loss + speed run3–4 hrs

🏛️ Architecture

┌──────────────────────────────────────────┐
│           Docker / Podman Container      │
│                                          │
│  JupyterLab (:8888)                      │
│    ├── templates/  (reset on each run)   │
│    ├── solutions/  (reference impl)      │
│    ├── torch_judge/ (auto-grading)       │
│    ├── torchcode-labext (JLab plugin)    │
│    │     🔄 Reset — restore template     │
│    │     🔗 Colab — open in Colab        │
│    └── PyTorch (CPU), NumPy              │
│                                          │
│  Judge checks:                           │
│    ✓ Output correctness (allclose)       │
│    ✓ Gradient flow (autograd)            │
│    ✓ Shape consistency                   │
│    ✓ Edge cases & numerical stability    │
└──────────────────────────────────────────┘

Single container. Single port. No database. No frontend framework. No GPU.

🛠️ Commands

make run    # Build & start (http://localhost:8888)
make stop   # Stop the container
make clean  # Stop + remove volumes + reset all progress

🧩 Adding Your Own Problems

TorchCode uses auto-discovery — just drop a new file in torch_judge/tasks/:

TASK = {
    "id": "my_task",
    "title": "My Custom Problem",
    "difficulty": "medium",
    "function_name": "my_function",
    "hint": "Think about broadcasting...",
    "tests": [ ... ],
}

No registration needed. The judge picks it up automatically.


📦 Publishing torch-judge to PyPI (maintainers)

The judge is published as a separate package so Colab/users can pip install torch-judge without cloning the repo.

Automatic (GitHub Action)

Pushing to master after changing the package version triggers .github/workflows/pypi-publish.yml, which builds and uploads to PyPI. No git tag is required.

  1. Bump version in torch_judge/_version.py (e.g. __version__ = "0.1.1").
  2. Configure PyPI Trusted Publisher (one-time):
    • PyPI → Your project torch-judge → Publishing → Add a new pending publisher
    • Owner: duoan, Repository: TorchCode, Workflow: pypi-publish.yml, Environment: (leave empty)
    • Run the workflow once (push a version bump to master or Actions → Publish torch-judge to PyPI → Run workflow); PyPI will then link the publisher.
  3. Release: commit the version bump and git push origin master.

Alternatively, use an API token: add repository secret PYPI_API_TOKEN (value = pypi-... from PyPI) and set TWINE_USERNAME=__token__ and TWINE_PASSWORD from that secret in the workflow if you prefer not to use Trusted Publishing.

Manual

pip install build twine
python -m build
twine upload dist/*

Version is in torch_judge/_version.py; bump it before each release.


❓ FAQ

Do I need a GPU?
No. Everything runs on CPU. The problems test correctness and understanding, not throughput.
Can I keep my solutions between runs?
Blank templates reset on every make run so you practice from scratch. Save your work under a different filename if you want to keep it. You can also click the 🔄 Reset button in the notebook toolbar at any time to restore the blank template without restarting.
Can I use Google Colab instead?
Yes! Every notebook has an Open in Colab badge at the top. Click it to open the problem directly in Google Colab — no Docker or local setup needed. You can also use the Colab toolbar button inside JupyterLab.
How are solutions graded?
The judge runs your function against multiple test cases using torch.allclose for numerical correctness, verifies gradients flow properly via autograd, and checks edge cases specific to each operation.
Who is this for?
Anyone preparing for ML/AI engineering interviews at top tech companies, or anyone who wants to deeply understand how PyTorch operations work under the hood.

🤝 Contributors

Thanks to everyone who has contributed to TorchCode.

Auto-generated from the GitHub contributors graph with avatars and GitHub usernames.


Built for engineers who want to deeply understand what they build.

If this helped your interview prep, consider giving it a ⭐


☕ Buy Me a Coffee

Buy Me A Coffee

BMC QR Code

Scan to support

interview
leetcode
pytorch

duoan/TorchCode

🔥 LeetCode for PyTorch — practice implementing softmax, attention, GPT-2 and more from scratch with instant auto-grading. Jupyter-based, self-hosted or try online.

Jupyter Notebook

4,677

41 commits

updated Jul 31, 2026

See the code

README


title: TorchCode emoji: 🔥 colorFrom: red colorTo: yellow sdk: docker app_port: 7860 pinned: false

🔥 TorchCode

Crack the PyTorch interview.

Practice implementing operators and architectures from scratch — the exact skills top ML teams test for.

An interactive coding platform, but for tensors. Self-hosted. Jupyter-based. Instant feedback.

PyTorch Jupyter Docker Python License: MIT

GitHub stars GitHub Container Registry Hugging Face Spaces Problems GPU

Star History Chart


🎯 Why TorchCode?

Top companies (Meta, Google DeepMind, OpenAI, etc.) expect ML engineers to implement core operations from memory on a whiteboard. Reading papers isn't enough — you need to write softmax, LayerNorm, MultiHeadAttention, and full Transformer blocks code.

TorchCode gives you a structured practice environment with:

Feature
🧩41 curated problemsThe most frequently asked PyTorch interview topics
⚖️Automated judgeCorrectness checks, gradient verification, and timing
🎨Instant feedbackColored pass/fail per test case, just like competitive programming
💡Hints when stuckNudges without full spoilers
📖Reference solutionsStudy optimal implementations after your attempt
📊Progress trackingWhat you've solved, best times, and attempt counts
🔄One-click resetToolbar button to reset any notebook back to its blank template — practice the same problem as many times as you want
Open In ColabOpen in ColabEvery notebook has an "Open in Colab" badge + toolbar button — run problems in Google Colab with zero setup

No cloud. No signup. No GPU needed. Just make run — or try it instantly on Hugging Face.


🚀 Quick Start

Option 0 — Try it online (zero install)

Launch on Hugging Face Spaces — opens a full JupyterLab environment in your browser. Nothing to install.

Or open any problem directly in Google Colab — every notebook has an Open In Colab badge.

Option 0b — Use the judge in Colab (pip)

In Google Colab, install the judge from PyPI so you can run check(...) without cloning the repo:

!pip install torch-judge

Then in a notebook cell:

from torch_judge import check, status, hint, reset_progress
status()           # list all problems and your progress
check("relu")      # run tests for the "relu" task
hint("relu")       # show a hint

Option 1 — Pull the pre-built image (fastest)

docker run -p 8888:8888 -e PORT=8888 ghcr.io/duoan/torchcode:latest

If the registry image is unavailable for your platform, use Option 2 instead. This is the common path on Apple Silicon / arm64.

Option 2 — Build locally

make run

make run will try the prebuilt image first and automatically fall back to a local build when needed.

Open http://localhost:8888 — that's it. Works with both Docker and Podman (auto-detected).

Option 3 — Standalone Web UI (Next.js + FastAPI)

For a modern, standalone coding experience with an integrated IDE and dual-pane layout:

  1. Start Backend (FastAPI):
    pip install -r api/requirements.txt
    python -m uvicorn api.main:app --port 8000 --reload
    
  2. Start Frontend (Next.js):
    cd web
    npm install
    npm run dev
    
  3. Open http://localhost:3000 in your browser.

TorchCode UI Preview


📋 Problem Set

Frequency: 🔥 = very likely in interviews, ⭐ = commonly asked, 💡 = emerging / differentiator

🧱 Fundamentals — "Implement X from scratch"

The bread and butter of ML coding interviews. You'll be asked to write these without torch.nn.

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
1ReLU Open In Colabrelu(x)Easy🔥Activation functions, element-wise ops
2Softmax Open In Colabmy_softmax(x, dim)Easy🔥Numerical stability, exp/log tricks
16Cross-Entropy Loss Open In Colabcross_entropy_loss(logits, targets)Easy🔥Log-softmax, logsumexp trick
17Dropout Open In ColabMyDropout (nn.Module)Easy🔥Train/eval mode, inverted scaling
18Embedding Open In ColabMyEmbedding (nn.Module)Easy🔥Lookup table, weight[indices]
19GELU Open In Colabmy_gelu(x)Easy⭐Gaussian error linear unit, torch.erf
20Kaiming Init Open In Colabkaiming_init(weight)Easy⭐std = sqrt(2/fan_in), variance scaling
21Gradient Clipping Open In Colabclip_grad_norm(params, max_norm)Easy⭐Norm-based clipping, direction preservation
31Gradient Accumulation Open In Colabaccumulated_step(model, opt, ...)Easy💡Micro-batching, loss scaling
40Linear Regression Open In ColabLinearRegression (3 methods)Medium🔥Normal equation, GD from scratch, nn.Linear
3Linear Layer Open In ColabSimpleLinear (nn.Module)Medium🔥y = xW^T + b, Kaiming init, nn.Parameter
4LayerNorm Open In Colabmy_layer_norm(x, γ, β)Medium🔥Normalization, running stats, affine transform
7BatchNorm Open In Colabmy_batch_norm(x, γ, β)Medium⭐Batch vs layer statistics, train/eval behavior
8RMSNorm Open In Colabrms_norm(x, weight)Medium⭐LLaMA-style norm, simpler than LayerNorm
15SwiGLU MLP Open In ColabSwiGLUMLP (nn.Module)Medium⭐Gated FFN, SiLU(gate) * up, LLaMA/Mistral-style
22Conv2d Open In Colabmy_conv2d(x, weight, ...)Medium🔥Convolution, unfold, stride/padding

🧠 Attention Mechanisms — The heart of modern ML interviews

If you're interviewing for any role touching LLMs or Transformers, expect at least one of these.

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
23Cross-Attention Open In ColabMultiHeadCrossAttention (nn.Module)Medium⭐Encoder-decoder, Q from decoder, K/V from encoder
5Scaled Dot-Product Attention Open In Colabscaled_dot_product_attention(Q, K, V)Hard🔥softmax(QK^T/√d_k)V, the foundation of everything
6Multi-Head Attention Open In ColabMultiHeadAttention (nn.Module)Hard🔥Parallel heads, split/concat, projection matrices
9Causal Self-Attention Open In Colabcausal_attention(Q, K, V)Hard🔥Autoregressive masking with -inf, GPT-style
10Grouped Query Attention Open In ColabGroupQueryAttention (nn.Module)Hard⭐GQA (LLaMA 2), KV sharing across heads
11Sliding Window Attention Open In Colabsliding_window_attention(Q, K, V, w)Hard⭐Mistral-style local attention, O(n·w) complexity
12Linear Attention Open In Colablinear_attention(Q, K, V)Hard💡Kernel trick, φ(Q)(φ(K)^TV), O(n·d²)
14KV Cache Attention Open In ColabKVCacheAttention (nn.Module)Hard🔥Incremental decoding, cache K/V, prefill vs decode
24RoPE Open In Colabapply_rope(q, k)Hard🔥Rotary position embedding, relative position via rotation
25Flash Attention Open In Colabflash_attention(Q, K, V, block_size)Hard💡Tiled attention, online softmax, memory-efficient

🏗️ Architecture & Adaptation — Put it all together

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
26LoRA Open In ColabLoRALinear (nn.Module)Medium⭐Low-rank adaptation, frozen base + BA update
27ViT Patch Embedding Open In ColabPatchEmbedding (nn.Module)Medium💡Image → patches → linear projection
13GPT-2 Block Open In ColabGPT2Block (nn.Module)Hard⭐Pre-norm, causal MHA + MLP (4x, GELU), residual connections
28Mixture of Experts Open In ColabMixtureOfExperts (nn.Module)Hard⭐Mixtral-style, top-k routing, expert MLPs

⚙️ Training & Optimization

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
29Adam Optimizer Open In ColabMyAdamMedium⭐Momentum + RMSProp, bias correction
30Cosine LR Scheduler Open In Colabcosine_lr_schedule(step, ...)Medium⭐Linear warmup + cosine annealing

🎯 Inference & Decoding

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
32Top-k / Top-p Sampling Open In Colabsample_top_k_top_p(logits, ...)Medium🔥Nucleus sampling, temperature scaling
33Beam Search Open In Colabbeam_search(log_prob_fn, ...)Medium🔥Hypothesis expansion, pruning, eos handling
34Speculative Decoding Open In Colabspeculative_decode(target, draft, ...)Hard💡Accept/reject, draft model acceleration

🔬 Advanced — Differentiators

#ProblemWhat You'll ImplementDifficultyFreqKey Concepts
35BPE Tokenizer Open In ColabSimpleBPEHard💡Byte-pair encoding, merge rules, subword splits
36INT8 Quantization Open In ColabInt8Linear (nn.Module)Hard💡Per-channel quantize, scale/zero-point, buffer vs param
37DPO Loss Open In Colabdpo_loss(chosen, rejected, ...)Hard💡Direct preference optimization, alignment training
38GRPO Loss Open In Colabgrpo_loss(logps, rewards, group_ids, eps)Hard💡Group relative policy optimization, RLAIF, within-group normalized advantages
39PPO Loss Open In Colabppo_loss(new_logps, old_logps, advantages, clip_ratio)Hard💡PPO clipped surrogate loss, policy gradient, trust region
41OPD Loss Open In Colabopd_loss(student_logits, teacher_logits, ...)Hard💡On-policy distillation, reverse KL, multi-teacher alignment

⚙️ How It Works

Each problem has two notebooks:

FilePurpose
01_relu.ipynb✏️ Blank template — write your code here
01_relu_solution.ipynb📖 Reference solution — check when stuck

Workflow

1. Open a blank notebook           →  Read the problem description
2. Implement your solution         →  Use only basic PyTorch ops
3. Debug freely                    →  print(x.shape), check gradients, etc.
4. Run the judge cell              →  check("relu")
5. See instant colored feedback    →  ✅ pass / ❌ fail per test case
6. Stuck? Get a nudge              →  hint("relu")
7. Review the reference solution   →  01_relu_solution.ipynb
8. Click 🔄 Reset in the toolbar  →  Blank slate — practice again!

In-Notebook API

from torch_judge import check, hint, status

check("relu")               # Judge your implementation
hint("causal_attention")    # Get a hint without full spoiler
status()                    # Progress dashboard — solved / attempted / todo

📅 Suggested Study Plan

Total: ~12–16 hours spread across 3–4 weeks. Perfect for interview prep on a deadline.

WeekFocusProblemsTime
1🧱 FoundationsReLU → Softmax → CE Loss → Dropout → Embedding → GELU → Linear → LayerNorm → BatchNorm → RMSNorm → SwiGLU MLP → Conv2d2–3 hrs
2🧠 Attention Deep DiveSDPA → MHA → Cross-Attn → Causal → GQA → KV Cache → Sliding Window → RoPE → Linear Attn → Flash Attn3–4 hrs
3🏗️ Architecture + TrainingGPT-2 Block → LoRA → MoE → ViT Patch → Adam → Cosine LR → Grad Clip → Grad Accumulation → Kaiming Init3–4 hrs
4🎯 Inference + AdvancedTop-k/p Sampling → Beam Search → Speculative Decoding → BPE → INT8 Quant → DPO Loss → GRPO Loss → PPO Loss → OPD Loss + speed run3–4 hrs

🏛️ Architecture

┌──────────────────────────────────────────┐
│           Docker / Podman Container      │
│                                          │
│  JupyterLab (:8888)                      │
│    ├── templates/  (reset on each run)   │
│    ├── solutions/  (reference impl)      │
│    ├── torch_judge/ (auto-grading)       │
│    ├── torchcode-labext (JLab plugin)    │
│    │     🔄 Reset — restore template     │
│    │     🔗 Colab — open in Colab        │
│    └── PyTorch (CPU), NumPy              │
│                                          │
│  Judge checks:                           │
│    ✓ Output correctness (allclose)       │
│    ✓ Gradient flow (autograd)            │
│    ✓ Shape consistency                   │
│    ✓ Edge cases & numerical stability    │
└──────────────────────────────────────────┘

Single container. Single port. No database. No frontend framework. No GPU.

🛠️ Commands

make run    # Build & start (http://localhost:8888)
make stop   # Stop the container
make clean  # Stop + remove volumes + reset all progress

🧩 Adding Your Own Problems

TorchCode uses auto-discovery — just drop a new file in torch_judge/tasks/:

TASK = {
    "id": "my_task",
    "title": "My Custom Problem",
    "difficulty": "medium",
    "function_name": "my_function",
    "hint": "Think about broadcasting...",
    "tests": [ ... ],
}

No registration needed. The judge picks it up automatically.


📦 Publishing torch-judge to PyPI (maintainers)

The judge is published as a separate package so Colab/users can pip install torch-judge without cloning the repo.

Automatic (GitHub Action)

Pushing to master after changing the package version triggers .github/workflows/pypi-publish.yml, which builds and uploads to PyPI. No git tag is required.

  1. Bump version in torch_judge/_version.py (e.g. __version__ = "0.1.1").
  2. Configure PyPI Trusted Publisher (one-time):
    • PyPI → Your project torch-judge → Publishing → Add a new pending publisher
    • Owner: duoan, Repository: TorchCode, Workflow: pypi-publish.yml, Environment: (leave empty)
    • Run the workflow once (push a version bump to master or Actions → Publish torch-judge to PyPI → Run workflow); PyPI will then link the publisher.
  3. Release: commit the version bump and git push origin master.

Alternatively, use an API token: add repository secret PYPI_API_TOKEN (value = pypi-... from PyPI) and set TWINE_USERNAME=__token__ and TWINE_PASSWORD from that secret in the workflow if you prefer not to use Trusted Publishing.

Manual

pip install build twine
python -m build
twine upload dist/*

Version is in torch_judge/_version.py; bump it before each release.


❓ FAQ

Do I need a GPU?
No. Everything runs on CPU. The problems test correctness and understanding, not throughput.
Can I keep my solutions between runs?
Blank templates reset on every make run so you practice from scratch. Save your work under a different filename if you want to keep it. You can also click the 🔄 Reset button in the notebook toolbar at any time to restore the blank template without restarting.
Can I use Google Colab instead?
Yes! Every notebook has an Open in Colab badge at the top. Click it to open the problem directly in Google Colab — no Docker or local setup needed. You can also use the Colab toolbar button inside JupyterLab.
How are solutions graded?
The judge runs your function against multiple test cases using torch.allclose for numerical correctness, verifies gradients flow properly via autograd, and checks edge cases specific to each operation.
Who is this for?
Anyone preparing for ML/AI engineering interviews at top tech companies, or anyone who wants to deeply understand how PyTorch operations work under the hood.

🤝 Contributors

Thanks to everyone who has contributed to TorchCode.

Auto-generated from the GitHub contributors graph with avatars and GitHub usernames.


Built for engineers who want to deeply understand what they build.

If this helped your interview prep, consider giving it a ⭐


☕ Buy Me a Coffee

Buy Me A Coffee

BMC QR Code

Scan to support

interview
leetcode
pytorch

Significant stargazers

(top 24 of 31)

Zehuan Huang

296 followers · starred Mar 2026

Zhikang Niu-SII

439 followers · starred Mar 2026

Christopher Fleetwood

340 followers · starred Mar 2026

Anindyadeep

215 followers · starred Mar 2026