cswork / libraryOpen practice workspace

Interview guides · Barrow Wise Consulting

Barrow Wise Consulting Software Engineer Interview Guide

Barrow Wise Consulting Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

As a Software Engineer at Barrow Wise Consulting, you serve as a vital technical driver across a diverse portfolio of specialized engineering disciplines. Whether you are architecting robust cloud solutions, developing scalable web and enterprise applications, or managing complex geographic and infrastructure systems, your work directly shapes the digital capabilities delivered to clients. This position demands a rare combination of versatile technical execution, deep domain expertise, and strategic foresight to solve complex technological challenges across various industries. Your daily impact reaches across multiple high-stakes technology domains, including full-stack development, cloud engineering, geographic information systems, enterprise resource planning, and infrastructure modernization.

This guide is scoped to a Software Engineer candidate at Barrow Wise Consulting.

Focus areas

  • AWS Cloud
  • DevSecOps
  • Cloud Infrastructure Engineering

The Barrow Wise Consulting interview process

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

Recruiter Conversation

Initial conversation to assess baseline qualifications.

What to demonstrate

  • Initial conversation to assess baseline qualifications
  • Depth in AWS Cloud

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 Deep Dives

In-depth technical discussions with senior engineering leaders.

What to demonstrate

  • In-depth technical discussions with senior engineering leaders
  • Depth in AWS Cloud

How to prepare

  • Answer aloud and timed: 1–2 sentences introducing the category and what it tests.
  • Answer aloud and timed: Bullet list of realistic example questions: How would you structure a monolithic legacy application for migration to a microservices architecture? Walk us through your strategy for ensuring fault tolerance and disaster recovery in enterprise applications. What factors do you consider when choosing between relational and non-relational data stores for a new project? How do you design systems to securely handle sensitive client data and maintain compliance standards?

Architectural Discussions

Conversations focusing on system architecture and design.

What to demonstrate

  • Conversations focusing on system architecture and design
  • Depth in AWS Cloud

How to prepare

  • Answer aloud and timed: 1–2 sentences introducing the category and what it tests.
  • Answer aloud and timed: Bullet list of realistic example questions: Tell me about a time you diagnosed a critical production bottleneck and resolved it under a tight deadline. How do you approach debugging an unfamiliar codebase when documentation is sparse? What steps do you take when a cloud infrastructure deployment fails unexpectedly in a staging environment?

Final Evaluations

Technical and behavioral evaluations to assess overall fit.

What to demonstrate

  • Technical and behavioral evaluations to assess overall fit
  • Depth in AWS Cloud

How to prepare

  • Answer aloud and timed: 1–2 sentences introducing the category and what it tests.
  • Answer aloud and timed: Bullet list of realistic example questions: Describe a situation where you had to explain a complex technical concept to a non-technical stakeholder. How do you manage conflicting priorities and tight delivery schedules when working across multiple client projects? Tell me about a time you disagreed with a team member on a technical direction and how you resolved it.

Where candidates lose points

Clarify requirements early

Always take a moment to ask clarifying questions before diving into a coding or system design problem. Interviewers value engineers who understand constraints before writing code.

Communicate your thought process

Think out loud during technical evaluations. Letting interviewers see how you analyze trade-offs is just as important as reaching the final solution.

Relate back to business impact

When discussing past projects, tie your technical decisions directly to business outcomes, efficiency gains, or solved client challenges.

Brush up on fundamentals

Do not neglect data structures, algorithms, and core computer science principles, as they form the bedrock of all technical evaluations.

Questions & practice

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

  1. 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.
  2. 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.
  3. 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.
  4. 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?

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

  1. 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.
  2. 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.
  3. 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.
  4. 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?

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?

Write the update path that detects a concurrent edit

Medium · optimistic concurrency · transactional outbox · audit history

resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.

Approach

  1. One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
  2. Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
  3. State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
  4. Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.

Follow-up

  • A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
  • Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.

Approach

  1. Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
  2. Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
  3. For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
  4. State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.

Follow-up

  • A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
  • How do you honour an erasure request while resource_revision.actor_user_id still references this table?

1–2 sentences introducing the category and what it tests.

Medium · Technical and Domain Expertise

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?

Bullet list of realistic example questions: Can you explain how you would design a scalable, highly available

Medium · Technical and Domain Expertise

Bullet list of realistic example questions: Can you explain how you would design a scalable, highly available cloud architecture using AWS services? What is your experience with object-oriented programming principles in enterprise.Net or Java environments? How do you optimize database queries and handle large datasets in a production web application? Describe your approach to implementing secure CI/CD pipelines and DevSecOps best practices. How do you handle spatial data indexing and performance tuning within a GIS development project?

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?

1–2 sentences introducing the category and what it tests.

Medium · System Design and 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?

Bullet list of realistic example questions: How would you structure a monolithic legacy application for migrat

Medium · System Design and Architecture

Bullet list of realistic example questions: How would you structure a monolithic legacy application for migration to a microservices architecture? Walk us through your strategy for ensuring fault tolerance and disaster recovery in enterprise applications. What factors do you consider when choosing between relational and non-relational data stores for a new project? How do you design systems to securely handle sensitive client data and maintain compliance standards?

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?

1–2 sentences introducing the category and what it tests.

Medium · Problem-Solving and Troubleshooting

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 Barrow Wise Consulting candidates report.

Day 1 — Map the Barrow Wise Consulting loop

  • Write out the reported sequence: Recruiter Conversation, Technical Deep Dives, Architectural Discussions, Final Evaluations.
  • 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 AWS Cloud

  • Spend the session on AWS Cloud, which Barrow Wise Consulting candidates report being tested on.
  • Write one worked example in AWS Cloud and time yourself on it.

Deliverable: One timed worked example in AWS Cloud.

Day 3 — Work DevSecOps

  • Spend the session on DevSecOps, which Barrow Wise Consulting candidates report being tested on.
  • Write one worked example in DevSecOps and time yourself on it.

Deliverable: One timed worked example in DevSecOps.

Day 4 — Work Cloud Infrastructure Engineering

  • Spend the session on Cloud Infrastructure Engineering, which Barrow Wise Consulting candidates report being tested on.
  • Write one worked example in Cloud Infrastructure Engineering and time yourself on it.

Deliverable: One timed worked example in Cloud Infrastructure Engineering.

Day 5 — Answer out loud: Technical and Domain Expertise

  • Answer aloud, timed: 1–2 sentences introducing the category and what it tests.
  • Answer aloud, timed: Bullet list of realistic example questions: Can you explain how you would design a scalable, highly available cloud architecture using AWS services? What is your experience with object-oriented programming principles in enterprise.Net or Java environments? How do you optimize database queries and handle large datasets in a production web application? Describe your approach to implementing secure CI/CD pipelines and DevSecOps best practices. How do you handle spatial data indexing and performance tuning within a GIS development project?

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

Day 6 — Answer out loud: System Design and Architecture

  • Answer aloud, timed: 1–2 sentences introducing the category and what it tests.
  • Answer aloud, timed: Bullet list of realistic example questions: How would you structure a monolithic legacy application for migration to a microservices architecture? Walk us through your strategy for ensuring fault tolerance and disaster recovery in enterprise applications. What factors do you consider when choosing between relational and non-relational data stores for a new project? How do you design systems to securely handle sensitive client data and maintain compliance standards?

Deliverable: Spoken answers to 2 reported System Design and Architecture question(s), under time.

Day 7 — Answer out loud: Problem-Solving and Troubleshooting

  • Answer aloud, timed: 1–2 sentences introducing the category and what it tests.
  • Answer aloud, timed: Bullet list of realistic example questions: Tell me about a time you diagnosed a critical production bottleneck and resolved it under a tight deadline. How do you approach debugging an unfamiliar codebase when documentation is sparse? What steps do you take when a cloud infrastructure deployment fails unexpectedly in a staging environment?

Deliverable: Spoken answers to 2 reported Problem-Solving and Troubleshooting question(s), under time.

Behavioural preparation

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

Bullet list of realistic example questions: Tell me about a time you diagnosed a critical production bottlenec

Medium · Problem-Solving and Troubleshooting

Bullet list of realistic example questions: Tell me about a time you diagnosed a critical production bottleneck and resolved it under a tight deadline. How do you approach debugging an unfamiliar codebase when documentation is sparse? What steps do you take when a cloud infrastructure deployment fails unexpectedly in a staging environment?

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?

1–2 sentences introducing the category and what it tests.

Medium · Behavioral and Collaboration

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?

Bullet list of realistic example questions: Describe a situation where you had to explain a complex technical

Medium · Behavioral and Collaboration

Bullet list of realistic example questions: Describe a situation where you had to explain a complex technical concept to a non-technical stakeholder. How do you manage conflicting priorities and tight delivery schedules when working across multiple client projects? Tell me about a time you disagreed with a team member on a technical direction and how you resolved 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?