i
Convin
Filter interviews by
I applied via Approached by Company and was interviewed before Oct 2023. There were 4 interview rounds.
Indexing in databases improves query performance by allowing faster retrieval of data.
Indexes are data structures that improve the speed of data retrieval operations on a database table.
They work by creating a sorted list of specific columns in a table, allowing the database to quickly locate the rows that match a query.
Examples of indexes include primary keys, unique keys, and composite indexes.
Indexes can be created ...
I have worked on various projects in different organizations, showcasing my versatility and adaptability.
Developed a customer management system for a retail company, improving efficiency and customer satisfaction.
Implemented a data analytics platform for a marketing agency, enabling data-driven decision making.
Collaborated on a team to create a real-time messaging application for a tech startup, enhancing communication...
Different data structures like arrays, linked lists, trees, graphs, and their indexing problems and solutions.
Arrays: indexing is O(1), but insertion/deletion at arbitrary position is O(n)
Linked Lists: indexing is O(n), but insertion/deletion at arbitrary position is O(1)
Trees: indexing depends on the type of tree (e.g. binary search tree, AVL tree)
Graphs: indexing can be done using adjacency lists or matrices
Hash Tabl...
Merge sort is a divide-and-conquer algorithm that sorts an array by recursively dividing it into halves and merging sorted halves.
Divide the array into two halves until each sub-array contains a single element.
Merge the sub-arrays back together in sorted order.
Time complexity is O(n log n), making it efficient for large datasets.
Example: Sorting [38, 27, 43, 3, 9, 82, 10] results in [3, 9, 10, 27, 38, 43, 82].
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.
Finding the median of a stream of numbers as they are received
Keep track of the numbers in a sorted data structure like a min heap and max heap
Maintain balance between the two heaps to efficiently find the median
If the total number of elements is odd, median is the middle element. If even, median is the average of two middle elements
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Familiar with Agile methodologies
Completed multiple projects including a web-based inventory management system
I appeared for an interview before May 2024, where I was asked the following questions.
I appeared for an interview in Nov 2024, where I was asked the following questions.
In my previous role, I enhanced software performance, improved user experience, and led successful project implementations.
Optimized application performance by refactoring code, resulting in a 30% reduction in load times.
Led a team of 5 developers in a project that delivered a new feature set, increasing user engagement by 25%.
Implemented automated testing, which reduced bugs in production by 40% and improved overall s...
I appeared for an interview before May 2024, where I was asked the following questions.
I have extensive experience with .NET, including building web applications, APIs, and working with various frameworks and tools.
.NET Framework and .NET Core: Developed multiple applications using both frameworks, leveraging their features for performance and scalability.
ASP.NET MVC: Built several web applications using ASP.NET MVC, implementing RESTful services and ensuring responsive design.
Entity Framework: Utilized ...
To create a complete schema for a hotel, you need to consider various entities like rooms, guests, reservations, staff, amenities, etc.
Entities to include: rooms, guests, reservations, staff, amenities, invoices, payments
Relationships between entities: guest stays in a room, staff manages reservations, amenities are available in rooms
Attributes for each entity: room number, guest name, reservation date, staff ID, ameni...
I applied via Approached by Company and was interviewed before Feb 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2023. There were 2 interview rounds.
Arrays and Pointers code
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
Building small UI screen application in 1 hr for frontend developer
based on 2 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
Software Developer fresher
12
salaries
| ₹31.7 L/yr - ₹59.2 L/yr |
Project Manager
9
salaries
| ₹21 L/yr - ₹23 L/yr |
Backend Developer
7
salaries
| ₹8 L/yr - ₹21 L/yr |
Quality Analyst
7
salaries
| ₹1.9 L/yr - ₹6 L/yr |
Data Annotation Engineer
5
salaries
| ₹3.2 L/yr - ₹4.5 L/yr |
Watchyourhealth.com
Zeta
Shorthills AI
Sequretek It Solutions