Kronos Incorporated interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Kronos Incorporated
2 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Journey
My journey began in college when I observed my friends learning new coding languages and working on exciting projects. Inspired by their enthusiasm, I decided to dive into learning and coding myself.
Application story
I received the opportunity off-campus but unfortunately was rejected after the technical interview. The interviewer asked dynamic programming-related questions, and in the coding round, I encountered medium to hard-level questions.
Why selected/rejected for the role?
I was rejected because, during the technical interview, I was unable to solve the dynamic programming-related question posed by the interviewer.
Preparation
Duration: 2 Months
Topics: Data Structures & Algorithms, Operating System, Object-Oriented Programming System, DBMS, CN
Tip 1: Prepare DSA well.
Tip 2: Be confident & relaxed during the interview.
Tip 3: Do revise your projects i.e. how it works and what are its functionalities.
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1: Keep your resume concise, aiming for just one page, and include all the skills you're confident in.
Tip 2: Avoid including false information on your resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date7 Oct 2021
Coding problem1
There was 1 Coding question and 15 MCQs.
1. Reverse Edges
Moderate
20m average time
80% success
0/80
Asked in companies
You are given a directed graph of ‘N’ nodes and ‘M’ edges. Also, you have two nodes ‘A’ and ‘B’. Your task is to make at least one valid path from ‘A’ to ‘B’ by doing the below operations a minimum number of times.
Choose two nodes ‘X’ and ‘Y’, such that there exists an edge from ‘X’ to ‘Y’.
Delete edge ‘X’ to ‘Y’.
Add edge ‘Y’ to ‘X’.
You need to print the minimum operations that you have done.
02
Round
Medium
Face to Face
Duration60 Minutes
Interview date12 Oct 2021
Coding problem1
In the technical interview, the interviewer asked Python, project-related, and DBMS questions, along with puzzling problem and dynamic programming-related questions. During the coding round, I encountered medium to hard questions, but unfortunately, I was unable to solve the puzzle problem.
1. Longest Increasing Subsequence
Moderate
30m average time
65% success
0/80
Asked in companies
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.
Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.
For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
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
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
Software Developer
2 rounds | 4 problems
Interviewed by Kronos Incorporated
Rejected
797 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57825 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes