- Interview Questions
- /
- Thomson Reuters
Thomson Reuters LeetCode Interview Questions
Practice 48 real coding problems frequently asked in Thomson Reuters technical interviews. Master these questions to ace your next Thomson Reuters software engineering interview.
Top Topics at Thomson Reuters
Ace your Thomson Reuters interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Thomson Reuters Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Clone Graph 100% | MediumM | Solve→ |
Find Peak Element 97% | MediumM | Solve→ |
Permutations 95% | MediumM | Solve→ |
Goat Latin 93% | EasyE | Solve→ |
Design an Ordered Stream 84% | EasyE | Solve→ |
Take Gifts From the Richest Pile 83% | EasyE | Solve→ |
Valid Sudoku 82% | MediumM | Solve→ |
Asteroid Collision 80% | MediumM | Solve→ |
Max Consecutive Ones III 80% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 76% | MediumM | Solve→ |
Interval List Intersections 76% | MediumM | Solve→ |
Fraction to Recurring Decimal 75% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 75% | MediumM | Solve→ |
Koko Eating Bananas 74% | MediumM | Solve→ |
Can Place Flowers 73% | EasyE | Solve→ |
Valid Anagram 73% | EasyE | Solve→ |
Longest Substring Without Repeating Characters 72% | MediumM | Solve→ |
Invalid Transactions 72% | MediumM | Solve→ |
Rank Teams by Votes 68% | MediumM | Solve→ |
Remove All Adjacent Duplicates in String II 67% | MediumM | Solve→ |
Generate Parentheses 65% | MediumM | Solve→ |
Jump Game 65% | MediumM | Solve→ |
Buildings With an Ocean View 61% | MediumM | Solve→ |
Daily Temperatures 60% | MediumM | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 56% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Open the Lock 54% | MediumM | Solve→ |
Continuous Subarrays 52% | MediumM | Solve→ |
The kth Factor of n 51% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 51% | MediumM | Solve→ |
Maximum Area Rectangle With Point Constraints I 50% | MediumM | Solve→ |
Sort Integers by The Power Value 50% | MediumM | Solve→ |
Length of Last Word 48% | EasyE | Solve→ |
Find Median from Data Stream 48% | HardH | Solve→ |
Check Completeness of a Binary Tree 47% | MediumM | Solve→ |
Coin Change II 45% | MediumM | Solve→ |
Palindrome Linked List 45% | EasyE | Solve→ |
Maximum Size Subarray Sum Equals k 45% | MediumM | Solve→ |
K-diff Pairs in an Array 40% | MediumM | Solve→ |
Frequency of the Most Frequent Element 40% | MediumM | Solve→ |
Maximum Subarray 36% | MediumM | Solve→ |
Sum Root to Leaf Numbers 31% | MediumM | Solve→ |
Minimum Area Rectangle 26% | MediumM | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 26% | HardH | Solve→ |
Construct Quad Tree 25% | MediumM | Solve→ |
Adding Spaces to a String 25% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 24% | EasyE | Solve→ |
Valid Parentheses 23% | EasyE | Solve→ |
Jump Game II 20% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Thomson Reuters ask in interviews?
Thomson Reuters commonly asks 48 coding problems in technical interviews, including Clone Graph, Find Peak Element, Permutations. The difficulty breakdown is 9 Easy, 37 Medium, and 2 Hard problems.
How should I prepare for a Thomson Reuters coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Thomson Reuters interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Thomson Reuters coding interviews?
Based on our data, Thomson Reuters interviews include 9 Easy (19%), 37 Medium (77%), and 2 Hard (4%) problems.
Ready to ace your Thomson Reuters interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required