Thomson Reuters coding interview
questions, leaked.
3 problems reported across recent Thomson Reuters interviews. Top patterns: string, sliding window, greedy. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Thomson Reuters asks fewer problems but hits harder on string manipulation and pattern recognition. With only 3 reported problems across easy and medium difficulty, the bar is narrow: you need to nail the patterns they care about. String problems dominate the dataset, appearing in all three known questions. If you blank on a sliding-window or greedy string problem during their assessment, StealthCoder surfaces a working solution in seconds, invisible to the proctor. You're not here to grind 200 problems. You're here to be ready for the three patterns they actually test.
Top problems at Thomson Reuters
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Substring Of All Vowels in Order | MEDIUM | 100.0 | 51% | String · Sliding Window |
| 02 | Minimum Time to Type Word Using Special Typewriter | EASY | 98.1 | 78% | String · Greedy |
| 03 | Roman to Integer | EASY | 65.3 | 65% | Hash Table · Math · String |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Thomson Reuters OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- string3 · 100%
- sliding window1 · 33%
- greedy1 · 33%
- hash table1 · 33%
- math1 · 33%
String algorithms own this interview. Every single problem involves string manipulation, which means the company is filtering for candidates who think in terms of character sequences, indices, and order. Sliding window and greedy both appear once, but they're embedded in string contexts: one problem requires you to track vowel ordering with a sliding window, another uses greedy logic to minimize keystrokes on a typewriter. Hash tables and math show up in Roman numeral conversion, a classic pattern-matching problem. The easy-heavy distribution (2 easy, 1 medium, 0 hard) suggests they're not testing brute-force grinding or deep algorithm knowledge. They're testing whether you can implement efficient string traversal cleanly. If you practice Longest Substring, Minimum Time, and Roman to Integer, you've seen their core moves. StealthCoder is the hedge for whatever gotcha edge case you missed during prep.
Companies with similar patterns
If you prepped for Thomson Reuters, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Thomson Reuters.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Thomson Reuters interview FAQ
Should I focus on sliding window or greedy first for Thomson Reuters?+
String problems appear in 100% of reported questions here. Master sliding-window string logic first (Longest Substring), then greedy optimization (Minimum Time). Both are string-focused, not general algorithmic patterns. Roman to Integer grounds you in hash-table lookups within strings. Start with string fundamentals.
Is easy-difficulty prep enough for this company?+
Two of three problems are easy, one is medium. That's not weakness in their bar, it's their bar. Easy problems can have tricky edge cases (vowel order, typewriter positions). Drill the three known problems deeply rather than grinding 50 problems. Quality over quantity works here.
What if I can't solve the sliding-window problem live?+
The sliding-window problem requires tracking vowels in order within a substring. If you blank on the index-jumping logic mid-assessment, you're stuck. That's where StealthCoder helps: it reads your problem, solves it invisibly, and you move on without the proctor knowing.
Do I need to memorize Roman numeral rules?+
Yes. Roman to Integer tests whether you understand subtractive notation (IV, IX, etc.) and can build a hash-table lookup fast. It's a pattern problem, not a math problem. Memorize the four subtractive cases and practice the hash-table approach once.
How much time should I spend on each problem?+
All three problems are tight implementations. Longest Substring needs clean two-pointer logic. Minimum Time is a character-position problem. Roman to Integer is a straightforward lookup. Spend 30 minutes on each, code it twice, then move to test-case edge cases.