Filter interviews by
I applied via campus placement at Loyola College, Chennai and was interviewed in Jan 2024. There were 3 interview rounds.
Quantitative,logical, technical mcq
I applied via Website and was interviewed before Jun 2023. There were 3 interview rounds.
Online exam on sql, a bit of Java etc
Nothing much; just a GD
Pseudo code for a problem
Top trending discussions
Binary heap is used to implement a priority queue.
Binary heap is a complete binary tree where each node has a value greater than or equal to its children.
It can be implemented using arrays, where the parent of node at index i is at index (i-1)/2.
Insertion and deletion operations have time complexity of O(log n) in a binary heap.
A binary tree can have any number of nodes, but the maximum number of trees with n nodes is 2^n.
A binary tree can have 0 nodes, 1 node, 2 nodes, or any number of nodes.
The maximum number of binary trees with n nodes is 2^n.
For example, a binary tree with 3 nodes can have up to 8 different structures.
Use a SQL query to find the second highest marks in a student database.
Use the ORDER BY clause to sort the marks in descending order
Use the LIMIT clause to limit the result to the second row
Program to check if two strings are anagrams
Create a function that takes in two strings as input
Remove any spaces and convert both strings to lowercase for consistency
Sort the characters in both strings and compare if they are equal to determine if they are anagrams
Example: 'listen' and 'silent' are anagrams
posted on 4 Sep 2024
I applied via campus placement at International Institute of Information Technology (IIIT), Bhubaneswar and was interviewed in Aug 2024. There were 3 interview rounds.
It was a mcq + coding round with computer fundamentals and aptitude + easy-medium level dsa questions.
It was an offline aptitute test with 30 questions for 30 minutes.
Detect a loop in a linked list by using Floyd's Cycle Detection Algorithm
Use two pointers, slow and fast, to traverse the linked list
If there is a loop, the fast pointer will eventually meet the slow pointer
Initialize slow and fast pointers at the head of the linked list
Move slow pointer by one step and fast pointer by two steps in each iteration
If the fast pointer reaches the end of the list or meets the slow pointer,
Find the unique element in an array of strings
Iterate through the array and use a hashmap to store the frequency of each element
After iterating, check the hashmap for elements with frequency 1 to find the unique element
I have worked on various projects including a web application for a local business and a mobile app for tracking daily habits.
Developed a web application using HTML, CSS, and JavaScript for a local business to manage their inventory and sales.
Created a mobile app using React Native to track daily habits and provide reminders for healthy routines.
Collaborated with a team to implement new features and fix bugs in existin...
MySQL query to select the id of second highest salary from employee table
Use ORDER BY clause to sort salaries in descending order
Use LIMIT to select the second row
Use a subquery to avoid duplicates if multiple employees have the same salary
posted on 12 Dec 2024
Performance of an application can be improved by optimizing code, using efficient algorithms, caching data, and scaling resources.
Optimize code by reducing unnecessary loops, improving database queries, and minimizing memory usage
Use efficient algorithms like binary search instead of linear search for large datasets
Implement caching mechanisms to store frequently accessed data and reduce database calls
Scale resources b...
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
I applied via Company Website and was interviewed in May 2024. There were 4 interview rounds.
Make a autobiography app
posted on 30 Apr 2024
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
It was Machine test, i had to make a project and connect it to Database and submit details in database table from form.
Collection Framework is a unified architecture for representing and manipulating collections of objects in Java.
It provides interfaces (List, Set, Queue, etc.) and classes (ArrayList, HashSet, PriorityQueue, etc.) to store and manipulate groups of objects.
Collections can be easily sorted, searched, and iterated using methods provided by the Collection Framework.
Example: ArrayList is a class that implements the List int...
RestApi is a set of rules and conventions for building and interacting with web services using HTTP methods.
RestApi stands for Representational State Transfer Application Programming Interface.
It allows communication between different software systems over the internet.
RestApi uses standard HTTP methods like GET, POST, PUT, DELETE for data manipulation.
JSON or XML formats are commonly used for data exchange in RestApi.
...
The addAll() method is used to add all elements of one ArrayList to another.
Use the addAll() method to add all elements of one ArrayList to another
Syntax: list1.addAll(list2);
Example: ArrayList
I applied via campus placement at National Institute of Engineering (NIE) and was interviewed in Apr 2024. There were 4 interview rounds.
2 questions, Easy and medium based
posted on 18 Apr 2024
Scenario questions logical solving
Need to explain about problems solved in previous round
based on 2 interviews
Interview experience
based on 8 reviews
Rating in categories
Associate Data Engineer
9
salaries
| ₹4 L/yr - ₹5 L/yr |
Data Engineer
7
salaries
| ₹6 L/yr - ₹8.5 L/yr |
Senior Data Engineer
5
salaries
| ₹9.5 L/yr - ₹15.5 L/yr |
Office Manager
4
salaries
| ₹7 L/yr - ₹15.7 L/yr |
Data Engineer Staff
4
salaries
| ₹21 L/yr - ₹30 L/yr |
Informatica
Talend Data Integration Services
SnapLogic
Mulesoft