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

It was c++ coding test

Q1. Coding questions
Add your answer

Q1. Network related questions
Add your answer

Q1. About myself and other details
Add your answer

Round duration - 150 minutes
Round difficulty - Medium

Owing to the lockdown announced in view of the Covid-19 pandemic drive was conducted virtual.
Total Marks: 232 out of which 32 were for MCQ's and 200 for coding.
The time allowed: 2.5 hrs.
It was online proctored test and no tab switching is allowed.

Q1. 
Connecting Ropes with Minimum Cost
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...read more
Ans. Brute Force Approach
Clearly, the rope which is picked up first will be having its length included more than once in the final cost. If we pick a rope of larger length earlier, then we will be adding some extra cost to our final result.
So, the idea is to pick ropes of smaller lengths initially to minimize the impact on our final cost.
So, each time we will be finding two smallest ropes, connecting them and
adding the resu...read more
Answered Anonymously
Add your answer
Q2. 
Job Sequencing Problem Statement
You are provided with a N x 2 2-D array called Jobs consisting of N jobs. In this array, Jobs[i][0] represents the deadline of the i-th job, while Jobs[i][1] indicates the...read more
Ans. Greedy Approach
The idea here is to follow a greedy approach that we should complete the job with the maximum profit in the nearest available slot within its deadline. So, we can sort the jobs in the decreasing order of their profit, and we can maintain a boolean array to keep track of the available slots. So, for each job, we traverse the array backward from the deadline associated with the job to 1, and if any of the ...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

On the day of interview I have revised all the core subjects and data structures and algorithms. Interview happened for 45 minutes and it went well.

Q1. 
Problem Statement: Delete Node In A Linked List
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...read more
Ans. Brute-force
Approach:
 
We need to delete the node K from the linked list. The most general way to delete the node K from a singly linked list is to get access to the previous node of K. We can get access to the previous node by traversing from the head of the linked list. Let’s denote this previous node as P. Then, we update the next pointer of P to the next pointer of K. 
Although the reference to node K is giv...read more
Answered Anonymously
Add your answer
Q2. 
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. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered Anonymously
Add your answer
Q3. 
Sort By Kth Bit
Given an array or list ARR of N positive integers and an integer K, your task is to rearrange all elements such that those with the K-th bit (considering the rightmost bit as '1st' bit) eq...read more
Ans. Iteration
The idea is to simply iterate through the ‘ARR’ and check each element whether its ‘K-th’ bit is 0 or 1, and add the element to the respective group.
 
Here is the algorithm:
 
1. Create an array/list ‘TEMP_ARR’ of size = ‘N’ for storing all the elements whose ‘K-th’ bit is 1.
2. Initialize a variable ‘j’ = 0 to iterate through ‘TEMP_ARR’.
3. Initialize a variable ‘p’ = 0 to iterate through ‘ARR’.
4. Run a loop from 0 ...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Immediately after clearing 2nd round they called me for next round which went for 30 minutes. Interviewer is flexible and everything went well.

Round duration - 20 minutes
Round difficulty - Easy

After successfully clearing 2 rounds of technical interview there was HR round which took place for 20 minutes.