KPIT Technologies Software Engineer Trainee Interview Questions and Answers

Have prepared to the basic math, logical, reasoning it'll help to clear this round.

General Apptitude test

Q1. Palindrome Check
Add your answer
Q2. OOPS ,Exception,Multithreading
Add your answer

Q1. OOPS ,Exception,Multithreading,Collections
Add your answer

Basic array and sql problems

Q1. Why should we hire you
Add your answer

Very hard question and 4 qs in total

Q1. Tell me about yourself
Add your answer

Q1. Tell me about 5 years after now
Add your answer

Q1. Explain the project. What is the response for rest API?
Ans. 
The project is a REST API that provides a response to client requests.
• The project is built using a RESTful architecture.

• It provides endpoints for clients to interact with the server.

• The response format is typically JSON or XML.

• Examples of endpoints include /users, /products, and /orders.
Answered by AI
Add your answer
Q2. How to do pagination in API.
Ans. 
Pagination in API is done by setting limit and offset parameters in the request.
• Set a limit parameter to specify the number of results per page.

• Set an offset parameter to specify the starting point of the page.

• Return the total number of results and the current page number in the response.

• Example: /api/users?limit=10&offset=20

• Example response: {"results": [...], "total": 100, "page": 3}
Answered by AI
Add your answer

Aptitude and bit of coding questions ,60 questions in 50 minutes.. Negative marks for wrong answers

Q1. They focus more on problem solving skills and coding..
Add your answer

Q1. Asked questions related to projects
Add your answer

Q1. Questions Regarding Project
Add your answer
Q2. Explain Your Project
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It starts with a brief introduction and then the interviewer move to coding questions

Q1. 
Pascal's Triangle Problem Statement
You are provided with an integer N. The objective is to return a 2-dimensional list representing Pascal’s triangle up to row N.
A Pascal's triangle is a triangular arr...read more
Ans. Recursive Solution
The idea is to use recursion to get the value of the coefficients we will create a helper function CALPASCAL which will take row and entry as its input parameters and we call this function in the main function of PRINTPASCAL.
• Inside the function CALPASCAL if the row is 0 or the entry is equal to row then we will just return 1.
• Else we will return the sum of adjacent previous row value that is CALPASCAL(...read more
Answered Anonymously
Add your answer
Q2. 
Set Matrix Zeros Problem Statement
Given an N x M integer matrix, if an element is 0, set its entire row and column to 0's, and return the matrix. Specifically, if a cell has a value 0 (i.e., matrix[i][j]...read more
Ans. Brute-Force Approach
The basic idea is to maintain another boolean matrix ‘isZero’ which stores whether our resultant matrix should contain a zero at a particular index or not. We can traverse every element of our original matrix. If the element is 0, then we traverse the complete row and complete column of that particular element and set isZero values accordingly to true for all the elements in that row and column.
&nbs...read more
Answered Anonymously
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Easy

It starts with a brief introduction and then the interviewer move to coding questions. It basically consists of two coding questions
and some general questions like why should we hire you?

Q1. 
K-th Smallest Element in BST
Your task is to find the ‘K-th’ smallest element in a given Binary Search Tree (BST).
Explanation:
A Binary Search Tree is a binary tree in which for each node, all elements...read more
Ans. Recursion In-order
The basic idea is that traversal the whole tree in an inorder manner and adds the node values in an array and at the end return the ‘k-1’th element of the array. Due to BST property, inorder traversal of BST will in a sorted order( ascending ).
 
Code -
• Initialize a global array ‘arr’, which stores the elements of the BST.
• Use an ‘inorder(root)’ recursive function, to add all the child node in ‘arr’
  • F...read more
Answered Anonymously
Add your answer
Q2. 
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.
Input:
The first lin...read more
Ans. Brute Force
• One simple naive solution is to try every possible triplet present in the array as a candidate for the pythagorean triplet.
• So, we simply run three nested loops, and pick three integers and check if they follow the property given in the problem statement( i.e for three integers a,b and c a^2 b^2 = c^2).
• If we find any required triplet, we return true. Otherwise, if we can't find any valid triplet, we return fa...read more
Answered Anonymously
Add your answer