Easy data structure and algorithm practice puzzle.
Given an embedding table with one row per token, and a list of token IDs, return the row for each ID, in order. Just look each one up. It gives the same answer as multiplying a one-hot vector by the table, but it skips all the math, which is why embedding layers are fast.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Sample Anomaly Watch, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles