WRITTEN TEST

• Coding Round
• Code Snippets

GROUP DISCUSSION: NO

SKILLS REQUIRED

• Data Structures and Algorithms
• OOPS
• System Design
• DBMS
• Computer Networks
• Proficiency in any one language

INTERVIEW GUIDELINES

Round 1: Technical Interview

• About operating systems, parallel computing, graph searching
• DS Algo based on Trees, and coordinate geometry
• Give you a tree, add a new node to the end of the last level. It the last level is - full, append this new node to a new level

Round 2: System design round

• Develop sparse file system.
• Develop a task runner.
• Design a service to generate global ID at web scale.
• Design a notification service

Round 3: Design round (Focused more on Low Level Details and Implementation)

• Multi threaded producer consumer problem
• Implement LRU Cache
• Implement a thread safe queue
• Implement an autocomplete engine where the input is a prefix string, then a number - representing the min number of words that could come after it. For example, wa3 could represent wafer, water, or Washington. Gelat2 could represent gelatin, but not gelato. Return all of these autocomplete results in a list. Minstack, Complete binary tree

MPLOYEE.ME TIPS

• Questions on Linked list, trees,Arrays and Strings,stacks,queues and oops
• Internship / Projects related technical questions