L3 Interview Loop\nYoE : 2\n\n**Round 1**\n\nYou are given a chat `log.txt` file in the following format\n\nJohn > Hello World!\nDoe > Here comes one another noob coder.\nJohn > Watchout! Just because I am unable to spot a bug in the next question, you call me a noob?\nDoe > Well, if you are unable to solve any question, you don\'t deserve google.\nJohn > We\'ll see about that.\n\nReturn the top k talkative people in the chat. More talkative means more number of words. Also, you are given a helper function which accepts the log file path and returns you an array of pairs (one pair for each line) like <name, number of words spoken in the line>.\n\n**Round 2**\n\nYou are given an array of elements. Return true if you can remove an element from the array and resultant array can be partitioned into two halves having equal sum. Else return false.\n\nEx - 1 > 2 > 1 > 3\nReturns true because after removing 1 (i = 2), 1 + 2 = 3.\n\nEx - 3 > 2 > 1 > 1\nReturns true because after removing 1 (i = 2), 3 = 2 + 1\n\nEx - 1 > 20 > 30 > 4\nReturns false since no element\'s removal can distribute the array into two equal halves.\n\n\n*P.S : I will keep updating this post with further round questions.*

L3 Interview Loop\nYoE : 2\n\nRound 1\n\nYou are given a chat log.txt file in the following format\n\nJohn > Hello World!\nDoe > Here comes one another noob cod