cswork / libraryOpen practice workspace

Interview guides · California Franchise Tax Board

California Franchise Tax Board Software Engineer Interview Guide

California Franchise Tax Board Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

The Software Engineer role at the California Franchise Tax Board (FTB) is critical for developing and maintaining the systems that support California’s tax administration. This position is essential in ensuring that the technology used by the FTB is efficient, secure, and responsive to the needs of taxpayers and stakeholders. As a Software Engineer, you will work on a variety of projects that directly impact the functionality of tax software, contributing to the integrity and effectiveness of the state’s tax collection processes. In this role, you will engage with teams responsible for various products, such as tax processing systems, customer interfaces, and data analytics platforms. You'll be part of a collaborative environment where your contributions will drive meaningful improvements and innovations, affecting millions of Californians.

This guide is scoped to a Software Engineer candidate at California Franchise Tax Board.

Focus areas

  • Technical Interviewing
  • Behavioral Interviewing
  • Coding Ability / Technical Questions

The California Franchise Tax Board interview process

California Franchise Tax Board candidates report 5 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Application Review

Review of submitted applications to assess qualifications and fit for the role.

What to demonstrate

  • Review of submitted applications to assess qualifications and fit for the role
  • Depth in Technical Interviewing

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

Candidates undergo technical assessments to evaluate their software engineering skills.

What to demonstrate

  • Candidates undergo technical assessments to evaluate their software engineering skills
  • Depth in Technical Interviewing

How to prepare

  • Answer aloud and timed: How do you ensure the security of software applications?
  • Answer aloud and timed: Tell us about a time you faced a conflict in a team. How did you resolve it?

Behavioral Interviews

Interviews focused on assessing interpersonal skills, teamwork, and cultural fit.

What to demonstrate

  • Interviews focused on assessing interpersonal skills, teamwork, and cultural fit
  • Depth in Technical Interviewing

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.

Final Evaluation

Final assessment to determine overall fit and alignment with FTB's mission.

What to demonstrate

  • Final assessment to determine overall fit and alignment with FTB's mission
  • Depth in Technical Interviewing

How to prepare

  • Answer aloud and timed: Given a scenario where the tax processing system is down, how would you approach troubleshooting the issue?
  • Answer aloud and timed: How would you design a system to improve user experience for taxpayers filing online?

Offer Discussion

Discussion regarding job offer details, including salary and benefits.

What to demonstrate

  • Discussion regarding job offer details
  • Including salary and benefits

How to prepare

  • Answer aloud and timed: Write a function to reverse a string. Explain your thought process.
  • Answer aloud and timed: How would you optimize a database query that is running slowly?

Where candidates lose points

Practice Coding

Regularly engage in coding challenges to refine your skills. Utilize platforms like LeetCode or HackerRank to simulate interview conditions.

Understand the Mission

Familiarize yourself with the California Franchise Tax Board’s mission and objectives. This knowledge will enhance your responses during behavioral interviews.

Prepare for Behavioral Questions

Use the STAR method (Situation, Task, Action, Result) to structure your responses to behavioral questions effectively.

Ask Questions

Prepare thoughtful questions to ask your interviewers about the team dynamics and project goals. This shows your genuine interest in the role.

Questions & practice

Write a function to reverse a string. Explain your thought process.

Medium · Coding / 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?

Archive a resource graph without breaking live references or recursing

Medium · graph traversal · topological order · tenant isolation

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

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

Find overlapping job attempts and peak concurrency from lease records

Medium · sweep line · intervals · leases

A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.

Approach

  1. Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
  2. For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
  3. For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
  4. Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.

Follow-up

  • A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
  • Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?

How would you optimize a database query that is running slowly?

Medium · Coding / Algorithms

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?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

  1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
  2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
  3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
  4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

  • Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
  • Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

Describe a project where you implemented a new technology. What challenges did you face?

Medium · Technical / Domain Questions

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 differences between REST and SOAP APIs?

Medium · Technical / Domain Questions

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?

How do you ensure the security of software applications?

Medium · Technical / Domain Questions

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 would you design a system to improve user experience for taxpayers filing online?

Medium · Problem-Solving / Case Studies

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?

Given a scenario where the tax processing system is down, how would you approach troubleshooting the issue?

Medium · Problem-Solving / Case Studies

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 California Franchise Tax Board candidates report.

Day 1 — Map the California Franchise Tax Board loop

  • Write out the reported sequence: Application Review, Technical Assessments, Behavioral Interviews, Final Evaluation, Offer 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 5 reported rounds, with the weakest marked.

Day 2 — Work Technical Interviewing

  • Spend the session on Technical Interviewing, which California Franchise Tax Board candidates report being tested on.
  • Write one worked example in Technical Interviewing and time yourself on it.

Deliverable: One timed worked example in Technical Interviewing.

Day 3 — Work Behavioral Interviewing

  • Spend the session on Behavioral Interviewing, which California Franchise Tax Board candidates report being tested on.
  • Write one worked example in Behavioral Interviewing and time yourself on it.

Deliverable: One timed worked example in Behavioral Interviewing.

Day 4 — Work Coding Ability / Technical Questions

  • Spend the session on Coding Ability / Technical Questions, which California Franchise Tax Board candidates report being tested on.
  • Write one worked example in Coding Ability / Technical Questions and time yourself on it.

Deliverable: One timed worked example in Coding Ability / Technical Questions.

Day 5 — Answer out loud: Technical / Domain Questions

  • Answer aloud, timed: Describe a project where you implemented a new technology. What challenges did you face?
  • Answer aloud, timed: Can you explain the differences between REST and SOAP APIs?

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

Day 6 — Answer out loud: Behavioral / Leadership

  • Answer aloud, timed: Tell us about a time you faced a conflict in a team. How did you resolve it?
  • Answer aloud, timed: Describe a situation where you had to lead a project. What was your approach?

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

Day 7 — Answer out loud: Problem-Solving / Case Studies

  • Answer aloud, timed: Given a scenario where the tax processing system is down, how would you approach troubleshooting the issue?
  • Answer aloud, timed: How would you design a system to improve user experience for taxpayers filing online?

Deliverable: Spoken answers to 2 reported Problem-Solving / Case Studies question(s), under time.

Behavioural preparation

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

Tell us about a time you faced a conflict in a team. How did you resolve it?

Medium · Behavioral / Leadership

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 situation where you had to lead a project. What was your approach?

Medium · Behavioral / Leadership

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 prioritize tasks when you have multiple deadlines?

Medium · Behavioral / Leadership

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?