NCR Voyix Software Engineer Intern Interview Questions, Process, and Tips

2 dsa questions
1st is based on strings (easy)
2nd one ie based on hashmaps (medium)

Q1. IP address validation dsa
Add your answer
Q2. Oops question SQL query on employee database
Add your answer

Q1. Managerial round With questions about Linux commands Behavioral questions Questions about past projects
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA and DBMS.

Q1. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
It works on the principle of Divide and Conquer. Merge sort repeatedly divides the array into several arrays until each array consists of a single element and merging those arrays in a manner that results into a sorted array.

Pseudocode :
MergeSort(A, p, r):
if p > r 
return
q = (p+r)/2
mergeSort(A, p, q)
mergeSort(A, q+1, r)
merge(A, p, q, r)

Merge function : The task is to merge two subarrays A[p..q] and A[q+1..r] to ...read more
Answered Anonymously
Add your answer
Q2. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Ans. 
This was a pretty standard Binary Search Question and I had solved this question before on platforms like LeetCode and CodeStudio . I was asked this question to test my implementation skills and how well do I handle Edge Cases .

Approach :
1) The idea is to find the pivot point, divide the array in two sub-arrays and perform binary search.
2) The main idea for finding pivot is – for a sorted (in increasing order) and pivo...read more
Answered Anonymously
Add your answer
Q3. Write a query to find the nth highest salary from a database.
Ans. 
TOP keyword can be used to find the nth highest salary. By default ORDER BY clause print rows in ascending order, since we need the highest salary at the top, we have used ORDER BY DESC, which will display salaries in descending order. Again DISTINCT is used to remove duplicates. The outer query will then pick the topmost salary, which would be your Nth highest salary.
SQL query : 
SELECT TOP 1 salary
FROM ( 
SEL...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Questions based on OOPS and Software Lifecycle were asked in this round.

Q1. Can you explain the OOP concepts?
Ans. 
A class is a user defined blueprint or prototype from which objects are created. It represents the set of properties or methods that are common to all objects of one type. In general, class declarations can include these components, in order: 
1. Modifiers: A class can be public or has default access (Refer this for details).
2. Class name: The name should begin with a initial letter (capitalized by convention).
3. S...read more
Answered Anonymously
Add your answer
Q2. Can you explain the access modifiers in Java?
Ans. 
There are four types of Java access modifiers:

Private: The access level of a private modifier is only within the class. It cannot be accessed from outside the class.
Default: The access level of a default modifier is only within the package. It cannot be accessed from outside the package. If you do not specify any access level, it will be the default.
Protected: The access level of a protected modifier is within the pack...read more
Answered Anonymously
Add your answer
Q3. What is Scrum methodology?
Ans. 
Scrum is an agile development methodology used in the development of Software based on an iterative and incremental processes. Scrum is adaptable, fast, flexible and effective agile framework that is designed to deliver value to the customer throughout the development of the project. The primary objective of Scrum is to satisfy the customer’s need through an environment of transparency in communication, collective resp...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The last round was managerial round.