Round 1 - online test Write 3 code snippets in C++, few MCQs on DS, Networking, OS etc. to answer Round 2 - f2f 1> You are given a directed graph. Write code to find a node/vertex in it such that it can directly or indirectly reach all other nodes in the graph. 2> Explain any debug challenges you have faced in your current project, from crash dump in C++ to Java issues Round 3 - f2f 1> Explain the project - Do you know about FUSE filesystem 2> Design a directory walker using multi-threading 3> How can you find duplicates in a huge-stream of incoming objects
