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 2 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 telegram 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: No Backlogs
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
Duration50 minutes
Interview date10 Mar 2022
Coding problem2
1. Top View
Moderate
42m average time
61% success
0/80
Asked in companies
Given a binary tree. Print the Top View of Binary Tree. Print the nodes from left to right order.
Example:
Input:
Output: 2 35 2 10 2
2. Delete a Node from Linked List
Moderate
40m average time
67% success
0/80
Asked in companies
You have been given a linked list of integers. Your task is to write a function that deletes a node from a given position, 'POS'.
Note :
Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
Illustration :
The following images depict how the deletion has been performed.
Image-I :
Image-II :
02
Round
Easy
HR Round
Duration30 minutes
Interview date17 Mar 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 
387 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