Interview guides · Georgetown University

Georgetown University Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Georgetown University serves as a critical architect of the digital infrastructure that powers one of the world’s leading academic and research institutions. Unlike traditional tech firms, engineering at Georgetown is deeply rooted in the university's mission of service and academic excellence. You will be responsible for developing, maintaining, and scaling systems that support thousands of students, faculty, and staff, ranging from complex student information systems to cutting-edge research tools and administrative platforms. The impact of this role is felt across the entire Washington, DC campus and beyond. Whether you are working within University Information Services (UIS) or a specialized departmental team like Energy and Utilities, your work ensures that the university remains at the forefront of technological innovation.

This guide is scoped to a Software Engineer candidate at Georgetown University.

Focus areas

Project Explanation / Technical Storytelling
Technology Usage Explanation
Software Engineering (General)

The Georgetown University interview process

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

Resume Review

Initial review of your resume and basic qualifications by the recruiter or hiring manager.

What to demonstrate

Initial review of your resume and basic qualifications by the recruiter or hiring manager
Depth in Project Explanation / Technical Storytelling

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.

Phone Screen

Standard phone screen to discuss your background and qualifications.

What to demonstrate

Standard phone screen to discuss your background and qualifications
Depth in Project Explanation / Technical Storytelling

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.

Panel Interviews

Series of panel interviews with potential peers and cross-functional partners, focusing on experience and technical decision-making.

What to demonstrate

Series of panel interviews with potential peers and cross-functional partners
Focusing on experience and technical decision-making

How to prepare

Answer aloud and timed: Explain the difference between a REST API and a SOAP service in the context of integration.
Answer aloud and timed: Why do you want to work for Georgetown University specifically?

Onsite Panel

In-depth discussions during the onsite panel, which may be conducted virtually or in-person, emphasizing project deep-dives.

What to demonstrate

In-depth discussions during the onsite panel, which may be conducted virtually or in-person, emphasizing project deep-dives
Depth in Project Explanation / Technical Storytelling

How to prepare

Answer aloud and timed: Tell us about a time you had to explain a technical concept to a non-technical person.
Answer aloud and timed: How do you manage your time when working on multiple projects with competing deadlines?

Where candidates lose points

Research the Department

Georgetown is decentralized. An interview with UIS will feel different than an interview with the Medical Center or the Law School. Understand which specific part of the university you are applying to.

Prepare for the Panel

You will likely be interviewed by 3–5 people at once. Practice making eye contact (or addressing everyone on the call) and stay engaged even if only one person is asking the questions.

Emphasize Stability and Growth

Georgetown looks for people who want to stay and grow with the university. If you are looking for a long-term home where you can have a steady impact, make that clear.

Dress Professionally

While the tech culture is "laid-back," the university environment is still traditional. Business casual is usually the safest bet for interviews.

Questions & practice

If you were tasked with improving the course registration system's load time, where would you start?

Medium · Problem Solving & Logic

Approach

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

How do you stay current with new technologies and decide which ones are worth adopting?

Medium · Problem Solving & Logic

Approach

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

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.
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.
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.
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?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.

Approach

Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.

Follow-up

A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?

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

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.
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.
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.
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?

Walk us through your most recent project: what was the tech stack and why?

Medium · Technical & Project Deep-Dive

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?

Describe a complex bug you found in production and how you traced it.

Medium · Technical & Project Deep-Dive

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 approach to testing? (Unit tests, integration tests, etc.)

Medium · Technical & Project Deep-Dive

Approach

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

Explain the difference between a REST API and a SOAP service in the context of integration.

Medium · Technical & Project Deep-Dive

Approach

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

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Georgetown University candidates report.

Day 1 — Map the Georgetown University loop

Write out the reported sequence: Resume Review, Phone Screen, Panel Interviews, Onsite Panel.
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 Project Explanation / Technical Storytelling

Spend the session on Project Explanation / Technical Storytelling, which Georgetown University candidates report being tested on.
Write one worked example in Project Explanation / Technical Storytelling and time yourself on it.

Deliverable: One timed worked example in Project Explanation / Technical Storytelling.

Day 3 — Work Technology Usage Explanation

Spend the session on Technology Usage Explanation, which Georgetown University candidates report being tested on.
Write one worked example in Technology Usage Explanation and time yourself on it.

Deliverable: One timed worked example in Technology Usage Explanation.

Day 4 — Work Software Engineering (General)

Spend the session on Software Engineering (General), which Georgetown University candidates report being tested on.
Write one worked example in Software Engineering (General) and time yourself on it.

Deliverable: One timed worked example in Software Engineering (General).

Day 5 — Answer out loud: Technical & Project Deep-Dive

Answer aloud, timed: Walk us through your most recent project: what was the tech stack and why?
Answer aloud, timed: How do you handle version control and code reviews in a team setting?

Deliverable: Spoken answers to 2 reported Technical & Project Deep-Dive question(s), under time.

Day 6 — Answer out loud: Behavioral & Culture Fit

Answer aloud, timed: Why do you want to work for Georgetown University specifically?
Answer aloud, timed: Tell us about a time you had to explain a technical concept to a non-technical person.

Deliverable: Spoken answers to 2 reported Behavioral & Culture Fit question(s), under time.

Day 7 — Answer out loud: Problem Solving & Logic

Answer aloud, timed: If you were tasked with improving the course registration system's load time, where would you start?
Answer aloud, timed: How do you stay current with new technologies and decide which ones are worth adopting?

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

Behavioural preparation

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

How do you handle version control and code reviews in a team setting?

Medium · Technical & Project Deep-Dive

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?