As a Software Engineer at Davidson Consulting España, you are at the intersection of high-level technical architecture and strategic business impact. You will not simply be writing code; you will be acting as a key contributor to national and international projects, working within a horizontal organizational structure that prizes technical excellence, innovation, and direct collaboration with both product teams and R&D partners. The role demands a balance of deep technical rigor and an ability to communicate complex solutions to non-technical stakeholders. Whether you are implementing backend services, refining frontend user experiences, or integrating AI-driven insights into product flows, your work directly shapes the digital capabilities of our clients. We look for engineers who are not only proficient in modern stacks but also deeply invested in the "how" and "why" of software design—championing clean code, test-driven development, and the reduction of technical debt. ##### Tip Davidson Consulting España prides itself on a culture of transparency and human-centric management. You will find that our interviewers value your professional journey and your ability to articulate your career aspirations as much as your technical proficiency.
Initial Discovery Phase
reportedThe process begins with an initial discovery phase to assess mutual fit.
What to demonstrate
- The process begins with an initial discovery phase to assess mutual fit
- Depth in Entretiens techniques
How to prepare
- Answer aloud and timed: How do you approach the design of a scalable API from scratch?
- Answer aloud and timed: Can you explain your experience with SOLID principles and how you apply them in a real-world project?
Technical Validation
reportedCandidates undergo technical validation to evaluate their skills and expertise.
What to demonstrate
- Candidates undergo technical validation to evaluate their skills and expertise
- Depth in Entretiens techniques
How to prepare
- Answer aloud and timed: How do you balance the need for rapid feature delivery with the necessity of reducing technical debt?
- Answer aloud and timed: Describe a time you had to choose between two different technologies or architectures. How did you make your decision?
Management Interviews
reportedInterviews with management to assess cultural alignment and professional fit.
What to demonstrate
- Interviews with management to assess cultural alignment and professional fit
- Depth in Entretiens techniques
How to prepare
- Answer aloud and timed: What is your strategy for testing, and how do you ensure the code you ship is maintainable?
- Answer aloud and timed: Tell us about your professional journey and why you are interested in a consulting role with us.
Client-Side Interviews
reportedCritical interviews with clients that transition candidates to potential consultants.
What to demonstrate
- Critical interviews with clients that transition candidates to potential consultants
- Depth in Entretiens techniques
How to prepare
- Answer aloud and timed: How do you handle disagreements within a team regarding technical implementation?
- Answer aloud and timed: Describe a situation where you had to explain a complex technical issue to a non-technical stakeholder.
Final Offer
reportedCandidates receive a final offer if all previous steps are successfully completed.
What to demonstrate
- Candidates receive a final offer if all previous steps are successfully completed
- Depth in Entretiens techniques
How to prepare
- Answer aloud and timed: What do you look for in a team and a work environment to stay motivated?
- Answer aloud and timed: How do you handle feedback, and can you provide an example of how you improved based on a critique?
PracHub editorial advice for the preparation topics above.
Be Transparent
Our interviewers value honesty. If you don’t know an answer, explain how you would find it rather than guessing.
Prepare Your "Why
Have a clear narrative for why you are interested in consulting and why Davidson Consulting España specifically.
Ask Questions
Use the interview to learn about the team, the challenges they face, and the company’s vision. A candidate who asks insightful questions is a candidate who shows they are already thinking like a consultant.
Follow Up
If you are promised a follow-up, feel free to politely reach out if the timeline passes. We value candidates who show engagement and persistence.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Merge partitioned event streams into one ordered feed with bounded lateness
The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.
Approach
- Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
- Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
- Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
- Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.
Follow-up
- The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
- The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?
Find overlapping job attempts and peak concurrency from lease records
A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.
Approach
- Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
- For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
- For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
- Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.
Follow-up
- A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
- Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?
Diff a projection against the primary without per-row point reads
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
- 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.
- 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.
- 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.
- 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?
Keep soft-deleted accounts from blocking re-registration
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
- 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.
- 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.
- 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.
- 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?
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?
How do you approach the design of a scalable API from scratch?
How do you approach the design of a scalable API from scratch?
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 balance the need for rapid feature delivery with the necessity of reducing technical debt?
How do you balance the need for rapid feature delivery with the necessity of reducing technical debt?
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 is your strategy for testing, and how do you ensure the code you ship is maintainable?
What is your strategy for testing, and how do you ensure the code you ship is maintainable?
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?
Read latency spikes on a sixty-second sawtooth
The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.
Approach
- Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
- Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
- Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
- De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.
Follow-up
- The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
- How does your answer change if the recompute takes 4 seconds instead of 250 ms?
Built from the rounds and topics Davidson Consulting España candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Davidson Consulting España loop
- Write out the reported sequence: Initial Discovery Phase, Technical Validation, Management Interviews, Client-Side Interviews, Final Offer.
- 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.
02Work Entretiens techniques
- Spend the session on Entretiens techniques, which Davidson Consulting España candidates report being tested on.
- Write one worked example in Entretiens techniques and time yourself on it.
Deliverable: One timed worked example in Entretiens techniques.
03Work Tests de programmation (coding game / test technique)
- Spend the session on Tests de programmation (coding game / test technique), which Davidson Consulting España candidates report being tested on.
- Write one worked example in Tests de programmation (coding game / test technique) and time yourself on it.
Deliverable: One timed worked example in Tests de programmation (coding game / test technique).
04Work Résolution de problèmes (problem solving)
- Spend the session on Résolution de problèmes (problem solving), which Davidson Consulting España candidates report being tested on.
- Write one worked example in Résolution de problèmes (problem solving) and time yourself on it.
Deliverable: One timed worked example in Résolution de problèmes (problem solving).
05Answer out loud: Technical & Architectural Proficiency
- Answer aloud, timed: How do you approach the design of a scalable API from scratch?
- Answer aloud, timed: Can you explain your experience with SOLID principles and how you apply them in a real-world project?
Deliverable: Spoken answers to 2 reported Technical & Architectural Proficiency question(s), under time.
06Answer out loud: Behavioral & Cultural Alignment
- Answer aloud, timed: Tell us about your professional journey and why you are interested in a consulting role with us.
- Answer aloud, timed: How do you handle disagreements within a team regarding technical implementation?
Deliverable: Spoken answers to 2 reported Behavioral & Cultural Alignment question(s), under time.
07Dry run for Davidson Consulting España
- 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.
Can you explain your experience with SOLID principles and how you apply them in a real-world project?
Can you explain your experience with SOLID principles and how you apply them in a real-world project?
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?
Describe a time you had to choose between two different technologies or architectures. How did you make your d
Describe a time you had to choose between two different technologies or architectures. How did you make your decision?
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 us about your professional journey and why you are interested in a consulting role with us.
Tell us about your professional journey and why you are interested in a consulting role with us.
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?
How do you handle disagreements within a team regarding technical implementation?
How do you handle disagreements within a team regarding technical implementation?
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?
Describe a situation where you had to explain a complex technical issue to a non-technical stakeholder.
Describe a situation where you had to explain a complex technical issue to a non-technical stakeholder.
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?
What do you look for in a team and a work environment to stay motivated?
What do you look for in a team and a work environment to stay motivated?
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?
How do you handle feedback, and can you provide an example of how you improved based on a critique?
How do you handle feedback, and can you provide an example of how you improved based on a critique?
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?
- 01
Can you explain your experience with SOLID principles and how you apply them in a real-world project?
- 02
Describe a time you had to choose between two different technologies or architectures. How did you make your decision?
- 03
Tell us about your professional journey and why you are interested in a consulting role with us.
- 04
How do you handle disagreements within a team regarding technical implementation?
How long does the hiring process usually take?
The timeline varies, but we aim for efficiency. From the first contact to an offer, the process can take anywhere from a week to a few weeks, depending on the availability of the teams and the specific project needs.
Davidson Consulting España Software Engineer candidate reports ↗Is the technical test a coding challenge or a system design interview?
It can be both. We often use technical assessments to gauge your coding proficiency, followed by discussions with managers or technical leads to explore your system design and architectural thinking.
Davidson Consulting España Software Engineer candidate reports ↗What is the culture like at Davidson Consulting España?
We describe our culture as horizontal and human-centric. We value transparency, and you will find that our management team is highly accessible and focused on your professional growth.
Davidson Consulting España Software Engineer candidate reports ↗Will I be working on a single project or multiple?
As a consultant, your exposure may vary. We prioritize finding missions that align with your career goals and technical interests, whether that involves long-term product ownership or specialized project-based work.
Davidson Consulting España Software Engineer candidate reports ↗What topics does Davidson Consulting España test in interviews?
Davidson Consulting España interviews most often cover Stakeholder Communication, Évaluation technique, Recruitment Process Management, Business Analysis, and Project Management. The exact emphasis depends on the specific role you apply for.
Davidson Consulting España 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.
- 01Davidson Consulting España 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.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
Together Ai Software Engineer Interview Guide
Failure-handling practice for Together Ai software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Spotify Software Engineer Interview Guide
Timed practice for Spotify software engineer candidates who lose time to the clock: short problems taken end to end, then reviewed against a written rubric rather than a passing test run.