Celigo Cloude Software Developer Interview Questions and Answers

Round: Test
Experience: 1)There are two unsorted lists containing integers. Provide a solution to find the largest common integer in both lists (findCommonLargest(List list1, List list2)). You can use additional data structures if needed but utility methods from java collections are not allowed. There are many solutions possible for this problem; please provide the most efficient solution you can come up with and provide its running time in Big O notation

2) In a university, students can enroll in different courses.

A student may enroll for more than one course.

Both students and courses can be identified by IDs given to them. Design a data structure to store students, courses, and the student-course relationships. You can use arrays, lists, stacks, trees, graphs, etc. or come up with your own data structures.

Give the running times, in Big O notation, for the following operations for your data structure and justify the answers:

a) Return all students in a list.

b) Return all courses in a list.

c) Return all courses in a list for a given student.

d) Return all students in a list for a given course.

Round: Technical Interview
Experience: 1) Write a code to print the BFS of a binary tree, with can marker '->' after every level.

2) Given a binary tree and a number, print the all the nodes in the level that contains the node with the given number, expect the number and it's sibling.

3) Delete a node in a binary search tree.

Round: Technical Interview
Experience: 1) Write a code to reverse a link list.

2) Design a data structure to solve the scramble/jumble word problem that comes in the newspaper.

I/p: list of letters

O/p: all the valid dictionary words

eg: ogd

O/p : god, dog.

Round: HR Interview
Experience: What is the thing that you most like about your current company?

-> What is the thing that you least like about your current company?

-> Tell me about your current work exp?

-> Where do you see yourself after 5 years?

College Name: NA