AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
NCR Corporation Software Developer Intern Interview Questions and Answers
8 Interview questions
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palindr...
Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found and its starting index
Return the longest palindromic substring with the smallest start index
Count Distinct Ways to Reach the Nth Stairs
Consider a scenario where you have been given a number of stairs. You start at the 0th stair and need to reach the Nth stair. With each stride, you can choose to...
The task is to find the number of distinct ways to move from the 0th to the Nth stair by ascending one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the number of ways to reach the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using memoization to avoid ...
I have worked on projects involving web development, machine learning, and mobile app development using technologies such as React, Python, and Flutter.
Web development project using React and Node.js for frontend and backend
Machine learning project using Python and TensorFlow for model training and deployment
Mobile app development project using Flutter for cross-platform app development
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numbe...Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
Prime Time Again Problem Statement
You are given two integers DAY_HOURS and PARTS. Consider a day with DAY_HOURS hours, which can be divided into PARTS equal parts. Your task is to determine the total inst...
Count the total instances of equivalent prime groups in a day divided into equal parts.
Divide the day into equal parts and check for prime groups at the same position in different parts.
Each prime group should consist of prime numbers occurring at different parts of the day.
Return the total number of equivalent prime groups found.
Example: For DAY_HOURS = 20 and PARTS = 2, there are 2 prime groups: 3-13 and 7-17.
Sort Elements by Frequency
Your task is to sort a list of repeated integers by their frequency in decreasing order. The element with the highest frequency should appear first. If two elements have the same...
The task is to sort a list of integers based on their frequency of repetition, with the element with the highest frequency first.
Count the frequency of each element in the list using a dictionary.
Sort the elements based on their frequency in descending order.
If two elements have the same frequency, maintain their original order.
Return the sorted list.
Reverse a Doubly Linked List
Given a doubly linked list of positive integers with size 'N', reverse the list and return the head of the modified list.
Explanation:
A doubly linked list allows traversal i...
The task is to reverse a given doubly linked list and return the head of the modified list.
Create three pointers: prev, current, and next.
Iterate through the linked list and update the next and prev pointers for each node.
Finally, update the head pointer to the last node visited and return it as the head of the reversed list.
Partition Array Minimizing Subset Sum Difference
Given an array containing N non-negative integers, your task is to partition this array into two subsets such that the absolute difference between their sum...
The task is to partition an array into two subsets such that the absolute difference between subset sums is minimum.
Iterate through all possible subsets of the array
Calculate the sum of each subset
Find the minimum absolute difference between the subset sums
NCR Corporation Software Developer Intern Interview Experiences
3 interviews found
I appeared for an interview in Jan 2021.
(1 Question)
Round duration - 150 minutes
Round difficulty - Medium
It was an online round consisting of 2 programming questions restricted to C++, Java, and C# and 10 MCQ's on Data structures, Algorithms, etc..
- Q1.
Prime Time Again Problem Statement
You are given two integers
DAY_HOURSandPARTS. Consider a day withDAY_HOURShours, which can be divided intoPARTSequal parts. Your task is to determine the total ins... - Ans.
Count the total instances of equivalent prime groups in a day divided into equal parts.
Divide the day into equal parts and check for prime groups at the same position in different parts.
Each prime group should consist of prime numbers occurring at different parts of the day.
Return the total number of equivalent prime groups found.
Example: For DAY_HOURS = 20 and PARTS = 2, there are 2 prime groups: 3-13 and 7-17.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
- Q1.
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb... - Ans.
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
- Q1. Can you describe your projects and the tech stack you used in them?
- Ans.
I have worked on projects involving web development, machine learning, and mobile app development using technologies such as React, Python, and Flutter.
Web development project using React and Node.js for frontend and backend
Machine learning project using Python and TensorFlow for model training and deployment
Mobile app development project using Flutter for cross-platform app development
Round duration - 60 minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Practice Data Structures and Algorithms.
Tip 2 : Practice Puzzles from GFG.
Tip 3 : Should have good knowledge of OOPS.
Tip 1 : Have some good projects on your resume.
Tip 2 : Do not anything false in your resume.
Tip 3 : Mention your coding profiles in your resume.
Skills evaluated in this interview
I appeared for an interview in Dec 2020.
(1 Question)
Round duration - 150 Minutes
Round difficulty - Easy
2 programming questions restricted to C++, Java, and C#
10 MCQ's on Data structures, Algorithms, etc.
- Q1.
Partition Array Minimizing Subset Sum Difference
Given an array containing N non-negative integers, your task is to partition this array into two subsets such that the absolute difference between their su...
- Ans.
The task is to partition an array into two subsets such that the absolute difference between subset sums is minimum.
Iterate through all possible subsets of the array
Calculate the sum of each subset
Find the minimum absolute difference between the subset sums
(2 Questions)
Round duration - 80 Minutes
Round difficulty - Medium
The round was conducted on FaceCode(HackerEarth) in the afternoon time. The OOPS features of CPP were asked. The SQL queries (Joins) were also asked. Two easy programming questions were asked - one array-based implementation and other one from the doubly linked list. Two puzzles were also asked. The interviewers were very nice and they gave me enough time to think about the solution.
- Q1.
Sort Elements by Frequency
Your task is to sort a list of repeated integers by their frequency in decreasing order. The element with the highest frequency should appear first. If two elements have the sam...
- Ans.
The task is to sort a list of integers based on their frequency of repetition, with the element with the highest frequency first.
Count the frequency of each element in the list using a dictionary.
Sort the elements based on their frequency in descending order.
If two elements have the same frequency, maintain their original order.
Return the sorted list.
- Q2.
Reverse a Doubly Linked List
Given a doubly linked list of positive integers with size 'N', reverse the list and return the head of the modified list.
Explanation:
A doubly linked list allows traversal ...
- Ans.
The task is to reverse a given doubly linked list and return the head of the modified list.
Create three pointers: prev, current, and next.
Iterate through the linked list and update the next and prev pointers for each node.
Finally, update the head pointer to the last node visited and return it as the head of the reversed list.
Round duration - 30 Minutes
Round difficulty - Easy
In this round, I was asked simple questions from core subjects.
Round duration - 10 Minutes
Round difficulty - Easy
It was in the evening on the same day after Techno Managerial round. HR asked me about my family background.
Interview Preparation Tips
Tip 1 : Competitive coding and good knowledge of Data Structures and Algorithms is important
Tip 2 : Have very good knowledge of atleast one Programming Language
Tip 3 : Do atleast 2 projects, having an internship in your resume will be bonus
Tip 1 : Do not put false things, quantity is not important but the quality is. Have few things but you should have good knowledge of them.
Tip 2 : Keep it of 1 page with all the relevant details.
Skills evaluated in this interview
I appeared for an interview in Nov 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
This was the first round and it consisted of 20 MCQs and 2 programming questions.
The test was on HackerEarth platform.
The test was of 2 hours , web-proctored and switching between tabs was not allowed.
- Q1.
Longest Palindromic Substring Problem Statement
You are provided with a string
STRof lengthN. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind... - Ans.
Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found and its starting index
Return the longest palindromic substring with the smallest start index
- Q2.
Count Distinct Ways to Reach the Nth Stairs
Consider a scenario where you have been given a number of stairs. You start at the 0th stair and need to reach the Nth stair. With each stride, you can choose t...
- Ans.
The task is to find the number of distinct ways to move from the 0th to the Nth stair by ascending one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the number of ways to reach the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using memoization to avoid redun...
Round duration - 45 minutes
Round difficulty - Medium
This was the second round and the interview round. It was all about OOPS concepts , OS and DBMS fundamentals.It was of 45 minutes approximately .
Round duration - 30 minutes
Round difficulty - Medium
This was the third round and the round was focused on Projects and Puzzles. It was of 1/2 hour approximately.
Round duration - 30 minutes
Round difficulty - Medium
It was the last round and was all about HR questions.
Interview Preparation Tips
Tip 1 : Atleast 200 to 250+ Data Structures and Algorithms Questions from LeetCode, GeeksForGeeks etc.
Tip 2 : Thorough with your Projects , Skills , any previous experience etc. mentioned in your resume.
Tip 3 : Practice of Mathematical and Logical Puzzles
Tip 1 : Mention projects which you can explain and defend clearly.
Tip 2 : Resume should always be crisp and clear and should be of 1 page.
Tip 3 : If you do competitive programming , you can put links of your various online platforms profiles like Codechef, Codeforces etc.
Tip 4 : There should not be any false achievements or false experience mentioned in the resume.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Software Engineer Interview Questions & Answers
Virtusa Consulting Services
Anonymous
posted on 7 May 2022
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Basic aptitude knowledge
Strong in java
Interview Preparation Tips
I applied via Naukri.com and was interviewed before Sep 2019. There were 6 interview rounds.
Interview Questionnaire
3 Questions
- Q1. IQ Test
- Q2. Machine Test
- Q3. Face To Face
Interview Preparation Tips
1. IQ Test
2. Machine Test
3. Face to Face
IQ Test is not so tough but prepare well Machine Test
Machine Test Question are like :-
Q.1 - We declare a variable in C++ like "is_this_a_variable" and in Java like "IsThisAVariable". There is underscore in between every word and first alphabet of every word is in lowercase in C++ and in Java first alphabet is in capital without underscore. Create a program in which if user input a string in a C++ variable format it will convert the input in java variable format.
Q2. Count the frequency of a string.
user input string - pqhphi
output-
p - 2
q - 1
h - 2
i - 1
Be strong in algorithms and data structure.
Software Developer Interview Questions & Answers
Virtusa Consulting Services
Anonymous
posted on 15 Sep 2021
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
It happens in very friendly manner.
- Q1.
Paths in a Matrix Problem Statement
Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or dow...
- Ans.
Print all possible paths from top-left to bottom-right in a matrix by moving only right or down.
Use backtracking to explore all possible paths from top-left to bottom-right in the matrix.
At each cell, recursively explore moving right and down until reaching the bottom-right corner.
Keep track of the current path and add it to the result when reaching the destination.
- Q2. Can you create 2 tables in SQL and perform different operations on them?
- Ans.
Yes, I can create 2 tables in SQL and perform operations like INSERT, SELECT, UPDATE, and DELETE.
Create Table 1: CREATE TABLE employees (id INT, name VARCHAR(50), salary DECIMAL(10,2));
Create Table 2: CREATE TABLE departments (dept_id INT, dept_name VARCHAR(50));
Insert Data: INSERT INTO employees VALUES (1, 'John Doe', 50000);
Select Data: SELECT * FROM employees WHERE salary > 40000;
Update Data: UPDATE employees SET...
Round duration - 90 minutes
Round difficulty - Medium
No problem occur very friendly environment.
(1 Question)
Round duration - 90 minutes
Round difficulty - Hard
- Q1.
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
- Ans.
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
If the destination is reached, add the path to the list of valid paths.
Interview Preparation Tips
Tip 1 : Competitive programming plays a major role when you are appearing for coding rounds as a fresher. In the coding rounds, you won't get direct problems copied from Geeksforgeeks or Leetcode. You would be required to use your logical thinking to go ahead in the process. This is where competitive programming helps.
Tip 2 : Coding rounds are all about Coding + Timing. Most people fail to excel due to the pressure of a timer ticking on your head. So, instead of just solving problems, try to participate in timed contests. This will help you be used to the pressure of the timer.
Tip 3 : Many big companies like Microsoft, Amazon, and even Google expect you to be good at standard problems. So, once you are done with coding round by your logical skills and competitive programming, you must be well versed with some standard problems in order to excel.
Application resume tips for other job seekersTip 1 : Make it short, crisp, and simple. It is always good to have a 1 pager resume.
Tip 2 : Resume must comprise of the following: Educational Qualifications, Technical skills, Projects, Work experience (if any), Achievements. Other than this, you may include some extra co-curricular achievements.
Skills evaluated in this interview
Interview Questionnaire
6 Questions
- Q1. Tell me about your project
- Ans.
Developed a web-based project management tool for a startup
Used React for the frontend and Node.js for the backend
Implemented user authentication and authorization using JWT
Integrated with third-party APIs such as Trello and Slack
Implemented real-time updates using WebSockets
Deployed on AWS using EC2 and RDS
- Q2. Write the idea or algorithm for d program of fibonacci series
- Q3. One question from your subject
- Q4. Introduce yourself
- Ans.
I am a software engineer with experience in developing web applications and mobile apps.
Proficient in programming languages such as Java, Python, and JavaScript
Skilled in using frameworks like React, Angular, and Spring Boot
Experienced in working with databases such as MySQL and MongoDB
Familiar with Agile development methodologies and DevOps practices
- Q5. If I give you a box full of pencils..in how many ways can you use it
- Q6. Do you have any question for me
Interview Preparation Tips
Experience: Time management is very important to clear the aptitude test. Besides this a lot of practice is also very important. This round is the major filteration round. Though each round is a major filteration round cuz NTT DATA is not a bulk recruiter like cts, infy etc. Almost 2-3 thousand students were there for this round from 6 different colleges and only 100 of them were selected.
Tips: Its better to start with the preparation from before and do consider the previous year placement papers available at indiabix. You can practice more n more. Apart from this you can go through the r.s aggarwal aptitude book also.
Round: Group Discussion
Experience: There were many panels and each panel had 10-12 students. The H.r first decided some other topic but when he asked wether everybody is aware of the topic ..there were few who didn't know about it. .so he picked up another topic. Fortunately he asked me to start with the discussion. Always try to be the one to break the ice.
Tips: The only key to crack this round is that yku should talk. You should definitely not confuse gd with debate. You should not argue or by any chance shouldn't sound arrogant.
Round: Technical Interview
Experience: They will definitely ask about your project so be thorough with that. Ntt data is a Japanese company . Though this is IT but it will ask from the subject of your own choice from people those who have a non IT background. After you get shortlisted in d gd they will give you a form to fill. Do fill that form without fail. If it is blank then even if u go to the hr round he will reject you.
Tips: Just be confident and always smile. Be careful on what you write in your resume cuz they can ask about anything based on your resume.
Round: HR Interview
Experience: This round was a cake walk. Just be confident and updated about the company. Do ask him a question if he asks you to do that.but make sure it shouldn't be vague or out of the picture.
Tips: Keep smiling and don't get nervous. If they ask you about location preferences, dun get firm at one place.try to be flexible.
General Tips: Donot loose hope at any cost. You never know when your moment is going to arrive. Do practice the aptitude as much as you can. Finally NTT DATA selected only 50 overall in wch 11 were from my college n i was lucky to be one of them. the offer letter was issued the same day and we were all venerated. Its just a game of confidence. All the best
Skill Tips: Try to add some co curricular activities and justify your role.
Skills: communication, technical knowledge, management skills, leadership
College Name: SATHYABAMA UNIVERSITY
Motivation: You will find the it companies mostly head quartered in U.S but this company is in Japan. Plus you have better opportunity and growth compared to other companies cuz its not a bulk recruiter.
Skills evaluated in this interview
kalyan yashwanth
Interview Questionnaire
2 Questions
- Q1. Java ( socket programming, OOPS, DS )
- Q2. Write about your dream
- Ans.
My dream is to build innovative software solutions that positively impact people's lives.
Developing cutting-edge technology
Creating user-friendly interfaces
Solving complex problems
Collaborating with talented individuals
Making a difference in society
Continuous learning and growth
Interview Preparation Tips
Experience: GRE givers , you can make it through this. Brush up your technical skills for the programming section.
Tips: GRE quant and verbal and quick review from tutorialspoint.com would do the trick.
Round: Group Discussion
Experience: I had fun. I won a few debate competitions in various technical symposiums so, It gave a good experience about being quiet at the right moment.
Tips: Turn to your GRAB-ON mode. Never miss any chance. Learn to know when to be quiet and when to talk in a GD. Try to bring down the heat If two participants are getting into a argumentative discussion.
Round: Stress Interview
Experience: It was really difficult. Exactly after the GD, we were asked to right an essay in a very less time and our capability to manage the stress was observed.
Tips: Be calm and write all that you know in a presentable way.
Round: Technical Interview
Experience: I did a project in my 3rd year which included few concepts on Socket programming which helped me a bit in this round. I answered confidently and I was put to a confidence test too to see how sure I was about the answer.
Tips: A quick review on the day of interview and involving in friendly discussion about programming languages before the test helps.
Round: HR Interview
Experience: I was asked few technical questions in this round and later moved on to the general logical questions. Questions like, cutting a bread into multiple slices, finding the corresponding switch among 3 switches for 3 bulbs in room were asked. Find the sum of 1-10 in 4 seconds was asked suddenly. Thanks to Arithmetic Progressions :P.
Tips: Use your logical ability to answer.
Skills: Java, C, Body Language, Mental ability, Confidence.
College Name: Malla Reddy Institute of Engineering & Technology ( MRIET )
Motivation: Ranked among the top 50 of the Fortune 500. Expanding organizations which include lot of opportunities.
Interview Preparation Tips
Experience: This round they want to know about why do you want to leave your job?
current ctc
expected ctc
how many experience do you have on particular technology?
Tips: this round is simple you have to tell all the details of your profile and if they want this profile candidate they shortlisted you..
they want positive response, so be positive.
Software Developer Interview Questions & Answers
Virtusa Consulting Services
avinash patnala
posted on 13 Jan 2015
Interview Preparation Tips
Experience: Quite easy..It contains mcq and one programming question. MCQ covers databases,sql,software testing,c++
Tips: You can easily pass the test,no need to worry
Round: Interview
Experience: Questions are among databases and java,they will ask u fav subj and asks questions in that
Tips: Through with ur fav subject..be confident, simple anad basic questions,try to solve secreening test question using java language
Round: Interview
Experience: Its better to say technical only,the hr also asks about test pattren.programming question.then normal HR questions
Tips: It better to do some research about the company,overall it's easy and cake walk for those who are strong in java and databases
General Tips: CSE guys can easily clear that test and interview..without any hesitattion
Skills: Java,databases, SQL, C, General Aptitude
College Name: NIT Warangal
Motivation: Virtusa is emerging company
Funny Moments: In interview they asked about my girl friend,her name andwhen ur are going to marry. answer them in a funny way with smile in your face
NCR Corporation Interview FAQs
Tell us how to improve this page.
NCR Corporation Interviews By Designations
- NCR Corporation Software Engineer Interview Questions
- NCR Corporation Software Developer Interview Questions
- NCR Corporation Software Engineer2 Interview Questions
- NCR Corporation Software Engineer II Interview Questions
- NCR Corporation Software Engineer Intern Interview Questions
- NCR Corporation Customer Engineer Interview Questions
- NCR Corporation Software Developer Intern Interview Questions
- NCR Corporation QA Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Software Developer Intern Interview Questions from Similar Companies
|
Software Engineer
393
salaries
|  ₹9.6 L/yr - ₹17.5 L/yr |
|
Senior Software Engineer
280
salaries
| ₹14.4 L/yr - ₹29.7 L/yr |
|
Software Engineer2
196
salaries
| ₹13 L/yr - ₹21.3 L/yr |
|
Software Engineer III
186
salaries
| ₹21.5 L/yr - ₹35 L/yr |
|
Software Engineer II
156
salaries
| ₹14.1 L/yr - ₹23 L/yr |
DXC Technology
Sutherland Global Services
Optum Global Solutions
Virtusa Consulting Services
- Home >
- Interviews >
- NCR Corporation Interview Questions
