As a Software Engineer at Truist, you will play a critical role in shaping the digital future of one of the largest financial services holding companies in the United States. Following the historic merger of BB&T and SunTrust, Truist has embarked on a massive technology modernization journey. This role is not just about maintaining legacy systems; it is about building high-scale, secure, and cloud-native financial platforms that serve millions of clients daily. In this position, you will contribute directly to high-impact products, including the flagship Truist mobile applications, online banking portals, and robust backend transaction engines. The engineering team is tasked with solving complex problems around data consistency, high-throughput transaction processing, and cloud migration. You will work in an environment that balances the rigorous security requirements of a major bank with the agile, fast-paced innovation of a modern technology company. Successfully executing this role requires a deep appreciation for software craft, system reliability, and collaborative problem-solving. Whether you are optimizing backend microservices or developing intuitive frontend interfaces, your work will directly impact the financial well-being of individuals, businesses, and communities.
Recruiter Screening
reportedInitial contact with a recruiter to evaluate your background and fit for the role.
What to demonstrate
- Initial contact with a recruiter to evaluate your background and fit for the role
- Depth in Coding (Algorithms & Data Structures)
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.
Technical Assessments
reportedRigorous technical evaluations to assess your software engineering skills and theoretical knowledge.
What to demonstrate
- Rigorous technical evaluations to assess your software engineering skills and theoretical knowledge
- Depth in Coding (Algorithms & Data Structures)
How to prepare
- Answer aloud and timed: How does dependency injection work in Spring Boot, and what are its primary benefits?
- Answer aloud and timed: Describe the difference between optimistic and pessimistic locking in database transactions.
Behavioral Interviews
reportedInterviews focused on assessing your cultural fit and behavioral storytelling.
What to demonstrate
- Interviews focused on assessing your cultural fit and behavioral storytelling
- Depth in Coding (Algorithms & Data Structures)
How to prepare
- Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
- Re-read the description of the behavioral interviews above and write down what you would ask to confirm before it.
PracHub editorial advice for the preparation topics above.
Master Your Resume Theory
Be prepared for interviewers to ask detailed theoretical questions about any technology, framework, or methodology listed on your resume. If you list Hibernate or Spring Boot, make sure you can explain their internal mechanics deeply.
Focus on the "Connecting" Aspect
Many hiring managers at Truist place immense value on personality, communication, and mutual connection. Treat the interview as a collaborative conversation rather than a rigid interrogation.
Treating a network call as though it were a local function call
A remote call can be slow, fail, or return after you stopped waiting, so name the timeout, the retry policy, and what the caller sees while the dependency is down. A call with no timeout turns one slow dependency into an exhausted thread or connection pool in every service upstream of it.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
How do you manage memory and prevent leaks in a large-scale Android application?
How do you manage memory and prevent leaks in a large-scale Android application?
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?
Archive a resource graph without breaking live references or recursing
Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.
Approach
- Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
- Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
- Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
- Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.
Follow-up
- The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
- The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?
Merge partitioned event streams into one ordered feed with bounded lateness
The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.
Approach
- Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
- Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
- Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
- Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.
Follow-up
- The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
- The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?
How do you optimize database query performance when working with large datasets in a relational database?
How do you optimize database query performance when working with large datasets in a relational database?
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?
Explain why the owner filter ignores the listing index
The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.
Approach
- Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
- For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
- Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
- Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.
Follow-up
- 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
- A dashboard runs this for 40 owners in one page load. What changes about the design?
Explain the lifecycle of an entity in Hibernate.
Explain the lifecycle of an entity in Hibernate.
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?
What are the differences between various HTTP error codes, and when would you use a 401 versus a 403 status co
What are the differences between various HTTP error codes, and when would you use a 401 versus a 403 status code?
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?
How does dependency injection work in Spring Boot, and what are its primary benefits?
How does dependency injection work in Spring Boot, and what are its primary benefits?
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?
Describe the difference between optimistic and pessimistic locking in database transactions.
Describe the difference between optimistic and pessimistic locking in database transactions.
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?
How do you design a secure, fault-tolerant microservices architecture?
How do you design a secure, fault-tolerant microservices architecture?
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 design patterns have you implemented in your past projects, and what specific problems did they solve?
What design patterns have you implemented in your past projects, and what specific problems did they solve?
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?
How would you handle distributed transactions across multiple microservices?
How would you handle distributed transactions across multiple 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?
Explain the concept of service discovery and why it is critical in a cloud-native environment.
Explain the concept of service discovery and why it is critical in a cloud-native environment.
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?
How do you ensure zero-downtime deployments for a high-traffic banking application?
How do you ensure zero-downtime deployments for a high-traffic banking application?
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 is your approach to setting up a robust test automation framework for continuous integration?
What is your approach to setting up a robust test automation framework for continuous integration?
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
How do you implement secure data storage on mobile devices to protect sensitive user information?
How do you implement secure data storage on mobile devices to protect sensitive user information?
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?
One log partition stops advancing while the others drain
Search results for a subset of tenants are hours stale; the rest are current. The projection consumer reports lag of zero on 15 of 16 partitions and 400,000 on one. Its error rate is flat and its CPU is idle. outbox_event has no pending rows older than a second, so the relay has published everything it holds. Identify the mechanism, give the ordered checks, and state what you do in the first ten minutes versus what you change permanently.
Approach
- Read the lag distribution first. A slow consumer lags everywhere; zero on fifteen partitions and 400,000 on one is not throughput. Idle CPU on the stuck partition means the consumer is not advancing its offset at all, which points at one message it cannot get past rather than at a rate problem.
- Exonerate the producer before touching the consumer. No pending outbox rows older than a second means the relay published, so the event exists in the log. This separates never sent from sent and never applied, which are different code paths and usually different owners.
- Read the message at the stuck offset and the handler's log lines for its event_id. A flat error rate with no progress has two explanations and you must distinguish them: the handler is throwing and the retry loop is swallowing it, or the handler is blocking on something and never returning. Idle CPU with no error lines favours the second.
- Mitigate before diagnosing further. Move the offending event to a dead-letter store and commit the offset past it. Adding consumers does nothing here, because a partition is consumed by exactly one member of the group, and the blast radius is every aggregate hashed to that partition, not only the aggregate that produced the bad event.
Follow-up
- The dead-lettered event carried aggregate_version 7 and the projection had applied 6. What must the replay do differently if 8 and 9 landed in the meantime?
- How do you show staleness to the user while the partition is behind, given the API already returns the projection's watermark?
Built from the rounds and topics Truist candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Truist loop
- Write out the reported sequence: Recruiter Screening, Technical Assessments, Behavioral Interviews.
- 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 3 reported rounds, with the weakest marked.
02Work Coding (Algorithms & Data Structures)
- Spend the session on Coding (Algorithms & Data Structures), which Truist candidates report being tested on.
- Write one worked example in Coding (Algorithms & Data Structures) and time yourself on it.
Deliverable: One timed worked example in Coding (Algorithms & Data Structures).
03Work System Design
- Spend the session on System Design, which Truist 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 Problem Solving
- Spend the session on Problem Solving, which Truist candidates report being tested on.
- Write one worked example in Problem Solving and time yourself on it.
Deliverable: One timed worked example in Problem Solving.
05Answer out loud: Backend & Core Technology
- Answer aloud, timed: Explain the lifecycle of an entity in Hibernate.
- Answer aloud, timed: What are the differences between various HTTP error codes, and when would you use a 401 versus a 403 status code?
Deliverable: Spoken answers to 2 reported Backend & Core Technology question(s), under time.
06Answer out loud: Architecture & System Design
- Answer aloud, timed: How do you design a secure, fault-tolerant microservices architecture?
- Answer aloud, timed: What design patterns have you implemented in your past projects, and what specific problems did they solve?
Deliverable: Spoken answers to 2 reported Architecture & System Design question(s), under time.
07Answer out loud: Behavioral & Leadership
- Answer aloud, timed: How do you define a "good programmer," and how do you apply this definition to your daily work?
- Answer aloud, timed: Describe a time when you had a disagreement with a technical lead or manager. How did you resolve it?
Deliverable: Spoken answers to 2 reported Behavioral & Leadership 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.
How do you define a "good programmer," and how do you apply this definition to your daily work?
How do you define a "good programmer," and how do you apply this definition to your daily work?
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 a disagreement with a technical lead or manager. How did you resolve it?
Describe a time when you had a disagreement with a technical lead or manager. How did you resolve 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?
Tell me about a time you had to deliver a project under a tight deadline with incomplete requirements.
Tell me about a time you had to deliver a project under a tight deadline with incomplete requirements.
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 tasks when managing multiple competing deadlines?
How do you prioritize tasks when managing 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?
Describe a situation where you had to explain a complex technical concept to a non-technical stakeholder.
Describe a situation where you had to explain a complex technical concept to a non-technical stakeholder.
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
How do you define a "good programmer," and how do you apply this definition to your daily work?
- 02
Describe a time when you had a disagreement with a technical lead or manager. How did you resolve it?
- 03
Tell me about a time you had to deliver a project under a tight deadline with incomplete requirements.
- 04
How do you prioritize tasks when managing multiple competing deadlines?
How difficult is the Software Engineer interview at Truist?
The interview difficulty is generally rated as average to difficult. While the behavioral rounds focus heavily on connection and culture, the technical rounds can be highly theoretical and rigorous, requiring a deep understanding of framework internals and system design.
Truist Software Engineer candidate reports ↗What is the typical timeline for the hiring process?
Truist is known for a relatively fast hiring process. From the initial recruiter screen to a final offer decision, the process typically takes about three weeks, provided there are no scheduling delays.
Truist Software Engineer candidate reports ↗Does Truist support remote or hybrid working arrangements?
Truist generally operates on a hybrid model, requiring engineers to spend a portion of their week in one of our key technology hubs, such as Charlotte, NC, Raleigh, NC, or Atlanta, GA. Specific arrangements should be confirmed with your recruiter.
Truist Software Engineer candidate reports ↗What distinguishes a successful candidate at Truist?
Successful candidates are those who combine strong technical foundations with excellent communication skills. Showing a genuine interest in financial technology, modernization, and collaborating across diverse teams is highly valued by our hiring managers.
Truist Software Engineer candidate reports ↗What topics does Truist test in interviews?
Truist interviews most often cover Stakeholder Management, Problem Solving, Communication Skills, Statistical Analysis, and Behavioral Interviewing. The exact emphasis depends on the specific role you apply for.
Truist 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.
- 01Truist 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.
Securly Software Engineer Interview Guide
What Securly asks Software Engineer candidates, from reported rounds and questions.
Paycom Software Engineer Interview Guide
What Paycom asks Software Engineer candidates, from reported rounds and questions.
Persistent Systems Software Engineer Interview Guide
What Persistent Systems asks Software Engineer candidates, from reported rounds and questions.
North Highland Software Engineer Interview Guide
What North Highland asks Software Engineer candidates, from reported rounds and questions.