KITO INDIA SDE-2 Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning about 10:00AM-10:40AM. The platform used for this round was hackerrank. There are 15 MCQ's which cover portions of Aptitude, Data Structures, DBMS, SQL

Q1. Minimum Operations
You are given an array 'ARR' of 'N' positive integers. You need to find the minimum number of operations needed to make all elements of the array equal. You can perform a...read more
Ans. Brute Force
For making all elements equal you can select a target value and then you can make all elements equal to that. Now, for converting a single element to a target value you can perform a single operation only once. In this manner, you can achieve your task in the maximum of  ‘N’ operations but you have to minimize this number of operations and for this, your selection of target is very important because if ...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 7:00PM-7:20PM. Platform used for this round was skype. Interviewer was very serious while taking my interview.

Q1. Basic HR Questions
Who is your role model?
Why should we hire you?
Ans. 
Tip 1 : This question aims to evaluate the candidate’s interest in the role. Are they really motivated to get hired for this specific job or do they just mass-apply to every job ad under the sun? Candidates should show that this application was a conscious decision on their part.
Tip 2 : With this question, recruiters can assess whether candidates have truly understood the role’s requirements and whether they think they...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It is online round and it was conducted around 11 AM on campus. Difficulty was medium. 2 coding questions were asked. One question is based on arrays(easy) and the other question is based on usage of oops concepts like Inheritance, polymorphism. Everything went smooth.

Q1. Subarray With Given Sum
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subar...read more
Ans. 
I started with brute force method but test cases were failed due to time complexity. Use a similar approach to a sliding window. Start with an empty subarray, add elements to the subarray until the sum is less than x. If the sum is greater than x, remove elements from the start of the current subarray
Answered by CodingNinjas
View 3 more answers
Q2. OOPS Question
Only java was allowed. Parent class was given and asked to write code for child classes and function overloading.
Ans. 
Be clear with oops concepts. If oops concepts are clear then the question can be solved easily.
Answered by CodingNinjas
View 1 more answer

Round duration - 50 minutes
Round difficulty - Medium

Round started with self introduction and discussion of project. Everything went fine.
Note: we didn't have hr round due to time constraint. You can expect hr round.

Q1. Find Duplicate
You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ...read more
Ans. 
Step 1: create an array of fixed size 256 as 256 ascii characters are available. Initialise all the elements of array with 0.
Step 2: iterate over array and store the frequency of every character.
Step 3: Iterate over the array and print the characters with frequency more than 1.
Note: problem can be solved using maps too.
Answered by CodingNinjas
View 3 more answers
Q2. DBMS Questions
Explain the concept of normalisation and types.
Ans. 
Tip 1 : Explain everything clearly.
Tip 2 : Don't use the words that you are not confident about. Interviewer might ask questions based on your answers.
Answered by CodingNinjas
View 1 more answer
Q3. DBMS Question
Explain ACID properties
Ans. 
Tip 1 : Go through DBMS concepts thoroughly.
Answered by CodingNinjas
View 1 more answer
Q4. OOPS Question
Explain oops concepts with real life examples.
Ans. 
Tip 1 : Go through oops concepts thoroughly
Answered by CodingNinjas
View 1 more answer

Round duration - 30 minutes
Round difficulty - Medium

Q1. Remove Duplicates
Given a string S, remove consecutive duplicates from it recursively.
Input Format :
String S
Output Format :
Output string
Constraints :
1 <= |S| <= 10^3
where |S| represen...read more
Ans. 
use the LinkedHashSet (Set Interface) to retain the original insertion order of the elements into the set.

The main factor that we must keep in mind when dealing with arrays is not the elements that have duplicates. The main problem here is removing the duplicates instead. Arrays are static data structures that are of fixed length, thus not possible to be altered. So, to delete elements from arrays, you need to create n...read more
Answered by CodingNinjas
View 1 more answer
Q2. DSA Questions
1. Benefits of Learning Data Structures ?
2. Can you explain the difference between file structure and storage structure?
3. What is a multidimensional array?
4. What is a stack? What are the app...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Q1. Reverse String
You are given a string ‘S’. You are also given ‘M’ integers in an array ‘A’. You perform ‘M’ operations on this string. The operations are given in an array ‘A’ of size ‘M’.
You perform th...read more
Ans. 
Declare a string.
Take out the length of that string.
Loop through the characters of the string.
Add the characters in reverse order in the new string.
String str = "hello";

String reverse = "";

int length = str.length();

for (int i = 0; i < length; i++) {

reverse = str.charAt(i) + reverse;

}

System.out.println(reverse);
Answered by CodingNinjas
View 1 more answer
Q2. DSA and OOPS Questions
How can you find the largest or smallest number in an array of integers?
What is an AVL Tree?
What is the difference between tree and graph data structure?
Oops concepts with principal.
B...read more
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Q1. Basic HR Questions
Why should we hire you ? 
How you are fit for this position ? 
Why you are looking into service based organization ? 
Tell me about your family in brief. 
How soon will yo...read more
Ans. 
Tip 1 : Be confidence about introduction part do not get hesitated during your HR discussion
Tip 2 : Try to be uniform the way & show them interested to join the organization.
Tip 3 : Majorly the focus on behavioural and communication skills.
Answered by CodingNinjas
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 10AM-11AM
Interviewer was quite supportive and helpful.
Environment was normal as usual and it was morning time

Q1. Application Question
Design a system where user can upload, delete and share the video/image files. 
And can immediately view the uploaded files on the different logged-in system
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 11AM-12PM
The interviewer was SDE2
He was checking the code for edge cases and was hinting if required

Q1. Implement a priority queue
Ninja is given a task to implement a priority queue using Heap data structure. The Ninja is busying preparing for the tournament., So he asked for your help.
Your task is to us...read more
Ans. Array representation of heap
 
1. Since the heap is maintained in the form of a complete binary tree, the heap can be easily represented in the form of an array.
2. To keep the tree complete and shallow, while inserting a new element insert it in the leftmost vacant position in the last level i.e., at the end of our array, and perform some operation to maintain the property of the heap.
3. Similarly, for deleting the maximum e...read more
Answered by CodingNinjas
Add your answer
Q2. Ninja and the bulbs
Ninja owns an electronic shop. In the shop, Ninja has 'N' bulbs. To sell these bulbs, Ninja has to check if they are of good quality. To check bulbs, Ninja uses a unique techniq...read more
Ans.  Brute Force
Approach:
A brute force solution to this problem is to turn on and off the bulbs N time, then at last check the number of bulbs that are on.

 
Algorithm:
• Take a boolean array of ‘BULBS’ of size N+1.
• Itertate on ‘i’ from 1 to ‘N’
  • Iterate on ‘j’ form ‘i’ to ‘N’ and each time increment ‘j’ as ‘j’ += ‘i’.
    • if(BULBS[j] == true) then make it false.
    • If (BULBS[j]==false) then make it true.
• Intialise a variable ‘COUNT’ =...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 6PM-7PM
The interviewer was not interactive and didn't gave any feedback whatsoever.
It was Hiring Manager Round
Interviewer was Software Development Manager at Amazon

Q1. Maximize the sum
You are given two sorted arrays of distinct integers, ‘ARR1’ and ‘ARR2’. If you find a common element in both arrays, you can switch from one array to another.
Your task is to find a pat...read more
Ans. Recursive
In this problem, our primary focus is on the common elements i.e. an element that is present in both the arrays. Then, we have to decide whether we have to make a switch. So for that, first we store all the elements of ‘ARR1’ and ‘ARR2’ into ‘MAP1’ and ‘MAP2’ respectively. 
 
Now we call our ‘maximiseSumHelper’ function. We call this function for both cases i.e starting with ‘ARR1’ and starting with ‘A...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 360 minutes
Round difficulty - Hard

Timing- Any 6 hours of my choice in the 24 hour window. (10:00 p.m. to 4:00 a.m. I selected)
Environment was very friendly and easy to use.
No significant activity.
This was the only coding round.

Q1. Prime time again
You have been given two integers ‘DAY_HOURS’ and ‘PARTS’. Where ‘DAY_HOURS’ is the number of hours in a day and a day can be divided into ‘PARTS’ equal parts. Your task is to find total i...read more
Ans. 
Step1:First we had to decide whether the user enters valid parts which can occur in a day according to our question.
Step 2:Search for the prime time and valid times which can occur in the clock for the given range.
Step 3: Print the next valid time otherwise print 0.
Answered by CodingNinjas
View 3 more answers

Round duration - 10-15 minutes
Round difficulty - Easy

Timing- 12:15 p.m. 
Environment was very good .
Not any significant activity.
The interviewer was very friendly and talked like friends.

Q1. DBMS Questions
1) A table was shown to me and I was asked to write a query for displaying unique elements.
2) What is RDBMS ?
3) Difference between MySql & NoSql.
Ans. 
Tip 1 : Do practice SQL queries.
Tip 2 : Must have theoretical knowledge of DBMS.
Tip 3 : Read SDLC Waterfall Model thoroughly
Answered by CodingNinjas
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

Timing- 12:30 p.m. to 12:45 p.m
Environment was very comfortable.
No other significant activity.
Interviewer was very good and talking very politely & friendly.

Q1. HR Discussion
Ans. 
Tip 1 : Make you you know the history, work culture and CEO of whichever company you are going for the interview.
Tip 2 : Tell optimistic answers so that they are impressed.
Tip 3 : My approach was very normal & I gave answers to the point.
Answered by CodingNinjas
Add your answer

Round duration - 180 minutes
Round difficulty - Hard

Timing: 8 a.m. to 11a.m.
Environment was optimum.
No significant activity.

Q1. Edit Distance
You are given two strings 'S' and 'T' of lengths 'N' and 'M' respectively. Find the "Edit Distance" between the strings.
Edit Distance of two strin...read more
Ans. Recursive Approach
• We will write a recursive approach.
• The base case would be if the length of the first string is 0 then we need to add all the characters of the second string to the first string hence return the length of the second string. Similarly, if the length of the second string is 0 return length of the first string.
• Now the recurrence relation is as follows:
  • If the last characters of two strings are not the same...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 30 minutes
Round difficulty - Medium

Timing: 12:00 p.m. to 12:30 p.m.
The environment was quite good.
No significant activity.
Interviewers were very friendly. They were behaving like friends.

Q1. SQL Qusestions
What is the difference between drop and truncate?
How would you sort and display a column of table in descending order?
Create a table with primary key.
Set the marks of student to 50 whose addr...read more
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Timing: 3:00 p.m. to 3:20 p.m.
Environment was very good.
No significant activity was monitored.
HR was very good and friendly.

Q1. Basic HR Questions
Why tcs?
What are your expectations?
Where do you see yourself in 5 years?
Ans. 
Tip 1 : Answered yes to relocation questions.
Tip 2 : Told them that I am not interested in studying further.
Tip 3 : I answered honestly on what would I choose my hometown(Patna) for work or my college location(Kolkata).
Answered by CodingNinjas
Add your answer