Filter interviews by
Be the first one to contribute and help others!
I applied via Approached by Company and was interviewed in Nov 2024. There were 8 interview rounds.
A group discussion (GD) is a structured conversation where a group of people discuss a topic and are observed by a panel of judges or interviewers
Coding tests for interviews are designed to evaluate a candidate's ability to think creatively and adapt their solutions to changing scenarios.
A case study interview is a job interview where a candidate is presented with a business scenario and asked to analyze it and propose a solution.
Interview assessment tests can include aptitude tests, personality tests, cognitive ability tests, presentations, and writing tasks:
An aptitude test is quite vital for placements as it helps in enhancing the logical skills of the person and if someone is preparing for interviews then aptitude preparation is very much required.
I was interviewed in Sep 2024.
I applied via Naukri.com and was interviewed in Dec 2024. There was 1 interview round.
Data Analyst focuses on analyzing data to provide insights, while Data Scientist focuses on using advanced algorithms and machine learning to predict future trends.
Data Analyst focuses on analyzing data to provide insights for decision-making.
Data Scientist focuses on using advanced algorithms and machine learning to predict future trends.
Data Analyst typically works with structured data, while Data Scientist works wit...
I was interviewed in Jan 2025.
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
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
I was interviewed in Aug 2024.
A business case relevant assignment to assess data visualization and DAX skills.
posted on 4 Nov 2024
A link was provided for the 15-minute online aptitude test.
90 minutes coding round. There were three problems. One for JavaScript and two for ReactJS
posted on 19 Oct 2024
I applied via LinkedIn and was interviewed in Sep 2024. There were 2 interview rounds.
Two LLM based application development
I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.
Normal basic question train and few Logic
Continue is a keyword in programming that is used to skip the current iteration of a loop and continue with the next iteration.
Continue is used in loops like for, while, and do-while to skip the current iteration and move to the next one.
It is often used to skip certain elements in an array or to avoid executing specific code under certain conditions.
Example: for(int i=0; i<5; i++) { if(i==2) { continue; } System.out.p
Associate Software Engineer
4
salaries
| ₹7 L/yr - ₹12 L/yr |
Software Engineer
3
salaries
| ₹18 L/yr - ₹20.5 L/yr |
Technical Account Manager
3
salaries
| ₹18 L/yr - ₹19.8 L/yr |
Prime Focus Technologies
MapmyIndia
Yodlee
Global Edge Software