Round 1: Online Test:
- 21 MCQs (Aptitude + Technical), Difficulty – Easy to Medium, Topics – Algorithms, Data Structures, OOP, Databases, Operating Systems, Computer Networks, and General Aptitude.
- 3 Coding Questions, Difficulty – Medium to Hard, Topics – Dynamic Programming, Heaps and Graphs.
Round 2: Technical Interview-1: Brief discussion on my projects.
- A variation of the House Robber problem (Dynamic Programming).
- ‘Counting the number of provinces’ problem (Graphs).
- Finding LCA of any two nodes in Binary tree & BST.
- Few questions on Operating Systems concepts like Virtual Memory & Thrashing etc…
- Few Behavioral questions.
Round 3: Technical Interview-2: Questions asked were:
- Given an array as input, consider it as a level order traversal of a binary tree. Make all different possible binary trees have the same level order traversal represented by the array.
- Design Facebook (Low-level design only).
- Design an efficient algorithm for the friend’s suggestion system on Facebook/LinkedIn
- Few questions about my programming journey.
- Few Behavioral questions.
Round 4 : HR Interview: Brief introduction of me and a few questions on my background. Typical HR question like –
- Why Celigo?
- How can you assure about your contribution to the growth of the company after joining?
- Describe yourself in 3 words
Recommended Articles