This week's challenge comes from listener Al Gori, of Cozy Lake, N.J. Take the name JON STEWART, as in the comedian and TV host. Rearrange the letters to spell the titles of three classic movies. One of the titles is its familiar shortened form.
Let's break this down. Here's what we need:
- M: A list of "classic movies" to iterate through
- Find a list online
- Build a list ourselves
- Ask an LLM for a list
- I extracted a list of all the titles from this spreadsheet of every Oscar winner and nominee
- (We don't know for certain that the movies in the solution are Oscar winners or nominees, but it's a fairly safe bet and a good place to start.)
- fx(M): We need a function that can generate combinations of three movie titles from our list, such that:
- the total length of all 3 movie titles is 10 letters (len('jonstewart'))
- we can use this as a first filter
- then we check that the letters in the combined movie titles are the same as the letters in 'jonstewart'
Clearly, this puzzle is on the easier side, with minimal NLP required. The critical piece here is the starting list of movies. I have my solution, and I'll be back after the Thursday NPR deadline to share it along with my script. In the meantime, if you'd like to try this yourself, you can start from my list of about 3700 Oscar winners and nominees.
Update & Solution
The deadline for submissions has passed, so click the spoiler button below if you want to see my answer. Click here for my python script on GitHub. See you next week!
No comments:
Post a Comment