cswork / libraryOpen practice workspace

Interview guides · NCR

NCR Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at NCR, you are responsible for architecting, building, and maintaining high-volume enterprise technology solutions that power global commerce. NCR operates at the intersection of retail, banking, and hospitality, driving critical infrastructure that runs everything from self-service checkout terminals and ATMs to digital banking platforms and point-of-sale (POS) systems. In this role, your code directly influences millions of daily financial and retail transactions worldwide. Engineering teams at NCR face complex challenges around system availability, low-latency processing, cloud integration, and enterprise-grade security. Whether you are working on modern microservices architectures in Java or.NET, building robust front-end interfaces, or optimizing firmware for hardware devices, your work has a direct operational impact on global enterprise clients.

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

Focus areas

  • Object-Oriented Programming (OOP)
  • DSA (Data Structures and Algorithms)
  • System Design

The NCR interview process

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

Resume Screening

Initial review of candidate resumes, campus recruitment events, or recruiter phone screens.

What to demonstrate

  • Initial review of candidate resumes, campus recruitment events, or recruiter phone screens
  • Depth in Object-Oriented Programming (OOP)

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.

Online Assessment

Candidates complete an online assessment testing core computer science knowledge and live coding problems.

What to demonstrate

  • Candidates complete an online assessment testing core computer science knowledge and live coding problems
  • Depth in Object-Oriented Programming (OOP)

How to prepare

  • Answer aloud and timed: How does memory management work in Java (Garbage Collection) versus C++ (pointers and manual allocation)?
  • Answer aloud and timed: Explain the concept of abstract classes versus interfaces. When would you use one over the other?

Technical Interview Rounds

One or two rounds of technical interviews with senior engineers or managers, focusing on coding and conceptual questions.

What to demonstrate

  • One or two rounds of technical interviews with senior engineers or managers
  • Focusing on coding and conceptual questions

How to prepare

  • Answer aloud and timed: What are access modifiers, and how do they enforce encapsulation within an enterprise codebase?
  • Answer aloud and timed: Write an algorithm to reverse a string without using built-in helper functions.

Techno-Managerial Round

Assessment of leadership, situational problem solving, and project management skills.

What to demonstrate

  • Assessment of leadership, situational problem solving, and project management skills
  • Depth in Object-Oriented Programming (OOP)

How to prepare

  • Answer aloud and timed: How do you implement the Fibonacci sequence iteratively versus recursively? Compare their time and space complexities.
  • Answer aloud and timed: Given a singly linked list, write a function to detect if a cycle exists.

HR Discussion

Final discussion focused on compensation and logistics.

What to demonstrate

  • Final discussion focused on compensation and logistics
  • Depth in Object-Oriented Programming (OOP)

How to prepare

  • Answer aloud and timed: How would you find the lowest common ancestor of two nodes in a binary tree or graph?
  • Answer aloud and timed: Explain how a HashMap works internally, including collision resolution techniques and time complexity for lookup operations.

Where candidates lose points

Master real-world OOP examples

Do not just memorize abstract definitions for inheritance or polymorphism. Be ready to write working code snippets that illustrate how these concepts apply to enterprise domain models.

Be thorough with your resume projects

Interviewers across both technical and managerial rounds will dig deeply into the projects listed on your resume. Be prepared to explain your architecture decisions, technologies used, personal contributions, and technical challenges overcome.

Review fundamental SQL and Linux commands

Brush up on writing hand-written JOIN queries and reviewing essential Linux terminal commands, as these are routinely asked across both online tests and technical rounds.

Questions & practice

What is the difference between compile-time polymorphism and run-time polymorphism? How are they implemented i

Medium · Object-Oriented Programming & Fundamenta

What is the difference between compile-time polymorphism and run-time polymorphism? How are they implemented in Java or C++?

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. 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?

How does memory management work in Java (Garbage Collection) versus C++ (pointers and manual allocation)?

Medium · Object-Oriented Programming & Fundamenta

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. 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?

Write an algorithm to reverse a string without using built-in helper functions.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

How do you implement the Fibonacci sequence iteratively versus recursively? Compare their time and space compl

Medium · Data Structures & Algorithms

How do you implement the Fibonacci sequence iteratively versus recursively? Compare their time and space complexities.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Given a singly linked list, write a function to detect if a cycle exists.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

How would you find the lowest common ancestor of two nodes in a binary tree or graph?

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain how a HashMap works internally, including collision resolution techniques and time complexity for look

Medium · Data Structures & Algorithms

Explain how a HashMap works internally, including collision resolution techniques and time complexity for lookup operations.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

What is the difference between DDL (Data Definition Language) and DML (Data Manipulation Language) in SQL? Wri

Medium · Databases, Linux & System Concepts

What is the difference between DDL (Data Definition Language) and DML (Data Manipulation Language) in SQL? Write an example query involving a multi-table JOIN.

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

  1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
  2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
  3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
  4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

  • Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
  • Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

Explain the four fundamental principles of Object-Oriented Programming (OOP) and provide real-world examples f

Medium · Object-Oriented Programming & Fundamenta

Explain the four fundamental principles of Object-Oriented Programming (OOP) and provide real-world examples for each.

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain the concept of abstract classes versus interfaces. When would you use one over the other?

Medium · Object-Oriented Programming & Fundamenta

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What are access modifiers, and how do they enforce encapsulation within an enterprise codebase?

Medium · Object-Oriented Programming & Fundamenta

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain ACID properties in relational databases and how transaction management prevents data corruption.

Medium · Databases, Linux & System Concepts

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How does TCP/IP differ from UDP, and which protocol would you select for transaction processing versus live st

Medium · Databases, Linux & System Concepts

How does TCP/IP differ from UDP, and which protocol would you select for transaction processing versus live streaming?

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

List and explain essential Linux commands used for process management, file inspection, and network troublesho

Medium · Databases, Linux & System Concepts

List and explain essential Linux commands used for process management, file inspection, and network troubleshooting.

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. 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 NCR candidates report.

Day 1 — Map the NCR loop

  • Write out the reported sequence: Resume Screening, Online Assessment, Technical Interview Rounds, Techno-Managerial Round, HR Discussion.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 5 reported rounds, with the weakest marked.

Day 2 — Work Object-Oriented Programming (OOP)

  • Spend the session on Object-Oriented Programming (OOP), which NCR candidates report being tested on.
  • Write one worked example in Object-Oriented Programming (OOP) and time yourself on it.

Deliverable: One timed worked example in Object-Oriented Programming (OOP).

Day 3 — Work DSA (Data Structures and Algorithms)

  • Spend the session on DSA (Data Structures and Algorithms), which NCR candidates report being tested on.
  • Write one worked example in DSA (Data Structures and Algorithms) and time yourself on it.

Deliverable: One timed worked example in DSA (Data Structures and Algorithms).

Day 4 — Work System Design

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

Deliverable: One timed worked example in System Design.

Day 5 — Answer out loud: Object-Oriented Programming & Fundamentals

  • Answer aloud, timed: Explain the four fundamental principles of Object-Oriented Programming (OOP) and provide real-world examples for each.
  • Answer aloud, timed: What is the difference between compile-time polymorphism and run-time polymorphism? How are they implemented in Java or C++?

Deliverable: Spoken answers to 2 reported Object-Oriented Programming & Fundamentals question(s), under time.

Day 6 — Answer out loud: Data Structures & Algorithms

  • Answer aloud, timed: Write an algorithm to reverse a string without using built-in helper functions.
  • Answer aloud, timed: How do you implement the Fibonacci sequence iteratively versus recursively? Compare their time and space complexities.

Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.

Day 7 — Answer out loud: Databases, Linux & System Concepts

  • Answer aloud, timed: What is the difference between DDL (Data Definition Language) and DML (Data Manipulation Language) in SQL? Write an example query involving a multi-table JOIN.
  • Answer aloud, timed: Explain ACID properties in relational databases and how transaction management prevents data corruption.

Deliverable: Spoken answers to 2 reported Databases, Linux & System Concepts question(s), under time.

Behavioural preparation

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

Explain the basics of Git branching strategies and how you resolve merge conflicts in a collaborative team env

Medium · Databases, Linux & System Concepts

Explain the basics of Git branching strategies and how you resolve merge conflicts in a collaborative team environment.

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Walk me through a challenging technical bug you encountered in a recent project and how you diagnosed and reso

Medium · Behavioral & Experience Deep-Dive

Walk me through a challenging technical bug you encountered in a recent project and how you diagnosed and resolved it.

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell me about a time you had to work with tight deadlines or shifting project requirements.

Medium · Behavioral & Experience Deep-Dive

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Describe a situation where you had a technical disagreement with a team member. How did you handle it?

Medium · Behavioral & Experience Deep-Dive

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How do you ensure code quality, test coverage, and security in your daily engineering workflow?

Medium · Behavioral & Experience Deep-Dive

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Why do you want to work as a Software Engineer at NCR, and what experience makes you a strong fit for our tran

Medium · Behavioral & Experience Deep-Dive

Why do you want to work as a Software Engineer at NCR, and what experience makes you a strong fit for our transaction systems?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?