Kelly services India private limited interview experience Real time questions & tips from candidates to crack your interview

QA

Kelly services India private limited
upvote
share-icon
4 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 8 months
Topics: Computer networks(till CCIE level), python basics, OOPS, Data structures, Algorithms
Tip
Tip

Tip 1 : Ready for coding round with basics and DSA also these days.
Tip 2 : Ready any core subject like computer networks, operating system etc
Tip 3 : Go with atleast 2 projects.

Application process
Where: Campus
Eligibility: 65% in B.tech
Resume Tip
Resume tip

Tip 1: Please have projects on resume if you are fresher.
Tip 2: Whatever topics you are confident in, please mention only those topics.

Interview rounds

01
Round
Medium
Coding Test - Pen and paper
Duration120 minutes
Interview date28 Nov 2017
Coding problem1

1. Sort Array

Moderate
15m average time
85% success
0/80
Asked in companies
SprinklrHSBCHCL Technologies

You are given an array consisting of 'N' positive integers where each integer is either 0 or 1 or 2. Your task is to sort the given array in non-decreasing order.

Note :
1. The array consists of only 3 distinct integers 0, 1, 2.
2. The array is non-empty.
Problem approach

With the help of coding and reasoning I solved.

Try solving now
02
Round
Hard
Face to Face
Duration60 minutes
Interview date29 Nov 2017
Coding problem1

1. Technical questions

ospf protocols states and functions

03
Round
Easy
Face to Face
Duration45 minutes
Interview date29 Nov 2017
Coding problem2

1. Reverse List In K Groups

Easy
0/40

You are given an array Arr consisting of n integers. You need to find the equilibrium index of the array. An index is considered as equilibrium index if the sum of elements to the left of that index is equal to the sum of elements to the right of it.

Note:

The array follows 0-based indexing, so you need to return the 0- based index of the element. If there are multiple indices which satisfy the given condition, then return the left-most index. If no such index is present in the array, return -1.
Try solving now

2. Check if sum of left side of array equal to right side of array

Easy
0/40

You are given an array Arr consisting of n integers. You need to find the equilibrium index of the array. An index is considered as equilibrium index if the sum of elements to the left of that index is equal to the sum of elements to the right of it.

Note:

The array follows 0-based indexing, so you need to return the 0- based index of the element. If there are multiple indices which satisfy the given condition, then return the left-most index. If no such index is present in the array, return -1.
Try solving now
04
Round
Hard
Face to Face
Duration30 minutes
Interview date30 Nov 2017
Coding problem1

Manager round

1. Technical questions

about traffic generators, system design, waterfall method

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
960 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
QA
4 rounds | 4 problems
Interviewed by HCL Technologies
0 views
0 comments
0 upvotes