cswork / libraryOpen practice workspace

Interview guides · Planned Systems International

Planned Systems International Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Planned Systems International plays a pivotal role in designing, developing, and maintaining enterprise-grade systems that support critical government, defense, and healthcare initiatives. The engineering team is responsible for delivering high-performance, secure, and scalable solutions that directly impact national security, public health platforms, and advanced defense technologies. This includes working on complex cloud migrations, unmanned systems, and real-time data processing environments. Because Planned Systems International operates heavily within the federal contracting and defense sectors, software engineering here goes far beyond writing clean code. Engineers must navigate strict security frameworks, optimize systems for high-reliability environments, and integrate cutting-edge capabilities like robotics and drone control systems.

This guide is scoped to a Software Engineer candidate at Planned Systems International.

Focus areas

  • Java
  • Coding Interviews
  • Problem Solving

The Planned Systems International interview process

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

Cognitive Assessment

Complete an online cognitive and logical aptitude assessment measuring problem-solving abilities under time constraints.

What to demonstrate

  • Complete an online cognitive and logical aptitude assessment measuring problem-solving abilities under time constraints
  • Depth in Java

How to prepare

  • Answer aloud and timed: Complete a sequence of numbers or patterns to identify the underlying rule.
  • Answer aloud and timed: Solve word-based logical deduction puzzles within a strict time limit.

Recruiter Meeting

Have a brief introductory meeting with a recruiter to discuss your background, interest in the company, and role requirements.

What to demonstrate

  • Have a brief introductory meeting with a recruiter to discuss your background, interest in the company, and role requirements
  • Depth in Java

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 Evaluation

Participate in a technical evaluation, which may include a take-home coding assignment or a live panel interview.

What to demonstrate

  • Participate in a technical evaluation, which may include a take-home coding assignment or a live panel interview
  • Depth in Java

How to prepare

  • Answer aloud and timed: Write a program to reverse a string or array in place without using built-in utility libraries.
  • Answer aloud and timed: Implement a basic search algorithm (such as binary search) and explain its time complexity.

Live Panel Interview

Write code in front of the engineering team, discuss design decisions, and answer behavioral questions.

What to demonstrate

  • Write code in front of the engineering team, discuss design decisions, and answer behavioral questions
  • Depth in Java

How to prepare

  • Answer aloud and timed: Design a simple class structure utilizing core object-oriented programming (OOP) principles like inheritance and polymorphism.
  • Answer aloud and timed: Find the duplicate elements in an array and optimize the solution for space complexity.

Where candidates lose points

Master the clock on the logic assessment

Do not try to answer every question perfectly. If a question takes more than 20 seconds to figure out, make an educated guess and immediately advance to the next one.

Over-communicate during live coding

Interviewers want to see how you think. Talk through your logic, explain why you are choosing a specific data structure, and state any assumptions you are making before you write a single line of code.

Brush up on object-oriented fundamentals

Be ready to explain and implement concepts like inheritance, encapsulation, and interfaces. Ensure you can write clean, modular code that demonstrates these principles naturally.

Questions & practice

Write a program to reverse a string or array in place without using built-in utility libraries.

Medium · Core Java and Algorithm Execution

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 basic search algorithm (such as binary search) and explain its time complexity.

Medium · Core Java and Algorithm Execution

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?

Find the duplicate elements in an array and optimize the solution for space complexity.

Medium · Core Java and Algorithm Execution

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 difference between an interface and an abstract class in Java, and provide a scenario where you wo

Medium · Core Java and Algorithm Execution

Explain the difference between an interface and an abstract class in Java, and provide a scenario where you would choose one over the other.

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?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

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

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

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

  1. Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
  2. Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
  3. Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
  4. Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

  • The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
  • How do you verify the backfill actually finished, given rows are still being inserted while it runs?

Complete a sequence of numbers or patterns to identify the underlying rule.

Medium · Cognitive and Logical Aptitude

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?

Solve word-based logical deduction puzzles within a strict time limit.

Medium · Cognitive and Logical Aptitude

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?

Solve basic algebraic word problems without the aid of a calculator.

Medium · Cognitive and Logical Aptitude

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?

Identify the odd-one-out among a series of complex geometric shapes.

Medium · Cognitive and Logical Aptitude

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?

Design a simple class structure utilizing core object-oriented programming (OOP) principles like inheritance a

Medium · Core Java and Algorithm Execution

Design a simple class structure utilizing core object-oriented programming (OOP) principles like inheritance and polymorphism.

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?

Exports duplicate a row range about once a week

Hard · leases · clock skew · idempotency

Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.

Approach

  1. Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
  2. Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
  3. Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
  4. Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.

Follow-up

  • The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
  • You now count takeovers. What alert fires on that counter, and at what threshold?

Suggested practice checklist

Built from the rounds and topics Planned Systems International candidates report.

Day 1 — Map the Planned Systems International loop

  • Write out the reported sequence: Cognitive Assessment, Recruiter Meeting, Technical Evaluation, Live Panel Interview.
  • 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 Java

  • Spend the session on Java, which Planned Systems International candidates report being tested on.
  • Write one worked example in Java and time yourself on it.

Deliverable: One timed worked example in Java.

Day 3 — Work Coding Interviews

  • Spend the session on Coding Interviews, which Planned Systems International 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.

Day 4 — Work Problem Solving

  • Spend the session on Problem Solving, which Planned Systems International 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.

Day 5 — Answer out loud: Cognitive and Logical Aptitude

  • Answer aloud, timed: Complete a sequence of numbers or patterns to identify the underlying rule.
  • Answer aloud, timed: Solve word-based logical deduction puzzles within a strict time limit.

Deliverable: Spoken answers to 2 reported Cognitive and Logical Aptitude question(s), under time.

Day 6 — Answer out loud: Core Java and Algorithm Execution

  • Answer aloud, timed: Write a program to reverse a string or array in place without using built-in utility libraries.
  • Answer aloud, timed: Implement a basic search algorithm (such as binary search) and explain its time complexity.

Deliverable: Spoken answers to 2 reported Core Java and Algorithm Execution question(s), under time.

Day 7 — Answer out loud: Behavioral and Team Collaboration

  • Answer aloud, timed: Describe a time when you had to work with a difficult stakeholder or team member. How did you resolve the conflict?
  • Answer aloud, timed: How do you handle a situation where you are given incomplete or conflicting requirements for a software project?

Deliverable: Spoken answers to 2 reported Behavioral and Team Collaboration question(s), under time.

Behavioural preparation

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

Describe a time when you had to work with a difficult stakeholder or team member. How did you resolve the conf

Medium · Behavioral and Team Collaboration

Describe a time when you had to work with a difficult stakeholder or team member. How did you resolve the conflict?

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 a situation where you are given incomplete or conflicting requirements for a software projec

Medium · Behavioral and Team Collaboration

How do you handle a situation where you are given incomplete or conflicting requirements for a software project?

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?

Walk me through a challenging technical problem you solved in your previous role and the steps you took to dia

Medium · Behavioral and Team Collaboration

Walk me through a challenging technical problem you solved in your previous role and the steps you took to diagnose it.

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 manage your time and prioritize tasks when working under tight deadlines?

Medium · Behavioral and Team Collaboration

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?