Appspace Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Appspace, you are at the forefront of developing innovative solutions that enhance workplace communication and collaboration. This role is critical to the success of the company as you will contribute to a suite of products designed to streamline information delivery through digital signage, room scheduling, and mobile applications. Your work directly impacts users by improving their interaction with technology in their work environment, making their day-to-day tasks more efficient and engaging. In this dynamic role, you will be tackling complex challenges that require a strong understanding of software development principles, excellent problem-solving skills, and a collaborative mindset. You will work with cross-functional teams to design, implement, and maintain robust software solutions that cater to diverse client needs.

This guide is scoped to a Software Engineer candidate at Appspace.

Focus areas

• C#
• Technical Coding Skills
• Code Challenges

The Appspace interview process

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

Phone Screening

Initial call where a recruiter gauges your background and interest in the position.

What to demonstrate

• Initial call where a recruiter gauges your background and interest in the position
• Depth in C#

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.

Coding Challenge

Candidates complete a coding challenge that tests their technical skills in a practical context.

What to demonstrate

• Candidates complete a coding challenge that tests their technical skills in a practical context
• Depth in C#

How to prepare

• Answer aloud and timed: How do you approach debugging a piece of software?
• Answer aloud and timed: Given a list of integers, how would you find the two numbers that add up to a specific target?

Technical Interviews

One or more rounds of interviews focusing on past experiences, technical expertise, and problem-solving.

What to demonstrate

• One or more rounds of interviews focusing on past experiences, technical expertise, and problem-solving
• Depth in C#

How to prepare

• Answer aloud and timed: Write a function to determine if a string is a palindrome.
• Answer aloud and timed: Describe your approach to optimizing a slow-running SQL query.

Where candidates lose points

Prepare for coding assessments

Brush up on data structures and algorithms, as you will likely face technical challenges that require you to think on your feet.

Practice behavioral questions

Reflect on your past experiences and how they align with Appspace’s values to articulate your cultural fit effectively.

Engage with your interviewers

Treat interviews as a two-way conversation. Ask insightful questions to demonstrate your interest and understanding of the company.

Showcase your passion for technology

Be prepared to discuss personal projects or recent technologies you are excited about, as this reflects your commitment to the field.

Questions & practice

Given a list of integers, how would you find the two numbers that add up to a specific target?

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?

Write a function to determine if a string is a palindrome.

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?

Diff a projection against the primary without per-row point reads

Hard · reconciliation · range hashing · throttling

The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.

Approach

1. Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
2. Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
3. For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
4. Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.

Follow-up

• The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
• Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?

Describe your approach to optimizing a slow-running SQL query.

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?

Replace offset paging on the resource feed with keyset

Easy · keyset pagination · composite index · sort order

resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.

Approach

1. Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
2. Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
3. Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
4. Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.

Follow-up

• The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
• Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?

What programming languages are you most proficient in, and why?

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?

Explain the difference between object-oriented programming and functional programming.

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 URL shortening service?

Medium · System Design / Architecture

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?

Discuss the architecture of a web application you have previously worked on.

Medium · System Design / Architecture

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 considerations would you take into account when designing a system for high availability?

Medium · System Design / Architecture

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?

How would you approach developing a feature that requires integration with a third-party API?

Medium · Problem-Solving / Case Studies

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?

Describe how you would handle a sudden spike in user traffic for an application.

Medium · Problem-Solving / Case Studies

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 approach debugging a piece of software?

Medium · Technical / Domain Questions

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 Appspace candidates report.

Day 1 — Map the Appspace loop

• Write out the reported sequence: Phone Screening, Coding Challenge, Technical Interviews.
• 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 3 reported rounds, with the weakest marked.

Day 2 — Work C#

• Spend the session on C#, which Appspace candidates report being tested on.
• Write one worked example in C# and time yourself on it.

Deliverable: One timed worked example in C#.

Day 3 — Work Technical Coding Skills

• Spend the session on Technical Coding Skills, which Appspace candidates report being tested on.
• Write one worked example in Technical Coding Skills and time yourself on it.

Deliverable: One timed worked example in Technical Coding Skills.

Day 4 — Work Code Challenges

• Spend the session on Code Challenges, which Appspace candidates report being tested on.
• Write one worked example in Code Challenges and time yourself on it.

Deliverable: One timed worked example in Code Challenges.

Day 5 — Answer out loud: Technical / Domain Questions

• Answer aloud, timed: What programming languages are you most proficient in, and why?
• Answer aloud, timed: Explain the difference between object-oriented programming and functional programming.

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

Day 6 — Answer out loud: Coding / Algorithms

• Answer aloud, timed: Given a list of integers, how would you find the two numbers that add up to a specific target?
• Answer aloud, timed: Write a function to determine if a string is a palindrome.

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

Day 7 — Answer out loud: Behavioral / Leadership

• Answer aloud, timed: Describe a challenging project you worked on. How did you handle the obstacles?
• Answer aloud, timed: How do you prioritize tasks when you have multiple deadlines?

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

Behavioural preparation

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

Describe a challenging project you worked on. How did you handle the obstacles?

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?

Can you give an example of how you've contributed to a team’s success?

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?