Celigo Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 26 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Celigo.
Celigo
Software Engineer
Senior Average Negative experience No offer 1 round
Interview process
Technical screen
Interview formats
Technical Coding Behavioral
Medium difficulty interview with 2 DSA questions on graph and linked list. The graph question was about word search, and the linked list question was about doubly ended linked lists. Then, we discussed my most recent project.
Confirmed questions6 questions
- Can you find a given word in a 2D matrix?
- What are some DSA questions related to graphs?
- What are some DSA questions related to linked lists?
Celigo
Software Engineer Intern
Intern Average Neutral experience No offer 2 rounds
Interview process
Take home Technical screen Technical screen
Interview formats
Technical Coding Behavioral
The online assessment had tough questions about matrix operations and dynamic programming (DP), needing good knowledge of algorithms and problem-solving. The problems checked both technical skills and how well I could implement solutions. In the interviews, the first round was about explaining my OA solutions and talking about my past projects. The second round was more about advanced DP and graph questions, asking me to show I understood concepts like graph traversal and optimization strategies.
Confirmed questions1 question
- Tell me about the matrix operations and dynamic programming (DP) questions from the OA.
Celigo
Software Engineer
Entry Difficult Positive experience No offer 2 rounds
Interview process
Take home Technical screen Technical screen Background check
Interview formats
Technical Coding
So after the online assessment, they shortlisted 41 students out of 300-400 for the next rounds based on completion time. The first round was a technical interview, scheduled just a day after the online assessment. It had four parts. First, a quick intro, then three LeetCode Medium DSA questions. The first one was about the previous OA question, where I had to explain my approach and code it. The interviewer wanted me to test it with different cases. Then, two more DSA questions followed, and I had to explain the code, its time complexity, and edge cases. After that, 12 students made it to Round 2, another technical interview. It also started with a basic intro, then straight into a DSA question. I had to trace the code manually and suggest different ways to solve it. I found this one a bit tough, but the interviewer was cool about it. It went for about 70-80 mins, and they were super friendly. It seemed like I did okay, but an hour later, I found out I didn't get shortlisted for the next rounds. Maybe they weren't totally happy with my solution approach, and I did take a bit longer on one question. Still, it was a good learning experience. My friends told me that Round 3 was about projects, development plans, and behavioral stuff, and the last HR round was for company fit. Everything was online.
Confirmed questions4 questions
- Find pairs of numbers that are complementary palindromes.
- Given a list of coin denominations and a target amount, find the minimum number of coins required to make that amount.
- Identify prime numbers within a large dataset of odd numbers over a given range.
Celigo Software Engineer Interview Questions
Quoted word for word from Celigo interview reports.
“Given a singly linked list where each node contains a number, treat the list as representing a single number and then increment that number by one.”
Read reports →“Given a list of coin denominations and a target amount, find the minimum number of coins required to make that amount.”
Read reports →“Find the count of triplets such that ar[i] - k is present in the given array.”
Read reports →“What is the k-th largest element in a Binary Search Tree?”
Read reports →“Can you find a given word in a 2D matrix?”
Read report →“Can you find the second largest element in a binary search tree?”
Read report →“Solve the 2 Sum problem, optimizing for O(n) time and O(1) space.”
Read report →“What are four different ways to find the second largest element in a binary search tree?”
Read report →“Can you solve the 8-queens problem, but use knights instead of queens?”
Read report →Formats, difficulty and experience
Across all 26 Celigo interview reports.