Filter interviews by
I applied via campus placement at Kumaraguru College of Technology, Coimbatore and was interviewed in Feb 2021. There were 4 interview rounds.
To find the middle of a linked list in one iteration, use two pointers with different speeds.
Initialize two pointers, one slow and one fast, both pointing to the head of the linked list.
Move the slow pointer one step at a time and the fast pointer two steps at a time.
When the fast pointer reaches the end of the linked list, the slow pointer will be at the middle node.
A binary tree is a data structure consisting of nodes, where each node has at most two children.
Binary tree is used to represent hierarchical relationships between nodes
Traversal of binary tree can be done in three ways: inorder, preorder, postorder
Binary search tree is a type of binary tree where left child is smaller and right child is greater than parent
Balanced binary tree has height difference of at most 1 between...
It was like 5 MCQ and two coding questions with difficult level of moderate
React components go through various stages in their life cycle, from initialization to destruction.
Initialization: Component is created and initialized with default props and state.
Mounting: Component is rendered on the DOM for the first time.
Updating: Component re-renders when props or state change.
Unmounting: Component is removed from the DOM.
Examples: componentDidMount() for mounting, componentDidUpdate() for updati
Top trending discussions
Design and code a REST API for a software developer interview.
Define the endpoints and HTTP methods for the API (e.g. GET /users, POST /users)
Implement authentication and authorization mechanisms (e.g. JWT tokens)
Use proper status codes for responses (e.g. 200 OK, 401 Unauthorized)
Include error handling and validation for input data
Document the API using tools like Swagger or OpenAPI
Calculate word frequency using Stream API and lambda expressions
Use Stream API to convert array of strings to stream
Use Collectors.groupingBy to group words by their frequency
Use Collectors.counting to count the occurrences of each word
posted on 17 Jul 2024
Hackerrank coding round.
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
The question is about implementing a children sum property in trees and finding the height of a binary tree.
Children sum property in trees means that the value of a node must be equal to the sum of the values of its children nodes.
To find the height of a binary tree, you can recursively calculate the height of the left and right subtrees and return the maximum height plus one.
Example: For a binary tree with nodes 1, 2,
posted on 8 Apr 2024
posted on 20 Oct 2023
Basic apt questions with time limit
Medium and easy leetcode problems
I applied via Naukri.com and was interviewed before Dec 2022. There were 4 interview rounds.
based on 10 reviews
Rating in categories
Senior Software Engineer
125
salaries
| ₹9 L/yr - ₹22.5 L/yr |
Software Engineer
93
salaries
| ₹5 L/yr - ₹17.5 L/yr |
Software Developer
68
salaries
| ₹6.5 L/yr - ₹13 L/yr |
Senior GIS Analyst
57
salaries
| ₹4.3 L/yr - ₹6.4 L/yr |
Lead Software Engineer
53
salaries
| ₹15.4 L/yr - ₹32.5 L/yr |
Bentley Systems
Autodesk
ESRI India Technologies
Hexagon AB