Fractal Analytics Data Engineer Interview Questions and Answers for Freshers

Duration: 1hr
Topics: Array, LinkedList,Stack

Q1. Write code for Insertion in a binary tree.
Ans. 
Code for insertion in a binary tree
• Create a new node with the given data

• If the tree is empty, make the new node as root

• Else, traverse the tree to find the appropriate position to insert the new node

• If the data is less than the current node, go to the left subtree

• If the data is greater than the current node, go to the right subtree

• Repeat until an appropriate position is found

• Set the new node as the child of the appropri
Answered by AI
Add your answer
Q2. Write code for quick sort
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
• Choose a pivot element from the array

• Partition the array around the pivot element

• Recursively apply quick sort to the left and right sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer

Q1. Various DBMS related question(JOINS, SORT, LIMIT)
Add your answer

Q1. Tell us about yourself.
Add your answer
Q2. Why do want to join the company
Add your answer

Q1. Behaviour round questions were asked
Add your answer

Q1. Asked Kadane's algorithm, and some android related questions.
Add your answer

Q1. Design a hashmap, and optimise it
Ans. 
Design and optimize a hashmap
• Choose a good hash function to minimize collisions

• Implement dynamic resizing to handle increasing load factor

• Consider using open addressing or separate chaining for collision resolution

• Use an efficient data structure for storing key-value pairs, such as an array or linked list
Answered by AI
Add your answer

Q1. Design a custom recyclerview with appropriate data structures
Ans. 
Custom recyclerview with appropriate data structures
• Create a custom adapter extending RecyclerView.Adapter

• Implement onCreateViewHolder() and onBindViewHolder() methods

• Use appropriate data structures like ArrayList or HashMap for efficient data handling

• Implement onClickListener for item clicks

• Use ViewHolder pattern for efficient view recycling
Answered by AI
Add your answer

Q1. What are your expectations related to work and salary
Ans. 
I expect fair compensation for my skills and experience, and a challenging work environment that allows for growth and learning.
• I am looking for a salary that is commensurate with my experience and skills.

• I am open to negotiation and willing to discuss salary and benefits.

• I am looking for a challenging work environment that allows me to learn and grow as a software engineer.

• I am interested in opportunities for professi...read more
Answered by AI
Add your answer

Q1. Famous Java Questions like why string is immuatable and basics of OOPs.
Add your answer
Q2. Easy to medium level DSA based on array and string.
Add your answer

Q1. Project Related Questions
Add your answer
Q2. Questions related to java 8 stream API
Add your answer

Q1. Question related to basic recursion
Add your answer
Q2. Top kafka interview questions
Add your answer

Q1. Minimum element in an array
Ans. 
Find the minimum element in an array of strings
• Iterate through the array and compare each element to find the minimum

• Use built-in functions like Math.min() or sort() to find the minimum

• Handle edge cases like empty array or array with only one element
Answered by AI
Add your answer
Q2. Reverse a linked list
Ans. 
Reverse a linked list by changing the next pointers of each node
• Iterate through the linked list and change the next pointers to reverse the list

• Use three pointers - prev, current, and next to keep track of nodes

• Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
Answered by AI
Add your answer