Filter interviews by
I applied via Indeed and was interviewed in May 2022. There were 4 interview rounds.
Basic questions on Logical reasoning
My day has been busy but productive so far.
Started the day with a team meeting to discuss project updates
Completed a few tasks ahead of schedule
Currently working on a challenging project that requires problem-solving skills
I possess the necessary skills, experience, and passion to excel in this role.
I have relevant experience in the field through internships and projects.
I am a quick learner and have a strong work ethic.
I am passionate about the industry and eager to contribute to the team.
I have excellent communication and teamwork skills.
I am adaptable and can handle challenges effectively.
posted on 14 Mar 2024
I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.
5 question with more of a logical reasoning
Find the maximum of all windows of size k in array
posted on 10 Nov 2021
I applied via Naukri.com and was interviewed in May 2021. There were 4 interview rounds.
posted on 17 Oct 2023
I applied via Approached by Company and was interviewed before Oct 2022. There were 5 interview rounds.
Machine test of OOPS related and logical questions
I applied via Approached by Company and was interviewed before Oct 2021. There were 2 interview rounds.
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 ...
I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.
Just focus and data structures and algorithms
Project Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager SCM
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Field Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Trimble
Arya Omnitalk
Quikmile
Volty IoT Solutions