All the rounds were online

Round 1 was written:

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 2 : (tech)

1) Link list contains positive and negative num, rearrange the link list such that all the positive are on one side and all the negative on the other, maintaining the order of appearance.



2) An sorted array has been rotated n number of times in a any direction, write a code to search an element in O(log n) time.



3) An array contains positive and negative numbers. Find the sub-array that has the maximum sum.



------------------------------------------

Round 3 : (tech)

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 4 : (tech + HR) with company's CTO

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.

You solution should be performance oriented. Design the dictionary to store the valid words as well.



Followed by few HR ques:

-> 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?

...



That was it, got the offer letter within 2 hr after the last interview...:)

Enjoy!!!

HAVE YOUR SAY...