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 &\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...

LeetCode Question · Jan 2021 · Los Angeles

Bloomberg | Onsite | Consensus on the largest integer in the network

SWE Onsite

3 upvotes 3,295 views 10 replies

Question Details

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\xA0n…

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays System Design

More from Bloomberg

Reddit What would you grind for Bloomberg? Reddit Bloomberg Tokyo Software Engineer Rejection after Five Rounds Reddit Bloomberg, senior C++ role – what to expect? 1p3a Bloomberg Fulltime SDE Interview Experience and Coding Challenges 1p3a Bloomberg SSE Bquant SF Interview Experience and Reject

← All Bloomberg questions Bloomberg Software Engineer Questions → All Coding Questions →