Bloomberg Software Engineer Intern Interview Questions and Answers

I got 2 leetcode-medium level programs one is on regex and other is on problem solving type "to find the lowest lag between different servers and destination"

Q1. More like how you will be at work, your behavior and mindset related
Add your answer

Q1. More like how you will approach work in office
Add your answer

It was related to electrical

Q1. Analog circuits related
Add your answer
Q2. Digital circuits related
Add your answer

Q1. In a sorted matrix of 0s and 1s, return the row with max 1s
Ans. 
Iterate through each row and count the number of 1s, return the row with the maximum count.
• Iterate through each row of the matrix

• Count the number of 1s in each row

• Track the row with the maximum count of 1s
Answered by AI
Add your answer

Coding Test Followed by 2 medium Level questions and one them is from Dp

Q1. Interview was Start with a sharing coding platform, interviewer asked 2 questions, first question is from easy level question and he wanted totally optimum approach, the 2nd one is a tree hard level questi...read more
Add your answer

60 questions - 20 aptitude, 20 CS fundamentals, 20 coding basics

Q1. Next Greater Element for Each Element in an Array
Ans. 
Find the next greater element for each element in an array.
• Use a stack to keep track of elements without a next greater element.

• Iterate through the array and compare elements with the top of the stack.

• Update the stack with the current element if it is greater than the top element.
Answered by AI
Add your answer
Q2. Binary Search in Sorted Rotated Array - No Duplicates
Ans. 
Binary search in a sorted rotated array with no duplicates.
• Find the pivot point where the array is rotated.

• Determine which half of the array to search based on the target value and pivot point.

• Perform binary search in the selected half of the array.
Answered by AI
Add your answer
Q3. Binary Search in Sorted Rotated Array - Duplicates Present
Ans. 
Binary search in a sorted rotated array with duplicates present.
• Perform a modified binary search by checking both ends of the array for duplicates

• Handle cases where duplicates are present at the start, end, or middle of the array

• Consider cases where the array is rotated multiple times
Answered by AI
Add your answer