cswork / libraryOpen practice workspace

Interview guides · HashedIn

HashedIn Software Engineer Interview Guide

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

The 60-second brief

At HashedIn by Deloitte, the Software Engineer role is central to our mission of delivering high-impact, cloud-native solutions to a global clientele. You are not just writing code; you are building scalable, resilient architectures that solve complex business problems for industry leaders. This role requires a blend of technical precision, architectural thinking, and a proactive mindset toward continuous learning. As a Software Engineer, you will operate within dynamic, cross-functional teams, often working on full-stack development projects that leverage modern frameworks like MERN (MongoDB, Express, React, Node.js). You will be expected to contribute to the entire software development lifecycle, from initial design and requirement gathering to deployment and maintenance.

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

Focus areas

  • MERN Stack
  • JavaScript
  • MongoDB

The HashedIn interview process

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

Initial Screening

Assess your background and alignment with the company's current needs.

What to demonstrate

  • Assess your background and alignment with the company's current needs
  • Depth in MERN Stack

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 Depth Assessment

Evaluate your technical skills through various coding assessments.

What to demonstrate

  • Evaluate your technical skills through various coding assessments
  • Depth in MERN Stack

How to prepare

  • Answer aloud and timed: Describe the differences between SQL and NoSQL databases and when you would choose one over the other for a specific project.
  • Answer aloud and timed: How do you ensure security in a Node.js API?

Design Capabilities Assessment

Test your ability to design systems and solve complex problems.

What to demonstrate

  • Test your ability to design systems and solve complex problems
  • Depth in MERN Stack

How to prepare

  • Answer aloud and timed: Explain the concept of middleware in the context of Express.js.
  • Answer aloud and timed: Walk me through your approach to optimizing a slow-performing database query.

Cultural Fit Evaluation

Determine how well you align with the company's values and team dynamics.

What to demonstrate

  • Determine how well you align with the company's values and team dynamics
  • Depth in MERN Stack

How to prepare

  • Answer aloud and timed: How do you handle asynchronous operations and error handling in a production-grade application?
  • Answer aloud and timed: Describe a time you encountered a critical bug in production; how did you debug and resolve it?

Final Offer Discussion

Discuss the offer details and next steps if you successfully pass previous rounds.

What to demonstrate

  • Discuss the offer details and next steps if you successfully pass previous rounds
  • Depth in MERN Stack

How to prepare

  • Answer aloud and timed: Write a function to deep-clone an object in JavaScript without using built-in libraries.
  • Answer aloud and timed: Tell me about a project where you had to learn a new technology on the fly to meet a deadline.

Where candidates lose points

Think Aloud

Your interviewer is more interested in your problem-solving process than the final line of code. Narrate your thoughts clearly as you work through a problem.

Prepare Your "Why

Be ready to explain your career choices and why you are specifically interested in HashedIn by Deloitte.

Review Your Projects

Be prepared to do a deep dive into any project you list on your resume. Know the architecture, the challenges you faced, and the results you achieved.

Questions & practice

Write a function to deep-clone an object in JavaScript without using built-in libraries.

Medium · Problem-Solving & Coding

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?

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?

Archive a resource graph without breaking live references or recursing

Medium · graph traversal · topological order · tenant isolation

Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.

Approach

  1. Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
  2. Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
  3. Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
  4. Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.

Follow-up

  • The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
  • The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?

Describe the differences between SQL and NoSQL databases and when you would choose one over the other for a sp

Medium · Technical & Domain Knowledge

Describe the differences between SQL and NoSQL databases and when you would choose one over the other for a specific project.

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?

Walk me through your approach to optimizing a slow-performing database query.

Medium · Problem-Solving & Coding

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?

Explain the core components of the MERN stack and how they interact in a real-world application.

Medium · Technical & Domain Knowledge

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 manage state in a complex React application?

Medium · Technical & Domain Knowledge

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 security in a Node.js API?

Medium · Technical & Domain Knowledge

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 concept of middleware in the context of Express.js.

Medium · Technical & Domain Knowledge

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 customer endpoint stalls deliveries to every other destination

Medium · bulkhead · timeouts · saturation

The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.

Approach

  1. Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
  2. Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
  3. Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
  4. Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.

Follow-up

  • The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
  • Where should the 10-second timeout number actually come from?

Suggested practice checklist

Built from the rounds and topics HashedIn candidates report.

Day 1 — Map the HashedIn loop

  • Write out the reported sequence: Initial Screening, Technical Depth Assessment, Design Capabilities Assessment, Cultural Fit Evaluation, Final Offer 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 5 reported rounds, with the weakest marked.

Day 2 — Work MERN Stack

  • Spend the session on MERN Stack, which HashedIn candidates report being tested on.
  • Write one worked example in MERN Stack and time yourself on it.

Deliverable: One timed worked example in MERN Stack.

Day 3 — Work JavaScript

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

Deliverable: One timed worked example in JavaScript.

Day 4 — Work MongoDB

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

Deliverable: One timed worked example in MongoDB.

Day 5 — Answer out loud: Technical & Domain Knowledge

  • Answer aloud, timed: Explain the core components of the MERN stack and how they interact in a real-world application.
  • Answer aloud, timed: How do you manage state in a complex React application?

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

Day 6 — Answer out loud: Problem-Solving & Coding

  • Answer aloud, timed: Walk me through your approach to optimizing a slow-performing database query.
  • Answer aloud, timed: How do you handle asynchronous operations and error handling in a production-grade application?

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

Day 7 — Answer out loud: Behavioral & Cultural Fit

  • Answer aloud, timed: Tell me about a project where you had to learn a new technology on the fly to meet a deadline.
  • Answer aloud, timed: How do you handle disagreements regarding architectural decisions within your team?

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

Behavioural preparation

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

How do you handle asynchronous operations and error handling in a production-grade application?

Medium · Problem-Solving & Coding

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 you encountered a critical bug in production; how did you debug and resolve it?

Medium · Problem-Solving & Coding

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?

Tell me about a project where you had to learn a new technology on the fly to meet a deadline.

Medium · Behavioral & Cultural Fit

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 disagreements regarding architectural decisions within your team?

Medium · Behavioral & Cultural Fit

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 are you interested in transitioning to HashedIn by Deloitte at this stage in your career?

Medium · Behavioral & Cultural Fit

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 situation where you had to explain a complex technical concept to a non-technical stakeholder.

Medium · Behavioral & Cultural Fit

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?