ideyaLabs Software Engineer Interview Questions and Answers

It has basic aptitude question

If you unable to clear apti then there is a option for GD

Q1. Basic question on technical stuffs are asked This is the L1 round. If u clear this then u go to L2 round.
Add your answer
Q2. Oops, Dsa, Dbms, Html,Css
Add your answer

Q1. This the final technical round which is called the L2 round
Add your answer

Q1. The HR focus on your communication skills and why u want to join the company and personal stuffs.
Add your answer

Q1. Basics of your technical skills
Add your answer

Q1. More Projects related questions
Add your answer

There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS

Q1. First question was binary search in unsorted arrays So here i have asked about sorting algorithms all sorting algorithms must be clear
Add your answer
Q2. Second question was to find longest consecutive subarray.
Ans. 
Find the longest consecutive subarray.
• Iterate through the array and keep track of the current subarray length.

• Update the maximum length as you iterate.

• Reset the current subarray length when a non-consecutive element is encountered.
Answered by AI
Add your answer

Q1. OOPS related question Heap insertion deletion question Hashing Spanning tree
Add your answer
Q2. Minimum Spanning tree Implementation of MST
Ans. 
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
• MST can be found using Prim's algorithm or Kruskal's algorithm.

• Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.

• Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.

• MST has...read more
Answered by AI
Add your answer

Q1. Collections,Spring boot
Add your answer

Q1. Managerial round face to face.
Add your answer

Q1. Salary expectations and all
Add your answer