As a Software Engineer at Informa, you are at the intersection of data, intelligence, and global connectivity. Informa operates as a leader in international events, academic publishing, and business intelligence, meaning your work directly supports platforms that power global professional communities. You will be responsible for building, maintaining, and scaling the digital infrastructure that delivers critical insights to millions of users worldwide. This role is not just about writing code; it is about solving complex problems in a fast-paced, information-heavy environment. You will likely contribute to projects ranging from high-traffic event management portals to sophisticated data analysis tools. Because Informa relies on proprietary logic and diverse technology stacks, you will be expected to demonstrate both technical depth and the curiosity to navigate complex, legacy, or bespoke systems that define the company’s competitive advantage. ##### Tip Your ability to communicate technical concepts to non-technical stakeholders is often as highly valued as your coding proficiency at Informa.
Initial Screening
reportedFirst contact via email or phone to assess basic qualifications.
What to demonstrate
- First contact via email or phone to assess basic qualifications
- Depth in System/user feature design (social features)
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 Discussions
reportedIn-depth conversations focusing on your technical capabilities.
What to demonstrate
- In-depth conversations focusing on your technical capabilities
- Depth in System/user feature design (social features)
How to prepare
- Answer aloud and timed: Which frameworks are you most comfortable with, and why do you choose them over alternatives?
- Answer aloud and timed: How do you handle performance bottlenecks in a web application?
Team-Member Panels
reportedInterviews with various team members to evaluate fit and collaboration.
What to demonstrate
- Interviews with various team members to evaluate fit and collaboration
- Depth in System/user feature design (social features)
How to prepare
- Answer aloud and timed: Can you explain your experience with PHP, MySQL, and modern JavaScript frameworks?
- Answer aloud and timed: How would you design a "mutual friends" feature for a social platform?
Coding Exercises
reportedPractical coding tasks to demonstrate your programming skills.
What to demonstrate
- Practical coding tasks to demonstrate your programming skills
- Depth in System/user feature design (social features)
How to prepare
- Answer aloud and timed: What is your strategy for sorting large datasets, and which data structures do you prefer for efficiency?
- Answer aloud and timed: How do you approach the trade-offs between speed of delivery and code maintainability?
Final Decision
reportedReview of all interviews and discussions to make a hiring decision.
What to demonstrate
- Review of all interviews and discussions to make a hiring decision
- Depth in System/user feature design (social features)
How to prepare
- Answer aloud and timed: Describe a time you encountered a significant technical pitfall; how did you resolve it?
- Work System/user feature design (social features) until you can explain it without notes
PracHub editorial advice for the preparation topics above.
Show your personality
The interviewers are looking for a teammate, not just a coder. Be professional but personable.
Clarify salary early
Given past experiences, ensure you and the recruiter are on the same page regarding the salary range as early as possible.
Prepare questions
Always have 3–5 high-quality questions ready for your interviewers. This shows you have done your research and are serious about the role.
Review your past projects
Be able to talk about your technical failures as clearly as your successes. Honesty about what you learned from mistakes is highly valued.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
What is your strategy for sorting large datasets, and which data structures do you prefer for efficiency?
What is your strategy for sorting large datasets, and which data structures do you prefer for efficiency?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
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?
Archive a resource graph without breaking live references or recursing
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?
Explain why the owner filter ignores the listing index
The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.
Approach
- Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
- For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
- Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
- Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.
Follow-up
- 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
- A dashboard runs this for 40 owners in one page load. What changes about the design?
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?
Can you walk me through the architecture of a past project you are particularly proud of?
Can you walk me through the architecture of a past project you are particularly proud of?
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?
Which frameworks are you most comfortable with, and why do you choose them over alternatives?
Which frameworks are you most comfortable with, and why do you choose them over alternatives?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
How would you design a "mutual friends" feature for a social platform?
How would you design a "mutual friends" feature for a social platform?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How do you approach the trade-offs between speed of delivery and code maintainability?
How do you approach the trade-offs between speed of delivery and code maintainability?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How do you approach debugging when working with undocumented or proprietary codebases?
How do you approach debugging when working with undocumented or proprietary codebases?
Approach
- Establish what changed and when, before forming any theory.
- Pick a bisection that eliminates candidates whichever way it turns out.
- Check the instrumentation before believing the symptom.
- Separate the trigger from the cause; the deploy is rarely the bug.
Follow-up
- What would you look at first, and what would it rule out?
- How would you tell a cause from a coincidence here?
Built from the rounds and topics Informa candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Informa loop
- Write out the reported sequence: Initial Screening, Technical Discussions, Team-Member Panels, Coding Exercises, Final Decision.
- 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 System/user feature design (social features)
- Spend the session on System/user feature design (social features), which Informa candidates report being tested on.
- Write one worked example in System/user feature design (social features) and time yourself on it.
Deliverable: One timed worked example in System/user feature design (social features).
03Work Graph algorithms (social graph)
- Spend the session on Graph algorithms (social graph), which Informa candidates report being tested on.
- Write one worked example in Graph algorithms (social graph) and time yourself on it.
Deliverable: One timed worked example in Graph algorithms (social graph).
04Work Mutual friends feature design (scalability & data access)
- Spend the session on Mutual friends feature design (scalability & data access), which Informa candidates report being tested on.
- Write one worked example in Mutual friends feature design (scalability & data access) and time yourself on it.
Deliverable: One timed worked example in Mutual friends feature design (scalability & data access).
05Answer out loud: Technical & Domain Expertise
- Answer aloud, timed: Can you walk me through the architecture of a past project you are particularly proud of?
- Answer aloud, timed: How do you approach debugging when working with undocumented or proprietary codebases?
Deliverable: Spoken answers to 2 reported Technical & Domain Expertise question(s), under time.
06Answer out loud: Problem Solving & System Design
- Answer aloud, timed: How would you design a "mutual friends" feature for a social platform?
- Answer aloud, timed: What is your strategy for sorting large datasets, and which data structures do you prefer for efficiency?
Deliverable: Spoken answers to 2 reported Problem Solving & System Design question(s), under time.
07Dry run for Informa
- Run one full mock under time, then write down the two questions you most want to ask your interviewers.
Deliverable: A completed timed mock and two questions to ask.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
How do you handle performance bottlenecks in a web application?
How do you handle performance bottlenecks in a web application?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Can you explain your experience with PHP, MySQL, and modern JavaScript frameworks?
Can you explain your experience with PHP, MySQL, and modern JavaScript frameworks?
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 encountered a significant technical pitfall; how did you resolve it?
Describe a time you encountered a significant technical pitfall; how did you resolve it?
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
How do you handle performance bottlenecks in a web application?
- 02
Can you explain your experience with PHP, MySQL, and modern JavaScript frameworks?
- 03
Describe a time you encountered a significant technical pitfall; how did you resolve it?
How difficult are the technical interviews at Informa?
Most candidates find the technical interviews to be of average difficulty. They prioritize practical application and your ability to talk through your thought process rather than just solving abstract puzzles.
Informa Software Engineer candidate reports ↗What is the best way to stand out during the interview?
Be genuinely curious. Candidates who ask insightful questions about the company’s environment, the specific challenges the team is facing, and the strategic direction of the product tend to leave a much stronger impression.
Informa Software Engineer candidate reports ↗How long does the hiring process typically take?
The process can vary, but it generally involves a few rounds of calls or video interviews. Be prepared for a potential delay between your final interview and a formal offer; maintain open communication with your recruiter.
Informa Software Engineer candidate reports ↗Should I prepare for whiteboard coding?
While some teams may ask for coding exercises, the focus is often on real-world scenarios. Be ready to discuss how you would design features or debug issues in a collaborative setting.
Informa Software Engineer candidate reports ↗What topics does Informa test in interviews?
Informa interviews most often cover Communication Skills, Problem Solving, Quantitative Reasoning, Requirements Gathering, and Stakeholder Management. The exact emphasis depends on the specific role you apply for.
Informa 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.
- 01Informa 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.
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.
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.
Shopify Software Engineer Interview Guide
Timed practice for Shopify 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.
Ramp Software Engineer Interview Guide
Systems practice for Ramp software engineer candidates, weighted toward payments and lending work: the load that actually arrives, the failure modes that matter there, and the invariants a partial outage must not break.