FarEye Associate Solutions Engineer Interview Questions and Answers

Q1. Basics questions of react native
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Q1. 
Find a Node in Linked List
Given a singly linked list of integers, your task is to implement a function that returns the index/position of an integer value 'N' if it exists in the linked list. Return -1 i...read more
Ans. 
Implement a function to find the index of a given integer in a singly linked list.
• Traverse the linked list while keeping track of the index of each element.

• Compare each element with the target integer 'N'.

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

• Handle cases where the list is empty or 'N' is not found.

• Consider the constraints on the number of test cases and the length of the linked list.
Answered by AI
Add your answer
Q2. 
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named Stack which supports the following operations, each in O(1...read more
Ans. 
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
• Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.

• Use a Singly Linked List to store the elements of the stack.

• Ensure each operation runs in constant time complexity (O(1)).

• Handle edge cases like empty stack appropriately.

• Example: For input '5', '3 10', '5', '1', '2', '4', the output should be '10', '1'
Answered by AI
Add your answer
Q3. 
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 has a cycle using O(N) time complexity and O(1) space complexity.
• Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list

• Maintain two pointers, slow and fast, moving at different speeds

• If there is a cycle, the two pointers will eventually meet

• If one of the pointers reaches the end of the list (null), there is no cycle
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Q1. 
Top View of Binary Tree
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...read more
Ans. 
Return the top view of a binary tree given in level-order format.
• Traverse the binary tree in level-order and keep track of the horizontal distance of each node from the root.

• Use a map to store the nodes at each horizontal distance, and only keep the first node encountered at each distance.

• Return the values of the nodes stored in the map in sorted order of their horizontal distance.

• Example: For the given binary tree, th
Answered by AI
Add your answer
Q2. 
Problem Statement: Delete Node In A Linked List
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...read more
Ans. 
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
• Traverse the linked list to find the node to be deleted

• Update the pointers to skip over the node to be deleted

• Print the modified linked list after deletion
Answered by AI
Add your answer

Q1. Basics on Node.js
Add your answer

Q1. Node.js concepts
Add your answer
Q2. Schema design
Add your answer

Online technical aptitude test

Q1. Related oops and old company projects
Add your answer

Q1. Sort array of cards in color red , blue,green
Ans. 
Sort array of cards in red, blue, green colors.
• Use a custom sorting function to sort the array based on color order.

• Assign a numerical value to each color (e.g. red: 0, blue: 1, green: 2) and sort based on these values.

• Implement a sorting algorithm like bubble sort or quicksort to rearrange the array based on color order.
Answered by AI
Add your answer

Q1. Find Target Element in a rotating sorted Array.
Ans. 
Search for target element in a rotated sorted array.
• Use binary search to find the pivot point where rotation happens.

• Divide the array into two subarrays and perform binary search on the appropriate subarray.

• Handle cases where the target element is on the left or right side of the pivot.
Answered by AI
Add your answer

Basic array and string based questions.

Q1. Basics of OOPS and resume.
Add your answer
Q2. Reverse a string without using new variable
Ans. 
Reverse a string without using new variable
• Use two pointers, one at the beginning and one at the end of the string

• Swap the characters at the two pointers and move the pointers towards each other until they meet in the middle
Answered by AI
Add your answer