![Anonymous User](data:image/svg+xml,<svg xmlns="http://www.w3.org/2000/svg" width="200" height="200"><rect fill-opacity="0"/></svg>)
Last Edit: May 11, 2022 10:59 AM
3.3K VIEWS
Cant reveal exact questions due to NDA with the company.
Round 1 (Concurrency)
(LC-Medium) Concurrency problem that could be solved using the concept of condition variable.
Round 2 (Concurrency)
(LC-Medium) Concurrency problem that could be solved using the concept of condition variable.
Round 3 (DSA)
Graph based question (LC-HARD) level, which could be solved using concepts of topological sort and union find algorithm
Round 4 (System design)
System design, which could be solved using concepts of concurrency.
Round 5 (Hiring manager)
Standard HM round
Round 6 (Concurrency + DSA)
Graph question (LC-hard) level, which can be solved using concepts concurrency and BFS
Competing offers:
https://leetcode.com/discuss/compensation/1994328/Coinbase-or-IC4-or-Bangalore
https://leetcode.com/discuss/compensation/1994341/VMWare-or-MTS3-or-Bangalore
Other interview experiences:
https://leetcode.com/discuss/interview-experience/1994403/Coinbase-or-IC-4-or-Bangalore-or-March-2022-or-Offer
https://leetcode.com/discuss/interview-experience/1996617/AWS-or-SDE-2-or-Bangalore-or-March-2022-or-Offer
https://leetcode.com/discuss/interview-experience/1996706/VMWare-or-MTS-3-or-Bangalore-or-March-2022-or-Offer
https://leetcode.com/discuss/interview-experience/1996675/Uber-or-SDE-2-or-Bangalore-or-March-2022-or-Reject
https://leetcode.com/discuss/interview-experience/2001716/Google-or-L4-Reject-L3-Offer-or-Bangalore-or-March-2022
https://leetcode.com/discuss/interview-experience/2001740/Microsoft-or-SDE2-or-Hyderabad-or-March-2022-or-Reject
https://leetcode.com/discuss/interview-experience/2001782/Robin.io-or-SDE2-or-Bangalore-or-March-2022-or-Offer
https://leetcode.com/discuss/interview-experience/2001992/Nutanix-or-SDE-2-or-Bangalore-or-March-2022
https://leetcode.com/discuss/interview-experience/2002004/Enterpret-or-SDE-2-or-Bangalore-or-March-2022-or-Reject
Login to Comment
May 1, 2022 8:01 AM
Wow, thats a lot of concurrency related questions!!
May 6, 2022 5:47 PM
can you please share resources to learn from for questions like round 1 and 2. It would help me a lot.
May 1, 2022 8:26 AM
Problem asked in Round 3 DSA was asked to me in Infosys Power Programmer interview, CTC of the same is 9.5 LPA. uffs
Last Edit: April 30, 2022 4:56 PM
for 3rd one,
we can do Disjoint set on peer relations first
then for mangert reportee relation, suppose a->b (a is manger of b then) then store it as manager[leader of b component] = a
Note: Leader of a component is what we will choose as representative for component in a disjoint set.
so while doing the queries like does c report to A?
Go level by level manager of leader of component c which is lets say 'x'
since x not equal to A, you go to manager of leader of component of x and so on until you reach highest point in hierarchy (where there is no manager)
This should work.
May 4, 2022 4:47 PM
This is really amazing. Is there some book or course or resources that you have referred for concurrency related topics? Can you please help me with this?
May 1, 2022 3:26 PM
Congratulations on the offers! Can you please share details on your interview prep?
April 28, 2022 5:11 PM
how did you implement 2nd round question with concurrent access.. any hint?
April 25, 2022 4:41 PM
How many years of experience do you have ?
April 19, 2022 6:34 AM
can you share the solutions you have presented ,i find it hard to solve concurrency based problems
Last Edit: April 19, 2022 4:48 AM
In 3rd round, doesn't ufds suffice and why do we need topological sorting ? All the peers belong to same group and manager of a group can identified by single value ? Do the queries need to be answered in O(1) time or is O(log N) fine ? Ultimately it's a n-ary tree with grouped nodes.
In last round, how does the graph look like ? Is this a normal bfs using queue and we use locks on either src / dest node in some map ? Do you track visit for each node (we have so many nodes) ?