cswork / libraryOpen practice workspace

Interview guides · PhillipCapital

PhillipCapital Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at PhillipCapital, you are at the intersection of high-frequency financial services and robust engineering. You will be responsible for building, maintaining, and scaling the systems that power one of Asia’s most prominent integrated financial institutions. Your work directly impacts how traders, investors, and internal teams interact with complex market data, ensuring that performance, reliability, and security remain at the forefront of the company’s digital infrastructure. The role demands a blend of technical precision and domain curiosity. Whether you are working on market-making algorithms, data processing pipelines for ETFs, or core financial platforms, you are expected to deliver solutions that are not only functional but also highly efficient.

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

Focus areas

  • SQL
  • OOP (Object-Oriented Programming)
  • Market Making

The PhillipCapital interview process

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

Recruiter Screen

Initial assessment of your background by a recruiter.

What to demonstrate

  • Initial assessment of your background by a recruiter
  • Depth in SQL

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

One or more rounds focusing on technical aptitude.

What to demonstrate

  • One or more rounds focusing on technical aptitude
  • Depth in SQL

How to prepare

  • Answer aloud and timed: How do you implement the Open-Closed Principle in your code?
  • Answer aloud and timed: Describe your experience with multithreading and its application in high-performance computing.

Manager/HR Discussion

Final discussion with a team manager or HR representative.

What to demonstrate

  • Final discussion with a team manager or HR representative
  • Depth in SQL

How to prepare

  • Answer aloud and timed: How do you optimize complex SQL queries for large datasets?
  • Answer aloud and timed: Can you explain the use cases for stored procedures versus application-level logic?

Where candidates lose points

Prepare your projects

Be ready to explain every technical decision you made in your resume projects. Interviewers will drill down into the "why."

Focus on C# / C++ fundamentals

Since these are core languages for the firm, ensure your knowledge of memory management and class design is sharp.

Communicate your thought process

Never stay silent during a coding test. Talk through your logic so the interviewer can follow your approach.

Be honest about your experience

If you don't know a specific tool or framework, explain how you would go about learning it, rather than guessing.

Questions & practice

How do you ensure data integrity in a high-concurrency environment?

Medium · SQL and Data Management

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?

Walk me through your approach to solving a live LeetCode-style algorithmic challenge.

Medium · Coding and Problem Solving

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?

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

  1. 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.
  2. 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.
  3. 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.
  4. 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?

How do you optimize complex SQL queries for large datasets?

Medium · SQL and Data Management

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?

Write the update path that detects a concurrent edit

Medium · optimistic concurrency · transactional outbox · audit history

resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.

Approach

  1. One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
  2. Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
  3. State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
  4. Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.

Follow-up

  • A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
  • Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?

How would you approach market-making for ETFs based on underlying futures?

Medium · Technical Proficiency and Domain Knowled

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Can you explain the difference between inheritance and abstraction in C#?

Medium · Technical Proficiency and Domain Knowled

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. 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 implement the Open-Closed Principle in your code?

Medium · Technical Proficiency and Domain Knowled

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Can you explain the use cases for stored procedures versus application-level logic?

Medium · SQL and Data Management

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Can you explain the architecture of your most recent project and the specific challenges you faced?

Medium · Project Experience and Behavioral

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 debug a socket program under high-load conditions?

Medium · Coding and Problem Solving

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 PhillipCapital candidates report.

Day 1 — Map the PhillipCapital loop

  • Write out the reported sequence: Recruiter Screen, Technical Rounds, Manager/HR Discussion.
  • 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.

Day 2 — Work SQL

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

Deliverable: One timed worked example in SQL.

Day 3 — Work OOP (Object-Oriented Programming)

  • Spend the session on OOP (Object-Oriented Programming), which PhillipCapital candidates report being tested on.
  • Write one worked example in OOP (Object-Oriented Programming) and time yourself on it.

Deliverable: One timed worked example in OOP (Object-Oriented Programming).

Day 4 — Work Market Making

  • Spend the session on Market Making, which PhillipCapital candidates report being tested on.
  • Write one worked example in Market Making and time yourself on it.

Deliverable: One timed worked example in Market Making.

Day 5 — Answer out loud: Technical Proficiency and Domain Knowledge

  • Answer aloud, timed: How would you approach market-making for ETFs based on underlying futures?
  • Answer aloud, timed: Can you explain the difference between inheritance and abstraction in C#?

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

Day 6 — Answer out loud: SQL and Data Management

  • Answer aloud, timed: How do you optimize complex SQL queries for large datasets?
  • Answer aloud, timed: Can you explain the use cases for stored procedures versus application-level logic?

Deliverable: Spoken answers to 2 reported SQL and Data Management question(s), under time.

Day 7 — Answer out loud: Coding and Problem Solving

  • Answer aloud, timed: Walk me through your approach to solving a live LeetCode-style algorithmic challenge.
  • Answer aloud, timed: How do you debug a socket program under high-load conditions?

Deliverable: Spoken answers to 2 reported Coding and Problem Solving question(s), under time.

Behavioural preparation

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

Describe your experience with multithreading and its application in high-performance computing.

Medium · Technical Proficiency and Domain Knowled

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?

Describe a time you had to optimize a piece of code that was causing system latency.

Medium · Coding and Problem Solving

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 handle disagreements regarding technical implementation with team members or managers?

Medium · Project Experience and Behavioral

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?

Why do you want to apply your engineering skills within the financial services sector?

Medium · Project Experience and Behavioral

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?