Ivy Comptech interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Ivy Comptech
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
I started preparing for the placement in the third year, and then I got this opportunity in 4th Year from On-Campus Placement. There was a total of three rounds. After clearing all three rounds, I got Selected.
First Round - Coding Test
Second Round - Technical Interview
Third Round - Technical Interview
Application story
I started preparing for the placement in the third year, and then I got this opportunity in the 4th year from On-Campus Placement. There was a total of 3 rounds. Fortunately, I got selected because I was decent in DSA and had an excellent command of Java.
Why selected/rejected for the role?
I got Selected because I performed very well in all three rounds. I was able to answer all questions that were asked on JAVA, DSA, and DBMS.
Preparation
Duration: 9 months
Topics: Data Structures, Java, OOPS, Algorithms, DBMS
Tip 1: Do regular practice of DSA (You can refer any programming sheet)
Tip 2: Master any Programming Language
Tip 3: Do Extra Subjects (core engineering subjects) and do at least Some basics of DBMS
Application process
Where: Campus
Eligibility: 6 CGPA
Tip 1: The DSA level should be good.
Tip 2: Good command of any one programming Language.
Interview rounds
01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date1 Oct 2021
Coding problem2
It has 2 Coding Questions of easy-medium level, and the time limit was 60 minutes only.
1. Largest Sum Subarray with at least K Numbers
Moderate
0/80
Asked in companies
Given an array 'arr' and a number 'k'.
Find the largest sum of the subarray containing at least 'k' numbers. It may be assumed that the size of the array is at least 'k'.
Example :
Input: 'arr' = [1, 4, -2] and 'k' = 2
Output: 5
Explanation: The subarray with the largest sum is [1, 4]. So the sum will be 5.
Problem approach
First, I applied brute force, but it showed TLE.
Then, I applied optimization and was able to solve the problem.
2. Longest Substring Without Repeating Characters
Moderate
20m average time
80% success
0/80
Asked in companies
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is "abacb", then the length of the longest substring without repeating characters will be 3 ("acb").
Problem approach
The first approach was brute force, and then, I optimized it using the HashMap.
02
Round
Medium
Face to Face
Duration60 minutes
Interview date11 Oct 2021
Coding problem1
Questions were mainly asked on DSA Java.
03
Round
Easy
Face to Face
Duration60 minutes
Interview date13 Oct 2021
Coding problem2
Questions were mainly asked on DSA, Java, and SQL.
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
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
960 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 3451 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 57824 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes