Interview guides · CSU Long Beach

CSU Long Beach Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at CSU Long Beach plays a pivotal role in maintaining and advancing the digital infrastructure of one of the largest university systems in the United States. You are not just writing code; you are building and supporting the platforms that enable student success, faculty research, and administrative efficiency. From managing complex student information systems to developing custom web applications for campus-wide use, your work directly impacts the daily lives of over 30,000 students and thousands of staff members. The engineering team at CSULB focuses on reliability, security, and accessibility. Because the university operates at a significant scale, the software solutions you implement must be robust enough to handle high-traffic periods, such as enrollment cycles, while remaining intuitive for a diverse user base.

This guide is scoped to a Software Engineer candidate at CSU Long Beach.

Focus areas

Resume-Based Questioning
Job Description Parsing
Technical Interviewing

The CSU Long Beach interview process

CSU Long Beach candidates report 2 rounds over 2-4 weeks. The stages below are what candidates describe, not a published process.

Application Review

The search committee reviews your application materials to determine if you will move forward.

What to demonstrate

The search committee reviews your application materials to determine if you will move forward
Depth in Resume-Based Questioning

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.

Structured Panel Interview

If selected, you will participate in a panel interview with team members to verify your skills and assess team fit.

What to demonstrate

If selected, you will participate in a panel interview with team members to verify your skills and assess team fit
Depth in Resume-Based Questioning

How to prepare

Answer aloud and timed: How do you ensure your code is secure against common vulnerabilities like SQL injection or XSS?
Answer aloud and timed: Walk us through your experience with Object-Oriented Programming and how you have applied it in a recent project.

Where candidates lose points

Study the Job Description

CSU Long Beach interviewers often pull questions directly from the "Duties" and "Qualifications" sections of the posting. If the JD mentions a specific tool, expect a question on it.

Prepare Your Portfolio

If you have public repositories on GitHub or a portfolio site, ensure they are up to date. While they may not be reviewed during the 30-minute interview, they are often looked at during the pre-screening phase.

Understand the "CSU" Context

Mentioning your interest in public education or your connection to the Long Beach community can be a significant differentiator. It shows you are looking for more than just a paycheck.

During the panel interview, make sure to address everyone on the panel, not just the person who asked the question

This demonstrates good communication and situational awareness.

Questions & practice

Canonicalise a request body into a stable idempotency fingerprint

Medium · parsing · canonicalisation · hashing

idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.

Approach

Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.

Follow-up

A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
Where does the fingerprint get computed relative to request decompression and the body-size limit?

Track a rolling failure rate per destination for circuit decisions

Easy · sliding window · ring buffer · circuit breaker

The egress service delivers about 1,500 webhooks per second across roughly 40,000 destinations, each call bounded by a 10 second timeout. Maintain, per destination, the failure rate over the trailing 60 seconds so a caller can ask before dispatch whether the circuit should open. Attempts arrive as (destination_id, finished_at_ms, outcome). Requirement: amortised O(1) per attempt, with total memory bounded by the destination count rather than by traffic. Give the structure, its exact memory, and the rule that stops a destination with three attempts from opening a circuit.

Approach

Name the exact-deque version and then reject it as the default. Holding timestamps and advancing a tail pointer past anything older than now minus 60 seconds is a correct two-pointer window at amortised O(1) per attempt, but its memory tracks in-window traffic, so one destination in a retry storm holds hundreds of thousands of entries while thousands of quiet destinations hold none.
Use a ring of 60 one-second buckets per destination, each bucket a pair of counters for attempts and failures. On an attempt, advance the ring by the elapsed whole seconds, zeroing at most min(elapsed, 60) buckets, then increment the head. That is amortised O(1) with a fixed footprint per destination.
State the footprint: 60 buckets times two 4-byte counters is 480 bytes of payload per destination, so 40,000 destinations is roughly 20 to 25 MB with per-entry overhead, bounded by the catalogue rather than by the rate. The cost is granularity, since the oldest bucket ages out in whole seconds, which is far tighter than the decision needs.
Require a minimum sample before the circuit may open. A destination with three attempts and three failures reads as 100 percent and is not evidence; a floor of roughly 20 attempts in the window makes the ratio meaningful, and below that floor use a run of consecutive failures as the trigger instead.

Follow-up

The fleet is 30 instances and each sees roughly a thirtieth of a destination's traffic. Where does the rate actually live, and what does a per-instance answer get wrong?
A destination answers in 9.5 seconds and succeeds. It is not failing but it is consuming your per-destination concurrency. What signal should open the circuit here?

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?

Can you explain the difference between a join and a subquery in SQL, and when would you use each?

Medium · Technical and Resume-Focused

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?

How do you ensure your code is secure against common vulnerabilities like SQL injection or XSS?

Medium · Technical and Resume-Focused

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?

Describe a project where you had to optimize code for performance. What metrics did you use?

Medium · Technical and Resume-Focused

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 is your process for testing your code before it goes to a production environment?

Medium · Technical and Resume-Focused

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?

Listing latency scales with page size, not with filters

Easy · n+1 · latency · query batching

The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.

Approach

Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.

Follow-up

The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?

Suggested practice checklist

Built from the rounds and topics CSU Long Beach candidates report.

Day 1 — Map the CSU Long Beach loop

Write out the reported sequence: Application Review, Structured 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 2 reported rounds, with the weakest marked.

Day 2 — Work Resume-Based Questioning

Spend the session on Resume-Based Questioning, which CSU Long Beach candidates report being tested on.
Write one worked example in Resume-Based Questioning and time yourself on it.

Deliverable: One timed worked example in Resume-Based Questioning.

Day 3 — Work Job Description Parsing

Spend the session on Job Description Parsing, which CSU Long Beach candidates report being tested on.
Write one worked example in Job Description Parsing and time yourself on it.

Deliverable: One timed worked example in Job Description Parsing.

Day 4 — Work Technical Interviewing

Spend the session on Technical Interviewing, which CSU Long Beach 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 5 — Answer out loud: Technical and Resume-Focused

Answer aloud, timed: Can you explain the difference between a join and a subquery in SQL, and when would you use each?
Answer aloud, timed: Describe a project where you had to optimize code for performance. What metrics did you use?

Deliverable: Spoken answers to 2 reported Technical and Resume-Focused question(s), under time.

Day 6 — Answer out loud: Behavioral and Situational

Answer aloud, timed: Why are you interested in working for CSU Long Beach specifically?
Answer aloud, timed: Describe a time you had to work with a difficult stakeholder. How did you manage the relationship?

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

Day 7 — Dry run for CSU Long Beach

Run one full mock under time, then write down the two questions you most want to ask your interviewers.

Deliverable: A completed timed mock and two questions to ask.

Behavioural preparation

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

Walk us through your experience with Object-Oriented Programming and how you have applied it in a recent proje

Medium · Technical and Resume-Focused

Walk us through your experience with Object-Oriented Programming and how you have applied it in a recent project.

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?