Biofourmis Senior Software Engineer Interview Questions and Answers

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

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

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

Question on dsa and string theory along with oops concepts

Q1. Question on java strings and arrays
Add your answer

Q1. DSA - level order traversal, sliding window.
Add your answer

Q1. Atomic transaction in distributed system
Ans. 
Atomic transactions ensure that all operations in a transaction are completed successfully or none at all in a distributed system.
• Atomic transactions guarantee that all operations within a transaction are either all successful or all rolled back.

• In distributed systems, atomic transactions are crucial for maintaining data consistency across multiple nodes.

• ACID properties (Atomicity, Consistency, Isolation, Durability) a...read more
Answered by AI
Add your answer

It was a 1 hour Technical screening round, coding question in java (you cna choose your own language). They asked a difficult version of regex matching question (Leetcode medium-hard).