Interview guides · Logicalis Spain
Logicalis Spain Software Engineer Interview Guide
Logicalis Spain Software Engineer interview guide: reported rounds, questions and how candidates describe the process.
The 60-second brief
A Software Engineer at Logicalis Spain plays a critical role in designing, developing, and integrating software solutions that drive digital transformation for global enterprise clients. Operating as a premier IT solutions and managed services provider, Logicalis Spain relies on its engineering teams to bridge the gap between complex cloud infrastructure, data orchestration, and robust software applications. You will not write code in a vacuum; instead, your work will directly empower clients to automate operations, migrate legacy workloads, and optimize their cloud environments. The impact of this position is felt across major industries, as the software and integration pipelines you build ensure high availability, security, and scalability.
This guide is scoped to a Software Engineer candidate at Logicalis Spain.
Focus areas
- Azure (cloud)
- Linux
- OSI model
The Logicalis Spain interview process
Logicalis Spain candidates report 4 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.
Initial Screening
A recruiter or headhunter validates your background, career goals, and alignment with the role.
What to demonstrate
- A recruiter or headhunter validates your background, career goals, and alignment with the role
- Depth in Azure (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 Screening
Includes a practical test, review of key technical terms, or a scenario-based discussion with a technical lead.
What to demonstrate
- Includes a practical test, review of key technical terms, or a scenario-based discussion with a technical lead
- Depth in Azure (cloud)
How to prepare
- Answer aloud and timed: What mechanisms would you implement to ensure high availability and redundancy for critical components on a cloud server?
- Answer aloud and timed: How do you manage and analyze system logs in a Linux environment to troubleshoot a failing deployment?
Deep Technical Evaluation
Conducted by senior engineers or directors, focusing on technical and architectural skills.
What to demonstrate
- Conducted by senior engineers or directors
- Focusing on technical and architectural skills
How to prepare
- Answer aloud and timed: Describe the step-by-step system boot process in a standard Linux distribution.
- Answer aloud and timed: Walk me through the layers of the OSI model and explain how data flows from the physical layer to the application layer.
Team Fit Conversation
Discussions centered on team fit and daily operational expectations.
What to demonstrate
- Discussions centered on team fit and daily operational expectations
- Depth in Azure (cloud)
How to prepare
- Prepare two projects you led end to end, each with the decision you owned and what it cost.
- Have three questions about the team's roadmap and how success is measured in the first six months.
Where candidates lose points
Brush up on the basics
Do not neglect fundamental concepts. Make sure you can confidently explain the OSI model, Linux log locations, and basic routing concepts, even if you are applying for a pure software development role.
Highlight your Azure expertise
Logicalis Spain has a strong partnership with Microsoft. Be ready to discuss your hands-on experience with Microsoft Azure and how you have used it to solve real-world problems.
Be client-oriented
Frame your technical achievements in terms of business value. Explain how your work helped save costs, improve system performance, or enhance security for your previous employers or clients.
Questions & practice
Merge partitioned event streams into one ordered feed with bounded lateness
Hard · k-way merge · watermarks · out-of-order streams
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?
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
- 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.
- 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.
- 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.
- 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?
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
- 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.
- 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.
- 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.
- 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?
Denormalise tenant onto revisions and backfill it live
Hard · denormalisation · online migration · backfill
resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.
Approach
- Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
- Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
- Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
- Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.
Follow-up
- The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
- How do you verify the backfill actually finished, given rows are still being inserted while it runs?
Stop tag and share joins from fanning out a page
Medium · join fan-out · semi-joins · many-to-many
resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.
Approach
- Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
- Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
- Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
- Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.
Follow-up
- The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
- A resource can be shared with the same user twice under different permissions. Does your count change, and should it?
What level of Microsoft Azure have you learned, and how would you apply this knowledge to solve a client's clo
Medium · Cloud & Infrastructure Automation
What level of Microsoft Azure have you learned, and how would you apply this knowledge to solve a client's cloud migration challenges?
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?
Can you explain the difference between L1 and L3 support/engineering responsibilities in an enterprise infrast
Medium · Cloud & Infrastructure Automation
Can you explain the difference between L1 and L3 support/engineering responsibilities in an enterprise infrastructure context?
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?
What mechanisms would you implement to ensure high availability and redundancy for critical components on a cl
Medium · Cloud & Infrastructure Automation
What mechanisms would you implement to ensure high availability and redundancy for critical components on a cloud server?
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?
Describe the step-by-step system boot process in a standard Linux distribution.
Medium · Cloud & Infrastructure Automation
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?
Walk me through the layers of the OSI model and explain how data flows from the physical layer to the applicat
Medium · Networking & Systems Fundamentals
Walk me through the layers of the OSI model and explain how data flows from the physical layer to the application layer.
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 IPMI (Intelligent Platform Management Interface), and how is it utilized for out-of-band management of
Medium · Networking & Systems Fundamentals
What is IPMI (Intelligent Platform Management Interface), and how is it utilized for out-of-band management of physical servers?
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?
Looking at a basic network diagram, how would you identify potential single points of failure?
Medium · Networking & Systems Fundamentals
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?
Describe a scenario where you had to design a data ingestion pipeline from multiple disparate sources.
Medium · Data Integration & ETL
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?
What strategies do you use to optimize the performance of high-volume data ingestion workflows?
Medium · Data Integration & ETL
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- 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?
How do you balance meeting tight project deadlines with maintaining high code quality and architectural standa
Medium · Behavioral & Professional Experience
How do you balance meeting tight project deadlines with maintaining high code quality and architectural standards?
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 manage and analyze system logs in a Linux environment to troubleshoot a failing deployment?
Medium · Cloud & Infrastructure Automation
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?
How would you diagnose a connectivity issue between a software application and a database using standard netwo
Medium · Networking & Systems Fundamentals
How would you diagnose a connectivity issue between a software application and a database using standard network troubleshooting tools?
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?
Suggested practice checklist
Built from the rounds and topics Logicalis Spain candidates report.
Day 1 — Map the Logicalis Spain loop
- Write out the reported sequence: Initial Screening, Technical Screening, Deep Technical Evaluation, Team Fit Conversation.
- 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 Azure (cloud)
- Spend the session on Azure (cloud), which Logicalis Spain candidates report being tested on.
- Write one worked example in Azure (cloud) and time yourself on it.
Deliverable: One timed worked example in Azure (cloud).
Day 3 — Work Linux
- Spend the session on Linux, which Logicalis Spain candidates report being tested on.
- Write one worked example in Linux and time yourself on it.
Deliverable: One timed worked example in Linux.
Day 4 — Work OSI model
- Spend the session on OSI model, which Logicalis Spain candidates report being tested on.
- Write one worked example in OSI model and time yourself on it.
Deliverable: One timed worked example in OSI model.
Day 5 — Answer out loud: Cloud & Infrastructure Automation
- Answer aloud, timed: What level of Microsoft Azure have you learned, and how would you apply this knowledge to solve a client's cloud migration challenges?
- Answer aloud, timed: Can you explain the difference between L1 and L3 support/engineering responsibilities in an enterprise infrastructure context?
Deliverable: Spoken answers to 2 reported Cloud & Infrastructure Automation question(s), under time.
Day 6 — Answer out loud: Networking & Systems Fundamentals
- Answer aloud, timed: Walk me through the layers of the OSI model and explain how data flows from the physical layer to the application layer.
- Answer aloud, timed: How would you diagnose a connectivity issue between a software application and a database using standard network troubleshooting tools?
Deliverable: Spoken answers to 2 reported Networking & Systems Fundamentals question(s), under time.
Day 7 — Answer out loud: Data Integration & ETL
- Answer aloud, timed: Describe a scenario where you had to design a data ingestion pipeline from multiple disparate sources.
- Answer aloud, timed: How do you handle data transformation and schema validation in an ETL process when dealing with inconsistent source data?
Deliverable: Spoken answers to 2 reported Data Integration & ETL question(s), under time.
Behavioural preparation
Behavioural rounds judge the decision you made and what it cost.
How do you handle data transformation and schema validation in an ETL process when dealing with inconsistent s
Medium · Data Integration & ETL
How do you handle data transformation and schema validation in an ETL process when dealing with inconsistent source data?
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 is your most significant past professional achievement, and what specific value can you bring to the engi
Medium · Behavioral & Professional Experience
What is your most significant past professional achievement, and what specific value can you bring to the engineering team at Logicalis Spain?
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 me about a time when you had to work with a technology you had no prior experience with. How did you get
Medium · Behavioral & Professional Experience
Tell me about a time when you had to work with a technology you had no prior experience with. How did you get up to speed?
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?
Why are you looking to change your current job, and what specifically attracts you to the work we do at Logica
Medium · Behavioral & Professional Experience
Why are you looking to change your current job, and what specifically attracts you to the work we do at Logicalis Spain?
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?