Filter interviews by
Top trending discussions
I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.
posted on 31 May 2022
I appeared for an interview before May 2021.
Round duration - 90 minutes
Round difficulty - Easy
Timing - 10AM-11:30AM
Online proctored test
Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the righ...
The task is to print the right view of a binary tree, representing nodes visible from the right side in top-to-bottom order.
Traverse the tree level by level and keep track of the rightmost node at each level
Print the rightmost node of each level to get the right view of the tree
Use a queue for level order traversal and a map to store the rightmost nodes
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Round duration - 45 minutes
Round difficulty - Medium
Timing : 4PM-5PM
Environment - Online
There was a panel of 3 interviewers
You can find the size of an array in C or C++ by dividing the total size of the array by the size of one element.
Calculate the total size of the array by multiplying the number of elements by the size of each element.
Divide the total size by the size of one element to get the size of the array.
For example, if you have an array of strings arr[] = {'hello', 'world', 'example'}, you can find the size by dividing the total
B+ trees are used for indexing in databases to efficiently search and retrieve data.
B+ trees are balanced trees where each node can have multiple keys and child pointers.
Data is stored in leaf nodes, while non-leaf nodes are used for navigation.
B+ trees are commonly used in databases because of their ability to efficiently search and retrieve data.
Example: In a database table with an index on a specific column, B+ tree...
Round duration - 45 mintues
Round difficulty - Easy
Timing - 11AM-12:15PM
Environment - online video call
Again there was a panel of 2 senior engineers
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
For the giv...
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes while keeping track of the sum of each path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) or breadth-first search (BFS) for tree traversal.
Handle cases where nodes have negative values or where
Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction
Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
posted on 30 Oct 2023
I applied via Approached by Company and was interviewed before Oct 2022. There were 3 interview rounds.
Basics of core js and css questions
Implementing infinite scroll on a webpage
Use JavaScript to detect when user reaches the bottom of the page
Fetch more content using AJAX calls
Append new content to the existing page dynamically
posted on 18 Oct 2024
I appeared for an interview in Sep 2024.
I was given a test which was not that difficult
Seeking new challenges and growth opportunities in a more innovative environment.
Looking for new challenges and opportunities for growth
Interested in working in a more innovative environment
Seeking a change in company culture or work-life balance
The innovative projects and collaborative work environment at Altair are the driving factors for me to join.
Innovative projects: I am excited about the opportunity to work on cutting-edge projects that push the boundaries of technology.
Collaborative work environment: I value teamwork and believe that working with talented individuals at Altair will help me grow professionally.
Company culture: I have heard great things ...
I applied via Naukri.com and was interviewed in Jun 2022. There were 4 interview rounds.
Total 35 questions, with 5 sections and time duration 35 minutes.
The question is too broad to provide a specific answer.
APIs can have various methods such as GET, POST, PUT, DELETE, etc.
The methods in an API depend on the specific API being referred to.
Examples of API methods include 'getUser', 'createOrder', 'updateProfile', etc.
I have faced issues with compatibility, performance, and user acceptance testing.
Compatibility issues with different browsers and operating systems
Performance issues with large datasets and high traffic
User acceptance testing revealed unexpected user behavior
posted on 10 Nov 2022
posted on 18 Aug 2023
I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.
To connect to the backend, you can use APIs, database connections, or web services.
Use APIs to send and receive data between the frontend and backend
Establish database connections to retrieve and store data
Utilize web services for communication between different systems
based on 2 reviews
Rating in categories
Product Developer
91
salaries
| ₹8.5 L/yr - ₹23.8 L/yr |
Technical Application Specialist
81
salaries
| ₹5.6 L/yr - ₹12 L/yr |
Senior Associate
71
salaries
| ₹8.1 L/yr - ₹25.5 L/yr |
Senior Product Developer
63
salaries
| ₹14.7 L/yr - ₹36.8 L/yr |
Senior Software Engineer
50
salaries
| ₹12.1 L/yr - ₹30 L/yr |
Apisero
Actalent Services
Cyber Infrastructure
TestingXperts