cswork / libraryOpen practice workspace

Interview guides · University Of Missouri-Columbia

University Of Missouri-Columbia Software Engineer Interview Guide

University Of Missouri-Columbia Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

The Software Engineer role at the University Of Missouri-Columbia is a vital position situated at the intersection of technology, education, and public service. In this role, you will design, develop, and maintain software systems that support the academic, research, and administrative missions of one of the nation's leading public research universities. Your work will directly impact thousands of students, faculty members, and researchers by ensuring that critical digital infrastructure remains robust, accessible, and secure. Unlike software roles in purely commercial environments, a Software Engineer at a major university operates within a highly collaborative and mission-driven ecosystem. You will contribute to diverse projects, which may range from enterprise student information systems and research data portals to custom learning management tools and administrative workflows.

This guide is scoped to a Software Engineer candidate at University Of Missouri-Columbia.

Focus areas

  • Data Structures: Arrays
  • Technical Interview Problem Solving
  • Algorithms: Iteration (Loops)

The University Of Missouri-Columbia interview process

University Of Missouri-Columbia candidates report 2 rounds over 2-4 weeks. The stages below are what candidates describe, not a published process.

Initial Screening

Begin with an online assessment that includes multiple-choice questions on software quality and testing concepts.

What to demonstrate

  • Begin with an online assessment that includes multiple-choice questions on software quality and testing concepts
  • Depth in Data Structures: Arrays

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 and Behavioral Conversations

Engage in discussions with the hiring team, including peer developers and senior engineers.

What to demonstrate

  • Engage in discussions with the hiring team
  • Including peer developers and senior engineers

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 technical and behavioral conversations above and write down what you would ask to confirm before it.

Where candidates lose points

Emphasize clean code

When writing code during your technical assessment or interview, prioritize clarity, proper variable naming, and simple logic. Avoid overly complex optimization unless explicitly asked.

Review database basics

Be ready to write basic SQL queries and explain database concepts. Relational databases are central to many university systems, and your comfort with them is highly valued.

Saying 'eventually consistent' without naming the anomaly a user would see

Describe the concrete symptom you are choosing to accept: the author reloads and their own comment is missing for two seconds, or two devices show different balances for a minute. The class of consistency model is a technical label; the tolerable anomaly is the actual product decision.

Questions & practice

Explain how you would implement a two-pointer approach to solve an array-related problem.

Medium · Coding & Algorithmic Problem-Solving

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?

Write a simple program to find duplicate elements in an array using basic loops.

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

Explain the difference between a while loop and a do-while loop, and when you would use each.

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

What are your career preferences, and what kind of work environment helps you perform at your best?

Medium · Behavioral & Cultural Alignment

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?

Explain the concept of database normalization and why it is important in a Database Management System (DBMS).

Medium · Computer Science Fundamentals

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?

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?

What are the four main pillars of Object-Oriented Programming (OOP), and how have you applied them in a recent

Medium · Computer Science Fundamentals

What are the four main pillars of Object-Oriented Programming (OOP), and how have you applied them in a recent project?

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?

What is the difference between unit testing and integration testing, and how do you approach writing test case

Medium · Computer Science Fundamentals

What is the difference between unit testing and integration testing, and how do you approach writing test cases?

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?

Explain the role of primary keys and foreign keys in maintaining relational database integrity.

Medium · Computer Science Fundamentals

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?

Walk me through the architecture of a major project on your resume. What technical challenges did you face, an

Medium · Experience & Project Walkthroughs

Walk me through the architecture of a major project on your resume. What technical challenges did you face, and how did you resolve them?

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?

What is your specific area of technical expertise, and how do you stay current with industry trends?

Medium · Experience & Project Walkthroughs

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 ensure code quality and maintainability in a collaborative team environment?

Medium · Experience & Project Walkthroughs

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?

One log partition stops advancing while the others drain

Easy · poison message · head-of-line blocking · consumer lag

Search results for a subset of tenants are hours stale; the rest are current. The projection consumer reports lag of zero on 15 of 16 partitions and 400,000 on one. Its error rate is flat and its CPU is idle. outbox_event has no pending rows older than a second, so the relay has published everything it holds. Identify the mechanism, give the ordered checks, and state what you do in the first ten minutes versus what you change permanently.

Approach

  1. Read the lag distribution first. A slow consumer lags everywhere; zero on fifteen partitions and 400,000 on one is not throughput. Idle CPU on the stuck partition means the consumer is not advancing its offset at all, which points at one message it cannot get past rather than at a rate problem.
  2. Exonerate the producer before touching the consumer. No pending outbox rows older than a second means the relay published, so the event exists in the log. This separates never sent from sent and never applied, which are different code paths and usually different owners.
  3. Read the message at the stuck offset and the handler's log lines for its event_id. A flat error rate with no progress has two explanations and you must distinguish them: the handler is throwing and the retry loop is swallowing it, or the handler is blocking on something and never returning. Idle CPU with no error lines favours the second.
  4. Mitigate before diagnosing further. Move the offending event to a dead-letter store and commit the offset past it. Adding consumers does nothing here, because a partition is consumed by exactly one member of the group, and the blast radius is every aggregate hashed to that partition, not only the aggregate that produced the bad event.

Follow-up

  • The dead-lettered event carried aggregate_version 7 and the projection had applied 6. What must the replay do differently if 8 and 9 landed in the meantime?
  • How do you show staleness to the user while the partition is behind, given the API already returns the projection's watermark?

Suggested practice checklist

Built from the rounds and topics University Of Missouri-Columbia candidates report.

Day 1 — Map the University Of Missouri-Columbia loop

  • Write out the reported sequence: Initial Screening, Technical and Behavioral Conversations.
  • 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 Data Structures: Arrays

  • Spend the session on Data Structures: Arrays, which University Of Missouri-Columbia candidates report being tested on.
  • Write one worked example in Data Structures: Arrays and time yourself on it.

Deliverable: One timed worked example in Data Structures: Arrays.

Day 3 — Work Technical Interview Problem Solving

  • Spend the session on Technical Interview Problem Solving, which University Of Missouri-Columbia candidates report being tested on.
  • Write one worked example in Technical Interview Problem Solving and time yourself on it.

Deliverable: One timed worked example in Technical Interview Problem Solving.

Day 4 — Work Algorithms: Iteration (Loops)

  • Spend the session on Algorithms: Iteration (Loops), which University Of Missouri-Columbia candidates report being tested on.
  • Write one worked example in Algorithms: Iteration (Loops) and time yourself on it.

Deliverable: One timed worked example in Algorithms: Iteration (Loops).

Day 5 — Answer out loud: Coding & Algorithmic Problem-Solving

  • Answer aloud, timed: Explain how you would implement a two-pointer approach to solve an array-related problem.
  • Answer aloud, timed: Write a simple program to find duplicate elements in an array using basic loops.

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

Day 6 — Answer out loud: Computer Science Fundamentals

  • Answer aloud, timed: What are the four main pillars of Object-Oriented Programming (OOP), and how have you applied them in a recent project?
  • Answer aloud, timed: Explain the concept of database normalization and why it is important in a Database Management System (DBMS).

Deliverable: Spoken answers to 2 reported Computer Science Fundamentals question(s), under time.

Day 7 — Answer out loud: Experience & Project Walkthroughs

  • Answer aloud, timed: Walk me through the architecture of a major project on your resume. What technical challenges did you face, and how did you resolve them?
  • Answer aloud, timed: What is your specific area of technical expertise, and how do you stay current with industry trends?

Deliverable: Spoken answers to 2 reported Experience & Project Walkthroughs question(s), under time.

Behavioural preparation

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

How do you handle boundary conditions when traversing a multi-dimensional array?

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

Describe a time when you had to work with a legacy codebase. How did you approach understanding and modifying

Medium · Experience & Project Walkthroughs

Describe a time when you had to work with a legacy codebase. How did you approach understanding and modifying 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?

Why did you choose to apply for this Software Engineer position at the University Of Missouri-Columbia?

Medium · Behavioral & Cultural Alignment

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 have a technical disagreement with a senior developer?

Medium · Behavioral & Cultural Alignment

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?

What entry-level salary or compensation expectations do you have for this role?

Medium · Behavioral & Cultural Alignment

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?