As a Software Engineer at T. Rowe Price, you will play a critical role in bridging the gap between cutting-edge technology and global asset management. The firm relies heavily on its engineering organization to build, scale, and maintain the complex financial platforms that manage trillions of dollars in assets. You will be responsible for developing high-performance, secure, and resilient systems that support investment research, portfolio management, trading operations, and client-facing digital experiences. The impact of this role is immense, as the software you write directly influences the financial well-being of millions of individual investors and institutional clients worldwide. Whether you are modernizing legacy enterprise systems, migrating critical infrastructure to the cloud, or designing real-time data pipelines, your work will directly contribute to the firm's strategic growth. You will collaborate closely with product managers, quantitative analysts, and other engineering teams to solve complex problems at scale. T. Rowe Price offers a unique engineering culture that combines the stability and resources of a premier financial institution with the modern technical challenges of a software-driven enterprise. Engineers are encouraged to take ownership of their projects, drive architectural decisions, and continuously adopt modern tools and practices.
Initial Screening Call
reportedA call with a recruiter to evaluate your background and discuss the role.
What to demonstrate
- A call with a recruiter to evaluate your background and discuss the role
- Depth in Coding Interviews
How to prepare
- Be able to walk your CV end to end in two minutes, and say why this company specifically.
- Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.
Preliminary Technical Assessment
reportedA technical assessment or pre-recorded behavioral video interview to assess your skills.
What to demonstrate
- A technical assessment or pre-recorded behavioral video interview to assess your skills
- Depth in Coding Interviews
How to prepare
- Answer aloud and timed: Implement a solution to detect duplicate records in a large dataset and optimize it for space complexity.
- Answer aloud and timed: How would you implement a basic queue or stack from scratch, and what are the time complexities of its primary operations?
Intensive Technical Rounds
reportedLive coding, system architecture discussions, and deep-dives into your professional background.
What to demonstrate
- Live coding, system architecture discussions, and deep-dives into your professional background
- Depth in Coding Interviews
How to prepare
- Answer aloud and timed: Solve a multi-part coding challenge where each step progressively increases in algorithmic complexity (e.g., moving from a basic search to an optimized sorting or filtering mechanism).
- Answer aloud and timed: How would you design the system or application you worked on in your previous role? What were the bottlenecks, and how did you resolve them?
Team Fit Evaluation
reportedFocus on team fit, management alignment, and your overall approach to software engineering.
What to demonstrate
- Focus on team fit, management alignment, and your overall approach to software engineering
- Depth in Coding Interviews
How to prepare
- Prepare two projects you led end to end, each with the decision you owned and what it cost.
- Have three questions about the team's roadmap and how success is measured in the first six months.
Final Hiring Decision
reportedThe final decision regarding your candidacy based on the previous evaluations.
What to demonstrate
- The final decision regarding your candidacy based on the previous evaluations
- Depth in Coding Interviews
How to prepare
- Answer aloud and timed: How do you approach database selection (SQL vs. NoSQL) when designing a system that requires both high-speed reads and strict transactional consistency?
- Answer aloud and timed: Describe how you would implement a caching layer to improve the latency of a frequently accessed data service.
PracHub editorial advice for the preparation topics above.
Master the fundamentals
Do not neglect core computer science concepts. Be ready to discuss data structures, time complexity, and basic design patterns in detail, as these form the foundation of the technical evaluation.
Review your resume thoroughly
Be prepared to discuss any project, technology, or methodology listed on your resume. Interviewers will ask detailed questions about your past experiences and your specific contributions to those projects.
Practice active communication
During live coding and system design rounds, explain your reasoning, state your assumptions, and ask clarifying questions. This demonstrates your collaborative skills and helps keep you aligned with the interviewer's expectations.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Write a function to reverse a string or manipulate an array without using built-in high-level library function
Write a function to reverse a string or manipulate an array without using built-in high-level library functions.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Given a list of financial transactions, find the peak transaction volume within a specific time window.
Given a list of financial transactions, find the peak transaction volume within a specific time window.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Implement a solution to detect duplicate records in a large dataset and optimize it for space complexity.
Implement a solution to detect duplicate records in a large dataset and optimize it for space complexity.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
How would you implement a basic queue or stack from scratch, and what are the time complexities of its primary
How would you implement a basic queue or stack from scratch, and what are the time complexities of its primary operations?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Solve a multi-part coding challenge where each step progressively increases in algorithmic complexity (e.g., m
Solve a multi-part coding challenge where each step progressively increases in algorithmic complexity (e.g., moving from a basic search to an optimized sorting or filtering mechanism).
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
How does memory management or garbage collection work in your primary programming language (e.g., Java or Pyth
How does memory management or garbage collection work in your primary programming language (e.g., Java or Python)?
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
What is the difference between synchronous and asynchronous execution, and how do you handle concurrency issue
What is the difference between synchronous and asynchronous execution, and how do you handle concurrency issues?
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
How do you approach database selection (SQL vs. NoSQL) when designing a system that requires both high-speed r
How do you approach database selection (SQL vs. NoSQL) when designing a system that requires both high-speed reads and strict transactional consistency?
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- Handle the rows that do not match: that is usually the actual question.
Follow-up
- How does the query change if that join becomes one-to-many?
- What happens to this when the table is ten times larger?
Stop tag and share joins from fanning out a page
resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.
Approach
- Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
- Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
- Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
- Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.
Follow-up
- The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
- A resource can be shared with the same user twice under different permissions. Does your count change, and should it?
How would you design the system or application you worked on in your previous role? What were the bottlenecks,
How would you design the system or application you worked on in your previous role? What were the bottlenecks, and how did you resolve them?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Design a client-server architecture for a financial reporting tool that needs to serve thousands of concurrent
Design a client-server architecture for a financial reporting tool that needs to serve thousands of concurrent users.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Explain how you would structure a RESTful API and ensure secure communication between microservices.
Explain how you would structure a RESTful API and ensure secure communication between microservices.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Describe how you would implement a caching layer to improve the latency of a frequently accessed data service.
Describe how you would implement a caching layer to improve the latency of a frequently accessed data service.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
What are the core principles of Object-Oriented Programming (OOP), and how have you applied them in your past
What are the core principles of Object-Oriented Programming (OOP), and how have you applied them in your past projects?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Explain the Singleton, Factory, and Strategy design patterns. In what scenarios would you choose one over the
Explain the Singleton, Factory, and Strategy design patterns. In what scenarios would you choose one over the other?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Listing latency scales with page size, not with filters
The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.
Approach
- Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
- Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
- Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
- Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.
Follow-up
- The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
- How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?
Built from the rounds and topics T. Rowe Price candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the T. Rowe Price loop
- Write out the reported sequence: Initial Screening Call, Preliminary Technical Assessment, Intensive Technical Rounds, Team Fit Evaluation, Final Hiring Decision.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 5 reported rounds, with the weakest marked.
02Work Coding Interviews
- Spend the session on Coding Interviews, which T. Rowe Price candidates report being tested on.
- Write one worked example in Coding Interviews and time yourself on it.
Deliverable: One timed worked example in Coding Interviews.
03Work System Design
- Spend the session on System Design, which T. Rowe Price candidates report being tested on.
- Write one worked example in System Design and time yourself on it.
Deliverable: One timed worked example in System Design.
04Work Behavioral Interviews
- Spend the session on Behavioral Interviews, which T. Rowe Price candidates report being tested on.
- Write one worked example in Behavioral Interviews and time yourself on it.
Deliverable: One timed worked example in Behavioral Interviews.
05Answer out loud: Coding & Problem-Solving
- Answer aloud, timed: Write a function to reverse a string or manipulate an array without using built-in high-level library functions.
- Answer aloud, timed: Given a list of financial transactions, find the peak transaction volume within a specific time window.
Deliverable: Spoken answers to 2 reported Coding & Problem-Solving question(s), under time.
06Answer out loud: System Design & Architecture
- Answer aloud, timed: How would you design the system or application you worked on in your previous role? What were the bottlenecks, and how did you resolve them?
- Answer aloud, timed: Design a client-server architecture for a financial reporting tool that needs to serve thousands of concurrent users.
Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.
07Answer out loud: Technical Theory & Domain Knowledge
- Answer aloud, timed: What are the core principles of Object-Oriented Programming (OOP), and how have you applied them in your past projects?
- Answer aloud, timed: Explain the Singleton, Factory, and Strategy design patterns. In what scenarios would you choose one over the other?
Deliverable: Spoken answers to 2 reported Technical Theory & Domain Knowledge question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Describe the process of a code review. What specific quality metrics and security practices do you look for be
Describe the process of a code review. What specific quality metrics and security practices do you look for before approving a pull request?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Describe a time when you had to work closely with a team to solve a highly ambiguous technical problem.
Describe a time when you had to work closely with a team to solve a highly ambiguous technical problem.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Tell me about a project you are particularly proud of. What was your individual contribution, and what did you
Tell me about a project you are particularly proud of. What was your individual contribution, and what did you learn from it?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
How do you handle a situation where you disagree with a senior engineer or architect on a technical decision?
How do you handle a situation where you disagree with a senior engineer or architect on a technical decision?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Give an example of a time when you had to adapt your approach to a project because of changing requirements or
Give an example of a time when you had to adapt your approach to a project because of changing requirements or unexpected technical limitations.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
How do you prioritize your tasks when working in a fast-paced environment with multiple competing deadlines?
How do you prioritize your tasks when working in a fast-paced environment with multiple competing deadlines?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
- 01
Describe the process of a code review. What specific quality metrics and security practices do you look for before approving a pull request?
- 02
Describe a time when you had to work closely with a team to solve a highly ambiguous technical problem.
- 03
Tell me about a project you are particularly proud of. What was your individual contribution, and what did you learn from it?
- 04
How do you handle a situation where you disagree with a senior engineer or architect on a technical decision?
How difficult are the technical interviews at T. Rowe Price?
The interviews are generally rated as average in difficulty. They focus heavily on practical software engineering skills, core language fundamentals, and system design rather than highly abstract algorithmic puzzles. Thorough preparation in your primary language and system design basics will prepare you well.
T. Rowe Price Software Engineer candidate reports ↗What is the typical timeline from the initial application to an offer?
The entire process usually takes between three and six weeks. However, some candidates have reported longer timelines due to scheduling coordination across multiple teams. Maintaining regular contact with your recruiter will help keep the process moving forward.
T. Rowe Price Software Engineer candidate reports ↗Does T. Rowe Price support hybrid or remote work for software engineers?
T. Rowe Price generally operates under a hybrid work model, requiring engineers to spend a set number of days per week in their local office (such as Owings Mills, MD, or London). Specific expectations can vary by team and location, so it is best to clarify this with your recruiter early in the process.
T. Rowe Price Software Engineer candidate reports ↗What distinguishes successful candidates in the pairing and coding rounds?
Successful candidates are those who communicate their thought processes clearly, write clean and modular code, and collaborate effectively with their interviewers. Treat the coding round as a joint problem-solving session rather than a silent exam.
T. Rowe Price Software Engineer candidate reports ↗Are the technical rounds flexible regarding programming languages?
This depends heavily on the specific team you are interviewing with. Some teams are highly flexible and allow you to use any language you are comfortable with, while others (particularly core backend teams) may require you to demonstrate proficiency in Java or another specific technology stack.
T. Rowe Price Software Engineer candidate reports ↗What topics does T. Rowe Price test in interviews?
T. Rowe Price interviews most often cover Behavioral Interviewing, Communication Skills, Problem Solving, System Design, and Stakeholder Management. The exact emphasis depends on the specific role you apply for.
T. Rowe Price Software Engineer candidate reports ↗What roles can I prepare for at T. Rowe Price?
Rowe Price, including Account Executive, AI Engineer, Business Analyst, and Consultant, and more.
T. Rowe Price Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01T. Rowe Price Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Cypress Hcm Software Engineer Interview Guide
What Cypress Hcm asks Software Engineer candidates, from reported rounds and questions.
Ancestry Software Engineer Interview Guide
Caching exercises for Ancestry software engineer candidates: deciding what staleness a feature tolerates, choosing between expiry and explicit invalidation, and handling the stampede when a hot key expires.
Prudential plc Software Engineer Interview Questions & Guide 2026
Design practice for Prudential plc software engineer prep that pushes past topology: turn a loose requirement into a schema and an API contract, then work out the read and write paths it implies.
T-Mobile Software Engineer Interview Questions & Guide 2026
Caching exercises for T-Mobile software engineer candidates: deciding what staleness a feature tolerates, choosing between expiry and explicit invalidation, and handling the stampede when a hot key expires.