A Software Engineer at RPI/Blurb operates at the intersection of creative expression and robust technical infrastructure. You are responsible for building and maintaining the platforms that empower millions of users to create, publish, and sell high-quality books and digital content. Your work directly impacts the user experience, ensuring that complex publishing workflows feel intuitive and seamless for our global community. This role requires a blend of creative problem-solving and technical precision. You will contribute to the full software development lifecycle, from architecting scalable backend services to crafting responsive frontend interfaces. At RPI/Blurb, we value engineers who are not just coders, but product thinkers who care deeply about the end-to-end reliability and performance of our tools. ##### Tip We look for engineers who are excited by the challenge of balancing rapid feature delivery with long-term system stability. Your ability to communicate technical trade-offs to non-technical stakeholders is just as vital as your coding proficiency.
HR Screen
reportedInitial screening by HR to assess candidate fit and discuss the role.
What to demonstrate
- Initial screening by HR to assess candidate fit and discuss the role
- Depth in Java
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 Evaluation
reportedEngagement with technical leads to evaluate coding skills and problem-solving abilities.
What to demonstrate
- Engagement with technical leads to evaluate coding skills and problem-solving abilities
- Depth in Java
How to prepare
- Answer aloud and timed: What are the trade-offs between different data structures for a high-frequency retrieval system?
- Answer aloud and timed: How do you approach debugging a production issue in a distributed environment?
Management Discussion
reportedDiscussion with management to assess cultural alignment and past project experiences.
What to demonstrate
- Discussion with management to assess cultural alignment and past project experiences
- Depth in Java
How to prepare
- Answer aloud and timed: Can you describe a time you had to optimize a piece of code that was performing poorly?
- Answer aloud and timed: Implement a function to reverse a custom linked list structure.
PracHub editorial advice for the preparation topics above.
Think Aloud
Always verbalize your thought process during coding rounds. It allows interviewers to understand your logic even if you get stuck.
Ask Clarifying Questions
Before jumping into a solution, ask about constraints or edge cases to demonstrate that you are a thoughtful engineer.
Review Your Past Work
Be prepared to discuss your previous projects in detail, including the challenges you faced and how you overcame them.
If you don't know an answer, be honest
It is better to explain how you would find the answer than to guess incorrectly.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Implement a function to reverse a custom linked list structure.
Implement a function to reverse a custom linked list structure.
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?
Given a set of requirements, write a class structure that adheres to SOLID principles.
Given a set of requirements, write a class structure that adheres to SOLID principles.
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?
Refactor a provided snippet of code to improve readability and efficiency.
Refactor a provided snippet of code to improve readability and efficiency.
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?
Explain the logic behind your solution to the coding problem shared during the screen.
Explain the logic behind your solution to the coding problem shared during the screen.
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?
Replace offset paging on the resource feed with keyset
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
- 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.
- 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.
- 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.
- 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?
Explain why the owner filter ignores the listing index
The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.
Approach
- Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
- For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
- Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
- Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.
Follow-up
- 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
- A dashboard runs this for 40 owners in one page load. What changes about the design?
Explain the difference between an interface and an abstract class in Java.
Explain the difference between an interface and an abstract class in Java.
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 are the trade-offs between different data structures for a high-frequency retrieval system?
What are the trade-offs between different data structures for a high-frequency retrieval system?
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?
How would you design an algorithm to handle concurrent requests to a shared resource?
How would you design an algorithm to handle concurrent requests to a shared resource?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 do you approach debugging a production issue in a distributed environment?
How do you approach debugging a production issue in a distributed environment?
Approach
- Establish what changed and when, before forming any theory.
- Pick a bisection that eliminates candidates whichever way it turns out.
- Check the instrumentation before believing the symptom.
- 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?
Built from the rounds and topics RPI/Blurb candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the RPI/Blurb loop
- Write out the reported sequence: HR Screen, Technical Evaluation, Management 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 3 reported rounds, with the weakest marked.
02Work Java
- Spend the session on Java, which RPI/Blurb candidates report being tested on.
- Write one worked example in Java and time yourself on it.
Deliverable: One timed worked example in Java.
03Work Problem solving
- Spend the session on Problem solving, which RPI/Blurb candidates report being tested on.
- Write one worked example in Problem solving and time yourself on it.
Deliverable: One timed worked example in Problem solving.
04Work Coding interviews
- Spend the session on Coding interviews, which RPI/Blurb candidates report being tested on.
- Write one worked example in Coding interviews and time yourself on it.
Deliverable: One timed worked example in Coding interviews.
05Answer out loud: Core Technical Proficiency
- Answer aloud, timed: Explain the difference between an interface and an abstract class in Java.
- Answer aloud, timed: How do you handle memory management in your preferred language?
Deliverable: Spoken answers to 2 reported Core Technical Proficiency question(s), under time.
06Answer out loud: Coding and Implementation
- Answer aloud, timed: Implement a function to reverse a custom linked list structure.
- Answer aloud, timed: How would you design an algorithm to handle concurrent requests to a shared resource?
Deliverable: Spoken answers to 2 reported Coding and Implementation question(s), under time.
07Dry run for RPI/Blurb
- 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.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
How do you handle memory management in your preferred language?
How do you handle memory management in your preferred language?
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?
Can you describe a time you had to optimize a piece of code that was performing poorly?
Can you describe a time you had to optimize a piece of code that was performing poorly?
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?
Tell callers you do not own that their integration breaks
A field in a write endpoint's response must change shape. You own the endpoint; you do not own the four internal callers or the outbound webhook consumers who read it. Describe a deprecation you were responsible for: what you shipped first, how you established who was actually reading the field, the window you gave and what set its length, what you did about the consumer who never moved, and how you decided removal was safe. Name the signal you used, not the announcement you sent.
Approach
- Establish the reader set empirically rather than from a wiki of owners: per-field usage counters keyed by principal, or access logs attributed to a consumer. State the blind spot of whichever you pick, since a consumer that reads the field only on a monthly job will not appear in a week of logs.
- Ship additive first. Populate the new field alongside the old one so no reader is forced to move, which is also what keeps a rolling deploy safe, because old and new instances answer the same requests at the same time and a rollback must still find the old shape present.
- Set the window from the slowest legitimate consumer's release cadence, not from your calendar, and decide separately what to do for a consumer with no release process at all, such as an external webhook endpoint you can only email.
- Convert silence into evidence before you rely on it: a short, low-traffic removal window that makes a still-dependent consumer fail visibly and loudly while you are watching, rather than at three in the morning after you have moved on.
Follow-up
- How would you detect a consumer that reads the field only during a monthly export?
- One caller refuses to move and has a commercial relationship behind it. What changes in your plan and what does not?
- 01
How do you handle memory management in your preferred language?
- 02
Can you describe a time you had to optimize a piece of code that was performing poorly?
- 03
A field in a write endpoint's response must change shape. You own the endpoint; you do not own the four internal callers or the outbound webhook consumers who read it. Describe a deprecation you were responsible for: what you shipped first, how you established who was actually reading the field, the window you gave and what set its length, what you did about the consumer who never moved, and how you decided removal was safe. Name the signal you used, not the announcement you sent.
How long should I prepare for the interview?
We recommend 2–3 weeks of focused review on core data structures and your primary programming language.
RPI/Blurb Software Engineer candidate reports ↗What is the company culture like?
RPI/Blurb is a welcoming and collaborative environment where technical excellence is balanced with a focus on user impact.
RPI/Blurb Software Engineer candidate reports ↗Will I be asked to whiteboard?
Most coding sessions are done via screen sharing, focusing on practical, runnable code rather than abstract whiteboard diagrams.
RPI/Blurb Software Engineer candidate reports ↗What topics does RPI/Blurb test in interviews?
RPI/Blurb interviews most often cover Java, Problem solving, Coding interviews, Data structures (Linked List), and Iterative improvement. The exact emphasis depends on the specific role you apply for.
RPI/Blurb Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01RPI/Blurb Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Confluent Software Engineer Interview Guide
Concurrency exercises for Confluent candidates: check-then-act races, deadlock from inconsistent lock ordering, and why two individually atomic operations do not compose into an atomic update.
GitHub Software Engineer Interview Questions & Guide 2026
Testing exercises for GitHub software engineer prep: choosing boundary cases over repetition, isolating tests from shared clock and ordering, and treating an intermittent failure as a defect rather than noise.
Zulily Software Engineer Interview Guide
What Zulily asks Software Engineer candidates, from reported rounds and questions.
Zoom Communications Software Engineer Interview Guide
What Zoom Communications asks Software Engineer candidates, from reported rounds and questions.