IEO Makers Fablab Interview Questions, Process, and Tips

Round duration - 25 Minutes
Round difficulty - Medium

The round was very good i performed really very well. The interviewer was quite polite. He asked me many questions and i almost gave all the answers.

Round duration - 50 Minutes
Round difficulty - Easy

Tech + HR round

Q1. 
Check Indices With Given Difference Problem Statement
You are provided with an integer array ARR of size N along with two integers A and B. Your task is to determine if there exist two distinct indices in...read more
Ans. 
The task is to determine if there exist two distinct indices in the array such that the absolute difference of the values at those indices is less than or equal to B and the absolute difference of the indices is less than or equal to A.
• Iterate through the array and keep track of the indices and values encountered so far

• Use a hashmap to store the values and their indices

• Check if the absolute difference of values is less...read more
Answered by AI
View 1 more answer

Round duration - 40 minutes
Round difficulty - Medium

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
• Use Floyd's Tortoise and Hare algorithm to detect a cycle in O(N) time complexity and O(1) space complexity.

• Initialize two pointers, slow and fast, and move them at different speeds through the list.

• If there is a cycle, the fast pointer will eventually meet the slow pointer.

• If the fast pointer reaches the en...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Tech +HR round

Q1. 
BST Construction from Level Order Traversal
Given an array called levelOrder consisting of 'N' elements, this array represents the level order traversal of a Binary Search Tree (BST). Your task is to cons...read more
Ans. 
Construct a Binary Search Tree (BST) from its level order traversal and print the inorder traversal.
• Create a BST from the given level order traversal array by inserting elements in the correct order.

• Use a queue to keep track of nodes while constructing the BST.

• Traverse the constructed BST in inorder to get the desired output.

• Example: For level order traversal [5, 3, 6, 2, 4, 7], the inorder traversal of the constructed
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

The interview and the interviewer were pretty good. The time was about 4pm. The environment was very good and the interviewer was very calm and humble. He asked me a question in which I was stucked but he gave me a small hint and then i gave the answer of that question.

Q1. 
Last Index of Element
The task is to determine the index of the last occurrence of a specified element x within an array that may contain duplicate elements. If the element is not present, return -1.
Inp...read more
Ans. 
Find the index of the last occurrence of a specified element in an array.
• Iterate through the array from right to left to find the last occurrence of the element.

• Return the index if found, otherwise return -1.

• Consider 0-based indexing for the array.
Answered by AI
Add your answer