BugsMirror Software Developer Intern Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Hard

This round was carried out on Amcat. It was very user friendly platform and easily understandable. Countdown Timer was located at the top right corner that helped me to keep a check on the remaining time and I planned my answers and code accordingly.

Q1. 
Ninja's Jump Task
The Ninja has been given a challenge by his master to reach the last stone. These stones are represented as an array of numbers. The Ninja can jump using either odd-numbered or even-numb...read more
Ans. 
Find the number of starting indices from which a Ninja can reach the last stone by following specific jump rules.
• Iterate through the array and keep track of the possible jumps for each index.

• Use dynamic programming to efficiently calculate the number of starting indices.

• Consider odd and even jumps separately to determine the valid jumps.

• Handle edge cases where there are no possible jumps from certain indices.

• Return the...read more
Answered by AI
Add your answer
Q2. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
The problem involves determining the number of distinct ways to climb from the 0th to the Nth stair by climbing one or two steps at a time.
• Use dynamic programming to solve this problem efficiently.

• Define a recursive function to calculate the number of ways to reach each stair based on the number of ways to reach the previous two stairs.

• Consider base cases for 0th and 1st stairs.

• Use modulo operation to handle large numb...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was carried out on skype and the questions asked were relatively difficult, I wasn't very much sure with my answers. Although, this platform is nice and it wasn't the first time, I was using skype but still the final results didn't went in my faour.

Q1. 
Find the Lone Set Bit
Your task is to identify the position of the only '1' bit in the binary representation of a given non-negative integer N. The representation contains exactly one '1' and the rest are...read more
Ans. 
Find the position of the lone '1' bit in the binary representation of a given non-negative integer.
• Iterate through the bits of the integer to find the position of the lone '1'.

• Use bitwise operations to check if there is exactly one '1' bit in the binary representation.

• Return the position of the lone '1' or -1 if there isn't exactly one '1'.
Answered by AI
Add your answer
Q2. What is the difference between deadlock and livelock?
Ans. 
Deadlock is a situation where two or more processes are unable to proceed because each is waiting for the other to release a resource, while livelock is a situation where two or more processes continuously change their states in response to changes in the other processes without making any progress.
• Deadlock involves a circular wait condition where processes are stuck waiting for resources held by each other.

• Livelock in...read more
Answered by AI
Add your answer