Cohere Coding Interview Questions
25 Cohere coding interview problems with full optimal solutions — 8 easy, 12 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Cohere interviewer values, and a FAQ section.
Showing 2 problems of 25
- #3mediumvery frequently asked
3. Longest Substring Without Repeating Characters
Find the length of the longest substring with all unique characters. Cohere asks this because sliding-window deduplication is core to tokenization span selection and context-window management in production language-model serving.
- #146mediumvery frequently asked
146. LRU Cache
Design a cache that evicts the least-recently-used entry when full. Cohere asks this because LRU caching is a first-class concern in embedding serving — caching recently-requested embedding vectors avoids redundant inference and reduces GPU cost at scale.