i
Advisor360°
Filter interviews by
I applied via campus placement at Manipal Institute of Technology (MIT) and was interviewed before Oct 2023. There were 2 interview rounds.
Easy array and string based questions
Top trending discussions
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.
Sql mcq questions with medium difficulty
posted on 23 Dec 2024
I was interviewed in Nov 2024.
Hacker Rack Test with medium to high difficulty
I am currently working on developing a mobile application for tracking fitness goals and progress.
Developing a mobile app using React Native
Implementing features such as goal setting, progress tracking, and workout logging
Integrating with wearable devices like Fitbit for data synchronization
Basic Coding Java and algorithm questions
posted on 23 Dec 2024
Create a basic React app with dummy data fetched from a JSON API.
Set up a new React project using create-react-app
Create a component to fetch data from a JSON API using fetch or axios
Display the fetched data in the component
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
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 5 Sep 2024
I applied via Job Fair and was interviewed in Aug 2024. There was 1 interview round.
I applied via Company Website and was interviewed in Aug 2024. There was 1 interview round.
based on 2 interviews
Interview experience
based on 5 reviews
Rating in categories
Senior Software Engineer
9
salaries
| ₹35 L/yr - ₹58.3 L/yr |
Software Engineer III
6
salaries
| ₹30.5 L/yr - ₹50 L/yr |
Software Development Engineer II
5
salaries
| ₹17.6 L/yr - ₹33 L/yr |
Software Engineer
4
salaries
| ₹7.9 L/yr - ₹37.8 L/yr |
Software Engineer2
4
salaries
| ₹16.5 L/yr - ₹28 L/yr |
Zerodha
Upstox
Groww
Paytm Money