National Payments Corporation of India Software Engineer Interview Questions and Answers

Basic dsa plus aptitude total of 50 ques

Q1. Array and array matrix coding question and some logical question
Add your answer

Q1. Noarmal hr question and then some logical tricky question , situation based question
Add your answer

78 mcq questions and 2 dsa

Coding based round on dsa

Normal MCQ questions on JS

Write a program to use debouncing in frontend

Q1. Behavioural questions
Add your answer
Q2. Why this company and why you?
Ans. 
I am passionate about the company's innovative projects and believe my skills align well with the team's goals.
• I have been following the company's work closely and am impressed by their commitment to cutting-edge technology.

• I believe my experience in software development, particularly in the areas of machine learning and AI, would be a valuable addition to the team.

• I am excited about the opportunity to work with a tale...read more
Answered by AI
Add your answer

Q1. REST API for User CRUD
Ans. 
Design a RESTful API for CRUD operations on user resources.
• Use HTTP methods like GET, POST, PUT, DELETE for CRUD operations

• Create endpoints like /users for listing all users, /users/{id} for specific user

• Use status codes like 200 for success, 404 for not found, 400 for bad request

• Implement authentication and authorization mechanisms for security

• Include request and response body formats like JSON or XML
Answered by AI
Add your answer
Q2. Two Sum Leetcode problem
Add your answer
Q3. Basic questions based on the candidate technical skills
Add your answer

Q1. Basics to Intermediate level of questions based on the skills mentioned in the resume
Add your answer
Q2. Projects related discussions
Add your answer

Q1. I was informed to upload the supporting documents. ( They rejected me after this eventhough all my documents are genuine )
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Fruits and Baskets Problem Statement
You are given 'n' fruit trees planted along a road, numbered from 0 to n-1. Each tree bears a fruit type represented by an uppercase English alphabet. A Ninja walking ...read more
Ans. 
The problem is to find the maximum number of fruits the Ninja can put in both baskets after satisfying given conditions.
• The Ninja can start at any tree and end at any tree, but cannot skip a tree.

• He can pick one fruit from each tree until he cannot, i.e., when he has to pick a fruit of the third type.

• The restriction is that each basket can have only one type of fruit.

• We need to find the maximum number of fruits that ca
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Was Shortlisted For this round with in total of 22 students, 7 in my profile.
It was Technical round with 30 mins of time allotted.
The interviewer was friendly, started with basic questions about me followed by project specific and then a puzzle.

Q1. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
The problem requires sorting an array of 0s, 1s, and 2s in a single scan.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s.

• Initialize the low pointer at the beginning of the array and the high pointer at the end.

• Iterate through the array using a current pointer and swap elements based on their values.

• Move the pointers accordingly until the array is sorted.

• The time complexity of this solution is O(N) a
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Hard

The interview was scheduled for 15 mins and 12 students were shortlisted for this round. 5 in my profile.
The interviewer didn't on his video whereas mine was, the interviewer was friendly and maintained a poker voice.
Asked Basic HR questions but crossed questioned several times.

Q1. What is treeset and weakhashmap?
Ans. 
TreeSet is a sorted set implementation in Java. WeakHashMap is a hash table-based Map implementation with weak keys.
• TreeSet is implemented using a tree structure and maintains elements in sorted order.

• WeakHashMap is a Map implementation that allows keys to be garbage collected when they are no longer referenced.

• WeakHashMap is useful for caching or memoization where the keys are not always needed and can be garbage coll
Answered by AI
Add your answer
Q2. What is comparable and comparator?
Ans. 
Comparable and Comparator are interfaces used for sorting objects in Java.
• Comparable interface is used to define the natural ordering of objects based on their own class.

• Comparator interface is used to define the ordering of objects based on a separate class.

• Comparable interface has compareTo() method while Comparator interface has compare() method.

• Comparable interface is implemented by the class whose objects need to ...read more
Answered by AI
Add your answer

Q1. Fundamentals based upon the role
Add your answer

Q1. Basic advance question into the technical skills like if you’re applying for backend role and your preferred language is java then how does the stack and queue works
Add your answer

Q1. General discussion on experience
Add your answer

Q1. Knowledge on SQL and how to write a query
Add your answer
Q2. Knowledge on DSA and coding problems to solve.
Add your answer
Q3. Knowledge on APIS (structure, security etc.)
Add your answer