Filter interviews by
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
Top trending discussions
I applied via Approached by Company and was interviewed before Feb 2023. There were 3 interview rounds.
Basic questions on python and palindrome
Medium level complexity problems in python
Share the link for codesignal
The question is asking for the current time and the angles formed by the hour and minute hands on a clock.
The angle between the hour and minute hands of a clock can be calculated using the formula: angle = |(30*hour - (11/2)*minutes)|
At 3:00, the angle between the hour and minute hands is 90 degrees.
At 6:00, the angle between the hour and minute hands is 180 degrees.
At 9:00, the angle between the hour and minute hands
I applied via Referral and was interviewed before Nov 2023. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
There was a coding round and out of 75 students 28 got selected for next round
I applied via Campus Placement 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...
I applied via Campus Placement and was interviewed in Aug 2022. There was 1 interview round.
Data structures are used to organize and store data efficiently. Time complexity is the measure of efficiency.
Arrays - O(1) for access, O(n) for search and insertion
Linked Lists - O(n) for access, O(1) for insertion and deletion
Stacks - O(1) for access, insertion and deletion
Queues - O(1) for access, insertion and deletion
Trees - O(log n) for access, insertion and deletion
Hash Tables - O(1) for access, insertion and de
Binary trees are classified based on the number of children each node can have.
Full binary tree: every node has either 0 or 2 children
Complete binary tree: all levels except possibly the last are completely filled, and all nodes are as far left as possible
Perfect binary tree: all internal nodes have two children and all leaf nodes are at the same level
Balanced binary tree: the difference in height between the left and ...
based on 1 interview
Interview experience
Software Engineer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Measurement Technician
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer II
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer Level 1
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Maxar Technologies
Cyient
Genesys
Trimble