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
- #1easyvery frequently asked
1. Two Sum
Given an integer array and a target, return indices of the two numbers that add up to the target. Cohere asks this as a warm-up because hash-map lookup is the foundation of embedding deduplication and nearest-neighbor retrieval at scale.
- #283easyoccasionally asked
283. Move Zeroes
Move all zeroes to the end of an array while preserving the relative order of non-zero elements. Cohere asks this to test in-place two-pointer discipline — the same pattern used when compacting sparse token arrays in a batched inference engine.