Interview guides · Fedex Services

Fedex Services Software Engineer Interview Guide

Fedex Services Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

As a Software Engineer at Fedex Services, you are at the heart of the global supply chain, building and maintaining the digital infrastructure that keeps the world moving. Your work directly impacts how millions of packages are tracked, routed, and delivered daily. You will contribute to high-scale, mission-critical systems that require extreme reliability, performance, and security. This role is not just about writing code; it is about solving complex logistical challenges in a fast-paced environment. You will collaborate with cross-functional teams to modernize legacy systems, implement cloud-native solutions, and ensure that our technical operations remain as agile as our logistics network. Whether you are working on backend services, database optimization, or system architecture, your contributions will have a direct, tangible impact on the efficiency of Fedex Services.

This guide is scoped to a Software Engineer candidate at Fedex Services.

Focus areas

Data Structures & Algorithms (DSA)
Java
SQL

The Fedex Services interview process

Fedex Services candidates report 5 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Recruiter Screening

Initial screening to verify alignment on experience and role requirements.

What to demonstrate

Initial screening to verify alignment on experience and role requirements
Depth in Data Structures & Algorithms (DSA)

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 Rounds

Series of technical assessments including coding and system design discussions.

What to demonstrate

Series of technical assessments including coding and system design discussions
Depth in Data Structures & Algorithms (DSA)

How to prepare

Answer aloud and timed: What are the common use cases for indexing in an Oracle database?
Answer aloud and timed: How do you manage memory and performance in a high-concurrency Java environment?

Behavioral Rounds

Interviews focusing on behavioral aspects and cultural fit.

What to demonstrate

Interviews focusing on behavioral aspects and cultural fit
Depth in Data Structures & Algorithms (DSA)

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 rounds above and write down what you would ask to confirm before it.

Panel Interview

Opportunity to interact with multiple team members to assess collaboration and communication.

What to demonstrate

Opportunity to interact with multiple team members to assess collaboration and communication
Depth in Data Structures & Algorithms (DSA)

How to prepare

Answer aloud and timed: Tell me about a project where you had to work with a cross-functional team. How did you resolve conflicts?
Answer aloud and timed: Give an example of a time you identified a critical bug in production. How did you handle the resolution?

Final Decision

Final review and decision-making process regarding the candidate's application.

What to demonstrate

Final review and decision-making process regarding the candidate's application
Depth in Data Structures & Algorithms (DSA)

How to prepare

Answer aloud and timed: How do you approach mentoring junior developers or sharing knowledge within your team?
Answer aloud and timed: Describe a situation where you had to explain a complex technical concept to a non-technical stakeholder.

Where candidates lose points

Quantify your impact

When discussing past projects, use numbers (e.g., "improved query performance by 30%" or "reduced deployment time by 2 hours").

Know your resume

Be prepared to dive deep into every project you list. Interviewers will ask for specific details about your contributions.

Ask thoughtful questions

At the end of your interviews, ask about the team’s current technical challenges or how the company supports professional growth.

Stay calm under pressure

If you don't know an answer, it is better to walk the interviewer through your thought process than to guess.

Questions & practice

How do you manage memory and performance in a high-concurrency Java environment?

Medium · Technical & Domain Proficiency

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?

Identify the heaviest tenants in a five-minute window under memory pressure

Medium · top-k · heavy hitters · streaming

The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.

Approach

Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.

Follow-up

The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?

Collapse a redelivered event batch into per-aggregate high-water marks

Easy · hashing · at-least-once · aggregation

You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.

Approach

One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.

Follow-up

The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?

How do you optimize a complex SQL query for large datasets?

Medium · Technical & Domain Proficiency

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?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.

Approach

Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.

Follow-up

A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
How do you honour an erasure request while resource_revision.actor_user_id still references this table?

Can you explain the difference between Spring and Spring Boot?

Medium · Technical & Domain Proficiency

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 common use cases for indexing in an Oracle database?

Medium · Technical & Domain Proficiency

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 would you design a system to track millions of packages in real-time?

Medium · System Design & Problem Solving

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 ensure high availability and fault tolerance in a distributed system.

Medium · System Design & Problem Solving

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?

Walk me through your approach to debugging a performance bottleneck in a microservices architecture.

Medium · System Design & Problem Solving

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 decide between a relational database and a NoSQL solution for a new service?

Medium · System Design & Problem Solving

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?

One customer endpoint stalls deliveries to every other destination

Medium · bulkhead · timeouts · saturation

The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.

Approach

Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.

Follow-up

The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
Where should the 10-second timeout number actually come from?

Suggested practice checklist

Built from the rounds and topics Fedex Services candidates report.

Day 1 — Map the Fedex Services loop

Write out the reported sequence: Recruiter Screening, Technical Rounds, Behavioral Rounds, Panel Interview, Final 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.

Day 2 — Work Data Structures & Algorithms (DSA)

Spend the session on Data Structures & Algorithms (DSA), which Fedex Services candidates report being tested on.
Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.

Deliverable: One timed worked example in Data Structures & Algorithms (DSA).

Day 3 — Work Java

Spend the session on Java, which Fedex Services candidates report being tested on.
Write one worked example in Java and time yourself on it.

Deliverable: One timed worked example in Java.

Day 4 — Work SQL

Spend the session on SQL, which Fedex Services candidates report being tested on.
Write one worked example in SQL and time yourself on it.

Deliverable: One timed worked example in SQL.

Day 5 — Answer out loud: Technical & Domain Proficiency

Answer aloud, timed: How do you optimize a complex SQL query for large datasets?
Answer aloud, timed: Can you explain the difference between Spring and Spring Boot?

Deliverable: Spoken answers to 2 reported Technical & Domain Proficiency question(s), under time.

Day 6 — Answer out loud: Behavioral & Leadership

Answer aloud, timed: Describe a time you had to handle a high-pressure, fast-paced situation. How did you prioritize your tasks?
Answer aloud, timed: Tell me about a project where you had to work with a cross-functional team. How did you resolve conflicts?

Deliverable: Spoken answers to 2 reported Behavioral & Leadership question(s), under time.

Day 7 — Answer out loud: System Design & Problem Solving

Answer aloud, timed: How would you design a system to track millions of packages in real-time?
Answer aloud, timed: Explain how you would ensure high availability and fault tolerance in a distributed system.

Deliverable: Spoken answers to 2 reported System Design & Problem Solving question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

Describe your experience with Linux scripting for system automation.

Medium · Technical & Domain Proficiency

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?