Filter interviews by
I applied via Company Website and was interviewed in Apr 2023. There were 2 interview rounds.
I applied via Referral and was interviewed before Nov 2022. There were 2 interview rounds.
I was interviewed before May 2023.
I applied via Referral and was interviewed in Nov 2024. There were 3 interview rounds.
Join queries in SQL are used to combine rows from two or more tables based on a related column between them.
Use JOIN keyword to combine rows from two or more tables based on a related column
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN
Specify the columns to join on using ON clause
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
posted on 10 Jul 2024
Easy aptitude with pattern printing question.
I applied via Job Portal and was interviewed in Aug 2023. There were 2 interview rounds.
Behavior test, personality check.
SQL JOINS, EXCEL formulas LIKE VLOOKUP, XLOOKUP ect
More of a MCQ test with technical questions
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
Relationship Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Service Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
R&D Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
PHP Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Trimble
Orbcomm
Spireon
Verizon Connect