Biofourmis Associate Software Engineer Interview Questions and Answers

Palindrome and Pattern drawing question

Q1. Data Structure and Projects
Add your answer

Q1. Expectation of Salary
Add your answer

Q1. Senior taking technical round
Add your answer

Q1. Manger Taking technical round
Add your answer

Q1. Salary Discussion
Add your answer

1 hour duration. Sliding window problem. On hacker rank platform. Expected to write a working code and solve it optimally/scalable solution.

Q1. Again a coding test. LLD + hash map. 1 hour on hacker rank.
Add your answer

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

Q1. Techical questions and coding questions related profile.
Add your answer
Q2. Basic concepts about your programming skills.
Add your answer

Solving normal Puzzles to test aptitude.

Sample app was asked to create.

Q1. Delete nth node from end in linked list
Ans. 
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
• Use two pointers, one to traverse the list and another to keep track of the nth node from the end.

• Move the second pointer n steps ahead of the first pointer.

• When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.

• Adjust the pointers to delete the nth node.
Answered by AI
Add your answer
Q2. Project discussion
Add your answer

Q1. React, React Native Basics
Add your answer
Q2. Coding Arrays & Objects
Add your answer