Medium data structure and algorithm practice puzzle.
Given a list of words, return a map from each pair of neighboring words to how many times that pair appears. Join each pair with a space, like "i love". Walk the list once, looking at each word and the one after it. n words give n - 1 pairs. Early language models were built on counts exactly like these.
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 Trip Cache Tier, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles