Business Labs Junior Developer Interview Questions and Answers

Coding and aptitude and logical reasoning three sections were there.In Coding you have 4 language to choose from and you must select 2 languages and in each language you have to solve 2 questions. It was relatively easy .

Q1. They ask you to do programming for questions. If you are a thief and you have an array of houses you cannot rob the beside houses of the house you ribbed. Maximise the loot.
Add your answer
Q2. Insert node at middle in linked list
Ans. 
To insert a node at the middle of a linked list, find the middle node and adjust pointers accordingly.
• Find the middle node using slow and fast pointers

• Insert the new node after the middle node

• Adjust pointers to link the new node correctly
Answered by AI
Add your answer
Q3. Find number of Perfect subarrays of the given array .A perfects subarray has odd value at odd place and even value at even position.
Ans. 
Count the number of perfect subarrays in an array where odd values are at odd positions and even values are at even positions.
• Iterate through the array and keep track of the count of odd and even numbers encountered so far.

• If the count of odd and even numbers at the current index matches the index itself, increment the count of perfect subarrays.

• Example: For array [2, 1, 3, 4], there are 3 perfect subarrays: [2, 1], [1
Answered by AI
Add your answer

Q1. They give you direct leetcode sums and ask to solve
Add your answer
Q2. Find if a number is there in a sorted array or not and if its not there where shoud it be inserted in log(n) time
Ans. 
Binary search can be used to find the number in a sorted array in log(n) time.
• Implement binary search algorithm to find the number in the sorted array.

• If the number is not found, return the index where it should be inserted.

• Time complexity of binary search is O(log n).
Answered by AI
View 1 more answer
Q3. You are given parallel bars selecting two bars you can make a container .Maximise area.Find the slution in o(n)
Ans. 
To maximize the area of a container formed by two parallel bars, use the two-pointer approach in O(n) time complexity.
• Use the two-pointer approach to iterate from both ends towards the center of the array.

• Calculate the area formed by the two bars at each step and update the maximum area found so far.

• Move the pointer with the smaller height towards the center to potentially find a larger area.

• Repeat the process until th
Answered by AI
View 1 more answer