Celigo

Role: Software Development Engineer (SDE)

College: Not Specified (On-Campus)

Interview Date: August-September 2021

Interview Type: On-Campus, Internship with Full-Time Employment

Result: Selected

Difficulty: Medium to Hard

Rounds: 4 rounds

Topics Asked: Data Structures, Algorithms, Binary Trees, Debugging, Analytics, Pointers, MACROS, Precedence and Associativity, Project Discussion, Inversion Count in an array, Job Scheduling Problem, Finding a pair of points with minimum distance, Searching an element in a rotated sorted array (binary search), Printing all valid parenthesis strings, Counting pair of numbers whose sum is equal to a given target, Three sums equal to target, HR questions.

Experience:

Celigo visited the campus in mid-August 2021 for an SDE profile, offering a 6-month internship followed by full-time employment. There were about 140 candidates, and 4 rounds were conducted.

Round 1: Online Coding Test
This round was conducted on the Hackerrank platform and lasted 120 minutes. It consisted of 22 MCQs and 3 coding questions. The MCQs covered binary tree traversal, debugging, analytics, basics of precedence and associativity, MACROS, pointers, and data structures. The coding questions were based on "Inversion count in an array", "Job scheduling problem", and "Finding a pair of points with minimum distance". Around 20 students were shortlisted.

Round 2: Technical Interview
This round started with a basic introduction and a discussion about projects done during a summer internship. After 15 minutes of project discussion, the interviewer moved to DSA. Two questions were asked: a) searching an element in a rotated sorted array (using binary search), and b) given a value of n, print all valid parenthesis strings of brackets. The interviewer liked the approach but found the code confusing. This round lasted about 90-95 minutes. 10 students were selected for the next round.

Round 3: Technical Interview
The interviewer was polite and supportive. After an introduction, three questions were asked: "Count pair of numbers whose sum is equal to a given target" (including all corner and edge cases), and an improved version of the same question for "three sums equal to target" (handling negative, positive, similar, dissimilar elements).

Round 4: HR Round
This round was about 10 minutes long and covered typical HR questions. Finally, 3 students were offered the role.