Information Dynamic interview experience Real time questions & tips from candidates to crack your interview
SDE
Information Dynamic
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
I took admission in tier 3 college for B.Tech in Computer Science. Firstly I planned that I will start learning DSA from the first year but I could not. So, I started DSA from the fourth semester and along with DSA, I also learned development because that is what I wanted to be. By the end of Third year, I was confident in both DSA and development but even then I keep on revising the concepts.
Application story
I got a message in my whatsapp group about the company visiting our campus for the hiring of SDE-1. As, I was in the fourth year, it was sure that I am going to apply for it. I started preparing accordingly and got selected at last.
Why selected/rejected for the role?
I was confident during the full interview process. Actually, I worked a lot on my communications skills and I think they were the main reasons for me getting par the selection process.
Preparation
Duration: 2 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Easy
Online Coding Test
Duration30 minutes
Interview date18 Feb 2022
Coding problem2
1. Sort Array
Moderate
15m average time
85% success
0/80
Asked in companies
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.
2. Merge LinkedList
Easy
20m average time
70% success
0/40
Asked in companies
You are given two LinkedList of length ‘N’. Your task is to insert the elements of the second LinkedList in the first LinkedList at the alternate positions.
For example: Let 1 -> 3 -> 5 be the first LinkedList and 2 -> 4 -> 6 be the second LinkedList. Then after merging the first LinkedList will look like 1 -> 2 -> 3 -> 4 -> 5 -> 6.
02
Round
Easy
HR Round
Duration25 minutes
Interview date25 Feb 2022
Coding problem1
1. Basic HR Questions
Introduce yourself
Why do you want to join us?
What are your hobbies?
What do you think makes you a better choice than the other candidates?
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
2 rounds | 3 problems
Interviewed by Information Dynamic
Selected 
561 views
0 comments
0 upvotes
SDE
2 rounds | 3 problems
Interviewed by Information Dynamic
Selected 359 views
0 comments
0 upvotes
SDE
2 rounds | 3 problems
Interviewed by Information Dynamic
Selected 380 views
0 comments
0 upvotes
SDE
2 rounds | 3 problems
Interviewed by Information Dynamic
Selected 387 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE
3 rounds | 6 problems
Interviewed by PhonePe
Selected 0 views
0 comments
0 upvotes
SDE
5 rounds | 8 problems
Interviewed by Mathworks
Selected 1204 views
0 comments
0 upvotes
SDE
4 rounds | 7 problems
Interviewed by PhonePe
Selected 0 views
0 comments
0 upvotes