Filter interviews by
I applied via Walk-in and was interviewed before Apr 2022. There were 5 interview rounds.
It is easy to crack with skills
You should strong in Java and c++
They asked technical topic to speak
OOPs stands for Object-Oriented Programming. It is a programming paradigm based on the concept of objects.
OOPs focuses on creating objects that contain both data and functions to manipulate that data.
It emphasizes on encapsulation, inheritance, and polymorphism.
Encapsulation is the process of hiding the implementation details of an object from the outside world.
Inheritance allows a class to inherit properties and metho...
I applied via campus placement at Government College of Engineering, Aurangabad and was interviewed in Oct 2024. There were 3 interview rounds.
Mostly questions on logical aptitude
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
Trie is a tree data structure used for efficient retrieval of key-value pairs.
Trie is typically used for storing and searching strings efficiently.
Each node in a trie represents a single character of a string.
Trie allows for prefix search, making it useful for autocomplete features.
Common operations on a trie include insertion, deletion, and search.
Example: Trie data structure can be used to implement a dictionary with
posted on 14 Mar 2022
3 coding questions of moderate difficult
posted on 26 Jul 2024
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Online MCQs - 15 Questions (Aps, DSA, Output Prediction)
1 Question (with 3 Enhancement)
Remove middle element from a stack with odd length
Find the middle index of the stack by dividing the length by 2
Remove the element at the middle index
Adjust the stack by shifting elements if necessary
I applied via Referral and was interviewed in Sep 2021. There were 2 interview rounds.
posted on 12 Jun 2024
20 questions aptitude
posted on 7 Dec 2023
I applied via Campus Placement and was interviewed in Jun 2023. There were 3 interview rounds.
Mcqs on os,dbms,cn oops,dsa
The question covers topics like tree diameter, 2 sum problem, and sliding window technique.
For the diameter of a tree, you can use depth-first search (DFS) or breadth-first search (BFS) to find the longest path between any two nodes.
The 2 sum problem involves finding two numbers in an array that add up to a given target. You can use a hash table or two pointers approach to solve it efficiently.
Sliding window technique ...
Sort an array of 0s, 1s, and 2s in ascending order.
Use the Dutch National Flag algorithm to sort the array in a single pass.
Maintain three pointers: low, mid, and high.
Swap elements based on their values and move the pointers accordingly.
posted on 14 Mar 2022
3 coding questions of moderate difficult
posted on 31 May 2024
Dsa predict the output
One medium problem. Based on that the students are selected. And modifications in code has been asked
based on 7 reviews
Rating in categories
Test Engineer
50
salaries
| ₹2.3 L/yr - ₹10 L/yr |
Software Engineer
41
salaries
| ₹4 L/yr - ₹13.4 L/yr |
Software Developer
36
salaries
| ₹3 L/yr - ₹12 L/yr |
Softwaretest Engineer
25
salaries
| ₹2 L/yr - ₹6.8 L/yr |
Associate Project Manager
21
salaries
| ₹4 L/yr - ₹7 L/yr |
Keysight Technologies
Spirent Communications
Anritsu
Viavi Solutions