2 YOE, Bangalore\n\nPhone Screening:\nBasic OS, networks, OSI layer questions. ended with a coding question: \nFind the max product subsequence in an array (0,+,-)\n\nOn-site (Zoom)\n1. Coding: Given an n-ary tree, reconstruct the tree such that each node (except one node at max, 0->k-1) has k children. Note: If any node is the ancestor of another, it can\'t go below the other node.\n- made a mess of this. spent my time thinking of a dp soln but then realised too late that greedy works, couldnt code it although explained the soln.\n2. Coding: a) Give k min product pairs in two arrays, b) simple DSU/bfs \n- went well, gave optimal, working code\n3. Concurrency: Simple round, needed to implement a CRON-queue like service\n- went well, finished early too and spoke about the JD\n4. Hiring Mgr: half assed design qn (sourcegraph clone in 10 mins) and rest was resume based\n5. Explain a project of yours to a new person\n\nHR ghosted me for a month, gave a reject finally. The ghosting part ruined it. \nWasn\'t expecting a reject, but 1 coding round wasnt great so :/

2 YOE, Bangalore\n\nPhone Screening:\nBasic OS, networks, OSI layer questions. ended with a coding question: \nFind the max product subsequence in an array (0,+