Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. 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.

9 Easy
37 Medium
2 Hard

Top Topics at Thomson Reuters

ArrayHash TableStringSortingDynamic Programming

Ace your Thomson Reuters interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Thomson Reuters Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Clone Graph
100%
MediumM
100%
Hash TableDepth-First Search+2
Solve→
Find Peak Element
97%
MediumM
97%
ArrayBinary Search
Solve→
Permutations
95%
MediumM
95%
ArrayBacktracking
Solve→
Goat Latin
93%
EasyE
93%
String
Solve→
Design an Ordered Stream
84%
EasyE
84%
ArrayHash Table+2
Solve→
Take Gifts From the Richest Pile
83%
EasyE
83%
ArrayHeap (Priority Queue)+1
Solve→
Valid Sudoku
82%
MediumM
82%
ArrayHash Table+1
Solve→
Asteroid Collision
80%
MediumM
80%
ArrayStack+1
Solve→
Max Consecutive Ones III
80%
MediumM
80%
ArrayBinary Search+2
Solve→
Best Time to Buy and Sell Stock II
76%
MediumM
76%
ArrayDynamic Programming+1
Solve→
Interval List Intersections
76%
MediumM
76%
ArrayTwo Pointers
Solve→
Fraction to Recurring Decimal
75%
MediumM
75%
Hash TableMath+1
Solve→
Two Sum II - Input Array Is Sorted
75%
MediumM
75%
ArrayTwo Pointers+1
Solve→
Koko Eating Bananas
74%
MediumM
74%
ArrayBinary Search
Solve→
Can Place Flowers
73%
EasyE
73%
ArrayGreedy
Solve→
Valid Anagram
73%
EasyE
73%
Hash TableString+1
Solve→
Longest Substring Without Repeating Characters
72%
MediumM
72%
Hash TableString+1
Solve→
Invalid Transactions
72%
MediumM
72%
ArrayHash Table+2
Solve→
Rank Teams by Votes
68%
MediumM
68%
ArrayHash Table+3
Solve→
Remove All Adjacent Duplicates in String II
67%
MediumM
67%
StringStack
Solve→
Generate Parentheses
65%
MediumM
65%
StringDynamic Programming+1
Solve→
Jump Game
65%
MediumM
65%
ArrayDynamic Programming+1
Solve→
Buildings With an Ocean View
61%
MediumM
61%
ArrayStack+1
Solve→
Daily Temperatures
60%
MediumM
60%
ArrayStack+1
Solve→
Maximum Sum of Distinct Subarrays With Length K
56%
MediumM
56%
ArrayHash Table+1
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Open the Lock
54%
MediumM
54%
ArrayHash Table+2
Solve→
Continuous Subarrays
52%
MediumM
52%
ArrayQueue+4
Solve→
The kth Factor of n
51%
MediumM
51%
MathNumber Theory
Solve→
Convert Sorted List to Binary Search Tree
51%
MediumM
51%
Linked ListDivide and Conquer+3
Solve→
Maximum Area Rectangle With Point Constraints I
50%
MediumM
50%
ArrayMath+5
Solve→
Sort Integers by The Power Value
50%
MediumM
50%
Dynamic ProgrammingMemoization+1
Solve→
Length of Last Word
48%
EasyE
48%
String
Solve→
Find Median from Data Stream
48%
HardH
48%
Two PointersDesign+3
Solve→
Check Completeness of a Binary Tree
47%
MediumM
47%
TreeBreadth-First Search+1
Solve→
Coin Change II
45%
MediumM
45%
ArrayDynamic Programming
Solve→
Palindrome Linked List
45%
EasyE
45%
Linked ListTwo Pointers+2
Solve→
Maximum Size Subarray Sum Equals k
45%
MediumM
45%
ArrayHash Table+1
Solve→
K-diff Pairs in an Array
40%
MediumM
40%
ArrayHash Table+3
Solve→
Frequency of the Most Frequent Element
40%
MediumM
40%
ArrayBinary Search+4
Solve→
Maximum Subarray
36%
MediumM
36%
ArrayDivide and Conquer+1
Solve→
Sum Root to Leaf Numbers
31%
MediumM
31%
TreeDepth-First Search+1
Solve→
Minimum Area Rectangle
26%
MediumM
26%
ArrayHash Table+3
Solve→
Insert Delete GetRandom O(1) - Duplicates allowed
26%
HardH
26%
ArrayHash Table+3
Solve→
Construct Quad Tree
25%
MediumM
25%
ArrayDivide and Conquer+2
Solve→
Adding Spaces to a String
25%
MediumM
25%
ArrayTwo Pointers+2
Solve→
Best Time to Buy and Sell Stock
24%
EasyE
24%
ArrayDynamic Programming
Solve→
Valid Parentheses
23%
EasyE
23%
StringStack
Solve→
Jump Game II
20%
MediumM
20%
ArrayDynamic Programming+1
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

Alcon
48 problems
Anaplan
48 problems
Ansys
48 problems
Axon
48 problems
Cadence Design Systems
48 problems
Chamberlain Group
48 problems

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 Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.