Bloomberg Software Engineer Onsite Coding Questions

I recently went through the interview process for Bloomberg’s SWE internship position. I passed 5 rounds, including the final EM round. I believed I did quite well, and this was actually reflected in

**Round 1 (60 minutes)** **Problem:** Gas Station / Oasis / Car Path Problem. Find a path between two points. **Reference:** https://leetcode.com/discuss/post/1608777/bloomberg-phone-screen-find-path-

**Round 1** **Problem:** Implement a simplified `grep` tool to find lines in a file containing a specific substring, prioritizing flag extensibility. **Solution:** Clarify requirements and implement p

Just did my first onsite today and got rejected. This is the question: https://leetcode.com/problems/remove-letter-to-equalize-frequency/description/ its not hard, but very very tricky with so many edge cases. i have never done this...

Assume you have a car park (parking lot), with n spaces arranged linearly (let\'s say 10 spaces initially): The spaces are all the same size and will fit all vehicles...

Just got around to writing about my experience at the virtual onsite interview. I was given the same question as listed here, but was asked to come up with an...

I took my virtual onsite interview round for internship in Bloomberg London.There were 2 engineers in the meeting. Question was basically valid parantheses question in leetcode which followed by some follow-ups...

Imagine\xA0we\xA0have\xA0a\xA0network\xA0of\xA0nodes\xA0where\xA0new\xA0information\xA0can\xA0be\xA0passed\xA0from\xA0one\xA0node\xA0to\xA0another\xA0node\xA0anaglous\xA0to\xA0how\xA0new\xA0gossip\xA0spreads\xA0from\xA0one\xA0person\xA0to\xA0the\xA0next.\xA0In\xA0order\xA0for\xA0information\xA0to\xA0spread\xA0across\xA0the\xA0network,\xA0each\xA0node\xA0finds\xA0a\xA0node\xA0to\xA0pass\xA0down\xA0the\xA0latest\xA0info\xA0or\xA0gossip\xA0it\xA0knows\xA0and\xA0this\xA0process\xA0repeats\xA0til\xA0the\xA0information\xA0is\xA0consistent\xA0across\xA0all\xA0nodes.\xA0This\xA0gossiping\xA0communication\xA0is\xA0one\xA0way\xA0a\xA0distributed\xA0system\xA0can\xA0reach\xA0consensus\xA0on\xA0information\xA0the\xA0network\xA0holds\xA0without\xA0seeing\xA0all\xA0the\xA0data\xA0available\xA0from\xA0all\xA0the\xA0nodes. Let\'s\xA0say\xA0we\xA0have\xA0a\xA0list\xA0of\xA0nodes\xA0each\xA0holding\xA0a\xA0unique\xA0positive\xA0integer\xA0and\xA0we\'d\xA0like\xA0to\xA0use\xA0this\xA0method\xA0to\xA0reach\xA0a\xA0consensus\xA0on\xA0what\xA0the\xA0largest\xA0integer\xA0is.\xA0A\xA0node\xA0can\xA0look\xA0like\xA0the\xA0following, struct\xA0Node { \xA0\xA0int\xA0my_value; \xA0\xA0int\xA0largest_value_i_know; \xA0\xA0 \xA0\xA0Node(int\xA0value) \xA0\xA0{ \xA0\xA0\xA0\xA0my_value\xA0=\xA0value; \xA0\xA0\xA0\xA0largest_value_i_know\xA0=\xA0value;\xA0//self,\xA0that\'s\xA0the\xA0only\xA0thing\xA0\xA0it\xA0knows\xA0 \xA0\xA0}; }; We\xA0will\xA0use\xA0a\xA0vector\xA0of\xA0nodes\xA0to\xA0represent\xA0the\xA0network\xA0and\xA0the\xA0goal\xA0is\xA0to\xA0implement\xA0a\xA0function\xA0like\xA0this: void\xA0find_largest_value(vector<Node>&\xA0nodes)\xA0//prints\xA0out\xA0the\xA0consensus\xA0and\xA0number\xA0of\xA0rounds. Assumptions/ Hints by interviewer: You\'re\xA0given\xA0random\xA0neighbor\xA0assignments,\xA03\xA0neighbors\xA0per\xA0node. You\'re\xA0given\xA0the\xA0assumption\xA0that\xA0this\xA0graph\xA0is\xA0fully\xA0connected. No\xA0messages\xA0are\xA0lost. Note: 1.How will you represent a single node? //Define class and data structure and write methods. 2.How will you write data to ther nodes\'s buffer for propogation. //One...

Role: Senior Front end Engineer You\'re provided code that determines the \'next state\' of the popular game of life question Your task is to build up the Front-end of the game in...

Problem: 1D Candy Crush: You are given a string. You have to eliminate all occurrences of 3 or more adjacent identical characters in a string. For Example: if you are...

I got this question during Bloomberg on-site interview this week. Even after solving 170 LeetCode problems, I\'ve never seen a question like this. I wasn\'t able to solve it and...

Given a list of meetings for a given day in a conference center, return a list of time slots during which the most number of concurrent meetings are held. Each meeting has...

Recently, in an interview I reached till the onsite rounds. Did really well till the last round. In the very last round, I solved two BFS based questions and the...

Interview 1: Question 1: Similar to Underground system on leetcode // o 86th Street Station // | // | // o 59th Street Station // | // | // o-----------o Grand Central // Times Square | // | // o 14th...

Implement the following two functions such that they are optimal. void addStocksVolume(string stockSymbol, int volume) vector<string> topKstocks(int k) addStocksVolume receives a symbol (INTC, APPL, etc) plus a volume which you cumulate over time. topKstocks...

LeetCode #380: Insert Delete GetRandom O(1). Difficulty: Medium. Topics: Array, Hash Table, Math, Design, Randomized. Asked at Bloomberg in the last 6 months.

LeetCode #56: Merge Intervals. Difficulty: Medium. Topics: Array, Sorting. Asked at Bloomberg in the last 6 months.

LeetCode #1: Two Sum. Difficulty: Easy. Topics: Array, Hash Table. Asked at Bloomberg in the last 6 months.

LeetCode #430: Flatten a Multilevel Doubly Linked List. Difficulty: Medium. Topics: Linked List, Depth-First Search, Doubly-Linked List. Asked at Bloomberg in the last 6 months.

LeetCode #79: Word Search. Difficulty: Medium. Topics: Array, String, Backtracking, Depth-First Search, Matrix. Asked at Bloomberg in the last 6 months.