Fewest sum-replacement steps to reach a target arrayCodingLockedAn array of length n starts with every element equal to 1. One step picks one element and replaces it with the sum of the whole array.
Possibly retired
Cognition coding screen interview
Round 3 of 6 · 3 questions reported
- Format
- Live coding
- Heads-up
- Reported Codeium screens in 2024 were algorithm problems. A 2026 guide describes agent-shaped problems instead: parse a stream of tool-call output, recover state after a failed step, retry without applying a side effect twice.
Questions Cognition asks in this round 3
- Find where a sentence occurs in a document, with wildcardsCodingLockedGiven a document and a query sentence, return every position in the document where the sentence occurs. The query may contain wildcards, so a plain substring search is not enough.Possibly retired
- Find the duplicate numberCodingA list holds n + 1 integers, each between 1 and n, so at least one value appears more than once. Return a value that repeats. You may not modify the list and may use only constant…Possibly retired