Interview guides · CRIF
CRIF Software Engineer Interview Guide
CRIF Software Engineer interview guide: reported rounds, questions and how candidates describe the process.
The 60-second brief
As a Software Engineer at CRIF, you are at the heart of a global company specializing in credit bureau, business information, and digital solutions. Your work directly impacts the financial stability of millions by building and maintaining high-scale systems that process complex data, manage credit risk, and support digital transformation for major banking and financial institutions. This role requires a blend of technical precision and a deep understanding of logical structures. Whether you are working on core backend services, developing API integrations, or contributing to fleet management and credit scoring engines, you are expected to deliver code that is not only functional but secure and scalable.
This guide is scoped to a Software Engineer candidate at CRIF.
Focus areas
- Java
- Core Java Concepts
- Data Structures & Algorithms (DSA)
The CRIF interview process
CRIF candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.
Recruiter Screen
Initial screening call with a recruiter to assess your background and fit for the role.
What to demonstrate
- Initial screening call with a recruiter to assess your background and fit for the role
- Depth in Java
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 Rounds
One or more technical interviews to evaluate your coding skills and technical knowledge.
What to demonstrate
- One or more technical interviews to evaluate your coding skills and technical knowledge
- Depth in Java
How to prepare
- Answer aloud and timed: Can you explain the difference between Lambda expressions and the Stream API?
- Answer aloud and timed: What is the difference between a ConcurrentHashMap and a standard HashMap in a multi-threaded environment?
Managerial or HR Interview
Final interview with a manager or HR to discuss behavioral aspects and team fit.
What to demonstrate
- Final interview with a manager or HR to discuss behavioral aspects and team fit
- Depth in Java
How to prepare
- Answer aloud and timed: Describe the lifecycle of a Spring Boot bean and its scope.
- Answer aloud and timed: Walk me through the implementation of a basic Data Structure (e.g., Stack or Queue) and its time complexity.
Where candidates lose points
Review your CV thoroughly
Be prepared to discuss every project or skill you have listed in detail. If you claim to know a language or framework, expect deep-dive questions on it.
Think out loud
When solving a technical problem, explain your thought process. Interviewers are often more interested in how you arrive at a solution than the solution itself.
Prepare for code analysis
You may be asked to look at existing code and improve it. Focus on readability, performance, and security.
Show passion for the domain
Research what CRIF does. Understanding how your code contributes to the financial health of their clients will set you apart from candidates who are just looking for "any" job.
Questions & practice
What is the difference between a ConcurrentHashMap and a standard HashMap in a multi-threaded environment?
Medium · Core Java and Backend Development
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
Walk me through the implementation of a basic Data Structure (e.g., Stack or Queue) and its time complexity.
Medium · Technical Problem Solving and DSA
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?
Can you identify and fix the potential bugs in this provided code snippet?
Medium · Technical Problem Solving and DSA
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?
How would you optimize a database query that is performing slowly on a large dataset?
Medium · Technical Problem Solving and DSA
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- 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?
Hold a per-tenant active cap against concurrent creates
Hard · write skew · isolation levels · constraints
A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.
Approach
- Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
- Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
- Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
- State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.
Follow-up
- A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
- The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?
Explain the internal working of a HashMap and how it handles collisions.
Medium · Core Java and Backend Development
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 do you implement JWT security in a Spring Boot application?
Medium · Core Java and Backend Development
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?
Can you explain the difference between Lambda expressions and the Stream API?
Medium · Core Java and Backend Development
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?
Describe the lifecycle of a Spring Boot bean and its scope.
Medium · Core Java and Backend Development
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?
Given a real-world scenario, how would you design a simple service to handle concurrent requests?
Medium · Technical Problem Solving and DSA
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 designing a system for high availability and data consistency?
Medium · Technical Problem Solving and DSA
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?
Exports duplicate a row range about once a week
Hard · leases · clock skew · idempotency
Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.
Approach
- Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
- Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
- Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
- Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.
Follow-up
- The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
- You now count takeovers. What alert fires on that counter, and at what threshold?
Suggested practice checklist
Built from the rounds and topics CRIF candidates report.
Day 1 — Map the CRIF loop
- Write out the reported sequence: Recruiter Screen, Technical Rounds, Managerial or HR Interview.
- 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 3 reported rounds, with the weakest marked.
Day 2 — Work Java
- Spend the session on Java, which CRIF candidates report being tested on.
- Write one worked example in Java and time yourself on it.
Deliverable: One timed worked example in Java.
Day 3 — Work Core Java Concepts
- Spend the session on Core Java Concepts, which CRIF candidates report being tested on.
- Write one worked example in Core Java Concepts and time yourself on it.
Deliverable: One timed worked example in Core Java Concepts.
Day 4 — Work Data Structures & Algorithms (DSA)
- Spend the session on Data Structures & Algorithms (DSA), which CRIF candidates report being tested on.
- Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.
Deliverable: One timed worked example in Data Structures & Algorithms (DSA).
Day 5 — Answer out loud: Core Java and Backend Development
- Answer aloud, timed: Explain the internal working of a HashMap and how it handles collisions.
- Answer aloud, timed: How do you implement JWT security in a Spring Boot application?
Deliverable: Spoken answers to 2 reported Core Java and Backend Development question(s), under time.
Day 6 — Answer out loud: Technical Problem Solving and DSA
- Answer aloud, timed: Walk me through the implementation of a basic Data Structure (e.g., Stack or Queue) and its time complexity.
- Answer aloud, timed: How would you optimize a database query that is performing slowly on a large dataset?
Deliverable: Spoken answers to 2 reported Technical Problem Solving and DSA question(s), under time.
Day 7 — Answer out loud: Behavioral and Situational
- Answer aloud, timed: Tell me about a time you had to defend a technical decision when faced with disagreement.
- Answer aloud, timed: Why do you want to work for CRIF specifically, and what draws you to our projects?
Deliverable: Spoken answers to 2 reported Behavioral and Situational question(s), under time.
Behavioural preparation
Behavioural rounds judge the decision you made and what it cost.
Tell me about a time you had to defend a technical decision when faced with disagreement.
Medium · Behavioral and Situational
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 do you want to work for CRIF specifically, and what draws you to our projects?
Medium · Behavioral and Situational
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 tight deadlines while maintaining code quality?
Medium · Behavioral and Situational
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 learn a new technology quickly to complete a task.
Medium · Behavioral and Situational
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?