Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
Self-Attention From Scratch
00:00
5 left

Self-Attention From Scratch

HardPython

Problem

AppFolio Property Manager may use attention-based models to represent sequences such as maintenance updates or resident communications. Implement a single self-attention layer from scratch using only the standard library.

Given token embeddings and projection matrices, compute queries, keys, and values, then return scaled dot-product attention outputs. Do not use NumPy, PyTorch, TensorFlow, or other numerical libraries.

Formal Specification

Implement self_attention(tokens, w_q, w_k, w_v, causal), where tokens is an n x d_model matrix and each projection matrix is d_model x d_head. Compute Q = tokens @ w_q, K = tokens @ w_k, and V = tokens @ w_v. For every token pair (i, j), compute:

score(i, j) = dot(Q[i], K[j]) / sqrt(d_head)

Apply a row-wise softmax to the scores. When causal is true, position i may attend only to positions j <= i. Return the resulting n x d_head matrix, where each output row is the weighted sum of value rows.

The softmax must be numerically stable by subtracting the row maximum before exponentiation.

Constraints

  • 1 <= len(tokens) <= 256
  • 1 <= len(tokens[0]) <= 64
  • 1 <= len(w_q[0]) = len(w_k[0]) = len(w_v[0]) <= 64
  • tokens has shape n x d_model
  • Each projection matrix has shape d_model x d_head
  • All input values are finite real numbers

Function Signature

def self_attention(tokens, w_q, w_k, w_v, causal):
Interviewer

Your question is Self-Attention From Scratch. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.
Code
Sign up free to run your codeLog inLn 2
Run your code to see test output here.