Filter interviews by
Top trending discussions
Aptitude, core concepts and a code
I learned the importance of teamwork and collaboration from my college club.
Developed strong communication skills by working with diverse group of individuals
Learned how to delegate tasks effectively to achieve common goals
Gained experience in problem-solving and conflict resolution through group projects
I want to experience living in a different country and immersing myself in a new culture.
Traveling to a foreign country and learning about their customs and traditions
Trying new foods and experiencing different ways of life
Making friends with locals and exploring the local attractions
Relational DBMS stores data in tables with predefined relationships, while non-relational DBMS stores data in flexible, schema-less formats.
Relational DBMS uses structured query language (SQL) for querying data
Non-relational DBMS can store data in various formats like key-value pairs, document-based, graph databases
Relational DBMS ensures data integrity through normalization and constraints
Non-relational DBMS offers be...
Class is a blueprint for creating objects, abstract class cannot be instantiated and can have abstract methods, interface is a contract for classes to implement certain methods.
Class is a blueprint for creating objects with attributes and methods.
Abstract class cannot be instantiated and can have abstract methods that must be implemented by subclasses.
Interface is a contract for classes to implement certain methods, bu
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
Normal questions (technical and logical question)
posted on 19 Jul 2024
They asked easy to medium DSA . It includes arrays, strings, recursion.
posted on 22 Oct 2024
I applied via Company Website and was interviewed in Sep 2024. There were 3 interview rounds.
Question related to profile.
Aptitude test questions
posted on 23 Nov 2024
I applied via campus placement at Anna University and was interviewed in Aug 2022. There were 3 interview rounds.
Two Easy questions to be solved
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
Heap sort works by building a binary heap from the array and then repeatedly extracting the maximum element and placing it at the end of the array.
The heap is maintained as a complete binary tree, where each parent node is greater than or equal to its children.
The time complexity of heap sort is O(n log n) and it is an in-place sor...
Software Engineer
15
salaries
| ₹3 L/yr - ₹7.5 L/yr |
Senior Software Engineer
10
salaries
| ₹8.5 L/yr - ₹22 L/yr |
Technical Lead
8
salaries
| ₹12.5 L/yr - ₹36 L/yr |
Softwaretest Engineer
8
salaries
| ₹2.4 L/yr - ₹7.1 L/yr |
Software Developer
7
salaries
| ₹3 L/yr - ₹9.2 L/yr |
Infosys
Wipro
TCS
HCLTech