cswork / libraryOpen practice workspace

Interview guides · Project44

Project44 Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Project44, you are at the core of building the connective tissue for global supply chains. Project44 powers Movement, a flagship Decision Intelligence Platform that ingests, normalizes, and transforms massive streams of fragmented logistics data into actionable, real-time insights. The engineering team is responsible for scaling a global network connecting hundreds of thousands of carriers, processing billions of shipment events, and driving AI-native capabilities through specialized divisions like p44LSP.ai. In this role, your code directly impacts how global shippers, freight forwarders, brokers, and third-party logistics providers (3PLs) track goods worldwide. You will build high-throughput REST APIs, resilient microservices, and low-latency data pipelines using technologies like Java, Spring Boot, Kafka, and Redis.

This guide is scoped to a Software Engineer candidate at Project44.

Focus areas

  • Data Structures & Algorithms (DSA)
  • Low Level Design (LLD)
  • High Level Design (HLD)

The Project44 interview process

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

Recruiter Phone Screen

Initial call to review your background and technical stack fit.

What to demonstrate

  • Initial call to review your background and technical stack fit
  • 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.

Online Assessment

Assessment on platforms like HackerRank to evaluate technical skills.

What to demonstrate

  • Assessment on platforms like HackerRank to evaluate technical skills
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Implement a graph traversal algorithm to calculate the shortest path in an undirected graph.
  • Answer aloud and timed: Solve a classic variant of the Coin Change problem: given target capacity $N$ and an array of container sizes, find the minimum number of units required to match $N$ exactly (or return -1).

Virtual Technical Rounds

Interviews focusing on Data Structures & Algorithms, Low-Level Design, and High-Level Design.

What to demonstrate

  • Interviews focusing on Data Structures & Algorithms, Low-Level Design, and High-Level Design
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Reverse an array in $O(n)$ time complexity and $O(1)$ space without using built-in high-level language helpers.
  • Answer aloud and timed: Design an Air Traffic Controller system focusing on low-level class interactions, concurrent state management, and real-time event dispatching.

Hiring Manager Round

Final round discussing past architecture, technology experience, and cultural fit.

What to demonstrate

  • Final round discussing past architecture, technology experience, and cultural fit
  • Depth in Data Structures & Algorithms (DSA)

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.

Where candidates lose points

Master core Java constructs and Stream API usage

Interviewers often look for clean, functional Java idioms when evaluating backend coding tasks. Practice implementing data processing tasks cleanly using Streams and Lambdas.

Structure your system design communication

When tackling High-Level Design scenarios, establish explicit requirements, estimate throughput and storage, outline API contracts, and proactively discuss single points of failure and caching strategies.

Demonstrate familiarity with event-driven systems

Be ready to explain how message queues like Kafka handle high-throughput event ingestion, payload serialization, partition keys, and retries.

Focus on database normalization and query performance

Refresh your knowledge of relational database normalization rules, indexing trade-offs, and efficient SQL join operations.

Be ready to discuss past project trade-offs

In the Hiring Manager and Director rounds, articulate your past technical decisions clearly—explaining why you selected specific technologies, how you managed trade-offs, and what you learned from production failures.

Questions & practice

Find the minimum length substring containing at least $k$ distinct characters.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. 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-source Breadth-First Search (BFS) problem to determine shortest propagation paths in a grid.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. 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 graph traversal algorithm to calculate the shortest path in an undirected graph.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. 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?

Reverse an array in $O(n)$ time complexity and $O(1)$ space without using built-in high-level language helpers

Medium · Data Structures & Algorithms

Reverse an array in $O(n)$ time complexity and $O(1)$ space without using built-in high-level language helpers.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. 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?

Explain the Java memory model, garbage collection mechanics, and the practical usage of the Java 8 Stream API.

Medium · Core CS Fundamentals & Domain Knowledge

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. 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?

Discuss relational schema normalization techniques and database selection criteria for high-write tracking tel

Medium · System Design & Architecture

Discuss relational schema normalization techniques and database selection criteria for high-write tracking telemetry versus read-heavy dashboard analytics.

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. 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?

Discuss relational database normalization forms and describe trade-offs between dynamic indexing and write lat

Medium · Core CS Fundamentals & Domain Knowledge

Discuss relational database normalization forms and describe trade-offs between dynamic indexing and write latency in SQL.

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. 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?

Why do you want to join Project44, and how do your technical background and career goals align with our logist

Medium · Behavioral & Past Leadership

Why do you want to join Project44, and how do your technical background and career goals align with our logistics ecosystem?

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. 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?

Solve a classic variant of the Coin Change problem: given target capacity $N$ and an array of container sizes,

Medium · Data Structures & Algorithms

Solve a classic variant of the Coin Change problem: given target capacity $N$ and an array of container sizes, find the minimum number of units required to match $N$ exactly (or return -1).

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. 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 an Air Traffic Controller system focusing on low-level class interactions, concurrent state management,

Medium · System Design & Architecture

Design an Air Traffic Controller system focusing on low-level class interactions, concurrent state management, and real-time event dispatching.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. 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?

Architect an end-to-end data ingestion pipeline capable of handling high-volume carrier updates using Kafka an

Medium · System Design & Architecture

Architect an end-to-end data ingestion pipeline capable of handling high-volume carrier updates using Kafka and Redis.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. 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 high-level fault-tolerant tracking network that tolerates partial network partitions and third-party

Medium · System Design & Architecture

Design a high-level fault-tolerant tracking network that tolerates partial network partitions and third-party API rate limits.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. 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 to design RESTful microservices with effective error handling, idempotency, and backwards compatib

Medium · System Design & Architecture

Explain how to design RESTful microservices with effective error handling, idempotency, and backwards compatibility.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. 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 core networking and web protocols, including HTTP status codes, REST API conventions, and TCP/UDP sock

Medium · Core CS Fundamentals & Domain Knowledge

Explain core networking and web protocols, including HTTP status codes, REST API conventions, and TCP/UDP sockets.

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. 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?

Describe how distributed caching layers like Redis maintain cache coherence and mitigate cache stampede issues

Medium · Core CS Fundamentals & Domain Knowledge

Describe how distributed caching layers like Redis maintain cache coherence and mitigate cache stampede issues.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. 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?

Contrast microservices architecture with monolithic setups, focusing on transactional boundaries and event-dri

Medium · Core CS Fundamentals & Domain Knowledge

Contrast microservices architecture with monolithic setups, focusing on transactional boundaries and event-driven communication via message queues.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. 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 collaborate across cross-functional teams, such as product management, client-facing integration te

Medium · Behavioral & Past Leadership

How do you collaborate across cross-functional teams, such as product management, client-facing integration teams, and platform operations?

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. 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?

Describe a situation where a production outage occurred. How did you diagnose the issue, resolve it, and preve

Medium · Behavioral & Past Leadership

Describe a situation where a production outage occurred. How did you diagnose the issue, resolve it, and prevent recurrence?

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Project44 candidates report.

Day 1 — Map the Project44 loop

  • Write out the reported sequence: Recruiter Phone Screen, Online Assessment, Virtual Technical Rounds, Hiring Manager Round.
  • 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 4 reported rounds, with the weakest marked.

Day 2 — Work Data Structures & Algorithms (DSA)

  • Spend the session on Data Structures & Algorithms (DSA), which Project44 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 Low Level Design (LLD)

  • Spend the session on Low Level Design (LLD), which Project44 candidates report being tested on.
  • Write one worked example in Low Level Design (LLD) and time yourself on it.

Deliverable: One timed worked example in Low Level Design (LLD).

Day 4 — Work High Level Design (HLD)

  • Spend the session on High Level Design (HLD), which Project44 candidates report being tested on.
  • Write one worked example in High Level Design (HLD) and time yourself on it.

Deliverable: One timed worked example in High Level Design (HLD).

Day 5 — Answer out loud: Data Structures & Algorithms

  • Answer aloud, timed: Find the minimum length substring containing at least $k$ distinct characters.
  • Answer aloud, timed: Solve a multi-source Breadth-First Search (BFS) problem to determine shortest propagation paths in a grid.

Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.

Day 6 — Answer out loud: System Design & Architecture

  • Answer aloud, timed: Design an Air Traffic Controller system focusing on low-level class interactions, concurrent state management, and real-time event dispatching.
  • Answer aloud, timed: Architect an end-to-end data ingestion pipeline capable of handling high-volume carrier updates using Kafka and Redis.

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

Day 7 — Answer out loud: Core CS Fundamentals & Domain Knowledge

  • Answer aloud, timed: Explain the Java memory model, garbage collection mechanics, and the practical usage of the Java 8 Stream API.
  • Answer aloud, timed: Discuss relational database normalization forms and describe trade-offs between dynamic indexing and write latency in SQL.

Deliverable: Spoken answers to 2 reported Core CS Fundamentals & Domain Knowledge question(s), under time.

Behavioural preparation

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

Tell me about a past engineering project where you had to make a difficult architectural trade-off under stric

Medium · Behavioral & Past Leadership

Tell me about a past engineering project where you had to make a difficult architectural trade-off under strict time constraints.

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. 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 approach identifying, prioritizing, and systematically refactoring technical debt in a fast-growing

Medium · Behavioral & Past Leadership

How do you approach identifying, prioritizing, and systematically refactoring technical debt in a fast-growing codebase?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. 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?

Estimate work you have never done and defend the range

Hard · estimation · backfills · expand-contract

You are asked to estimate a change you have never attempted: add a column to a 100-million-row table, populate it, move reads across, and drop the old shape. Give a range with the assumptions that generate it, including batch size, the signal your backfill throttles on, and wall-clock hours, and name the three unknowns that would move the number most. Then describe a real estimate you gave under comparable ignorance: how you expressed its uncertainty, what you committed to, and how wrong you turned out to be.

Approach

  1. Decompose into independently deployable steps before estimating anything: add the column nullable, write both shapes, backfill in batches, verify, move reads, stop writing the old shape, drop it. That is four deploys spread over days, and the calendar estimate is dominated by them rather than by the loop's runtime.
  2. Do the arithmetic aloud for the part that has arithmetic in it: batch size times number of batches times per-batch duration, at a write rate the primary can absorb alongside roughly 1.2k writes per second of production traffic. The loop is throttled by replication lag and lock waits, not by how fast it can issue statements.
  3. Price the schema step by its lock rather than its statement duration. In PostgreSQL an ALTER TABLE taking ACCESS EXCLUSIVE waits for every open transaction on that table while later queries queue behind it, so a millisecond change issued during a thirty-second analytics query stalls that table for thirty seconds. Adding a nullable column with a non-volatile default avoids a rewrite from version 11; a new index wants CREATE INDEX CONCURRENTLY, which cannot run inside a transaction block and leaves an invalid index behind if it fails.
  4. Express the answer as a range whose endpoints each trace to a stated assumption, then name the cheapest experiment that collapses it, which is almost always running one real batch against the real table and multiplying.

Follow-up

  • How do you verify the backfill genuinely finished, given rows written by production traffic while it ran?
  • Where does the backfill resume from after a worker is killed mid-batch, and what makes that resume point trustworthy?