CareerCup

Print a singly linked list in ascending and descending order in O(n) time. Both order printing should take O(n) time only.

Have you done debugging in JVM? How would you do it.

If given a binary file, with data like lat, long, weather, temp in key:value. It's a structured data how would u ingest it. what are the steps that are being taken before Hive process starts.
- serde (serializartion deserialization). parque etc.

Lets say if Mongo captures user views and oracle captures purchases. How would you design realtime system that answers question "give me avg. no. of views of users by purchases".
So if a user watch a trailer 10 times and then decides to buy a video. How would you calculate it. He was looking for QUEUE.
He could have gone on more details but stopped because i didn't give details on this.

How would you increase efficiency of a hive query?

What is distribute cache in Hadoop?

What do you mean by combiner?

After map phase partition, shifting, sorting happen. What does it mean?

What is input split in hadoop.

As I interviewing for Big data position. Asked Hadoop question :-

Difference between TextInput vs Key Value format in Hadoop.

How Solr/Lucene or Elasticsearch work? For what purpose are they used?

What's Hbase, Pig, used for? Why do we need Hbase if we can use Hive to query Hadoop?

What are different phases of Map reduce operation - I think they were looking for split, combiners, partitioners, sorting phases of whole map reduce stage.

My interview was for big data position for their Search team. They were looking for person with good Hadoop skill set :-

1. Can you describe Hadoop Architecture? What are various components of it (Primary/Secondary namednodes, data node etc)? Explain working of each.

Is there a difference between the terms "sibling" and "cousin" of a specified node in a Binary Tree/ Binary Search Tree? If yes, then what?

Implement Priority Queue

Implement Least Recently Used Cache for IPAddress lookup. Assume max cache size is 1000 but it should scale well with larger number
Key of the cache is server name and value is IPAddress.

advantages and disadvantages of Circular queue according to its implementation in array and linkedlist ??

Given an array of integers and a number. WAP to find the pairs which sum of upto given number.

I solved it. Then he asked about writing test cases for this function.

I wrote below test cases

1.) All the elements should be number.
2.) Length of array should not be 0.
3.) Array itself should not be null.
4.) Given number, arrayLength can be represented by 32bits or 64 bits.
5.) number should not be negative.
6.) Input does not has pair, It should return false
7.) Input has pair, It should return true
8.) Input has all negative values and pair exists, then function should return true
9.) Input has all negative values and pair does not exists, function should return false

He told that he is looking for more test cases. Can you guys think of some more complex test cases.

Write a function that accepts root of a binary tree and print zigzag level order traversal, each level print in new line.
For example,
Given tree:
1
2 3
4 5 6 7
8 9
output:
1
2 3
7 6 5 4
8 9

Write a function that accepts root of a binary tree and return true if it is foldable otherwise return false. A binary tree is foldable if left subtree of root is mirror image if right subtree.
For example:
Given tree,
1
2 3
4 5 5 4
6 6
output: trus

Write a function that accepts root of a binary tree and print zigzag level order traversal, each level print in new line.
For example,
Given tree:
1
2 3
4 5 6 7
8 9
output:
1
2 3
7 6 5 4
8 9

Write a function that accepts two character arrays each represents a floating point number and return their sum in character array.
For example function accepts "23.45" and "2.5" and return their sum "25.95".
Restriction: We cannot use predefined functions / methods or parsing. We have to go with basic operations.

Which structure can be used to return the lastly added node and remove it from the collection and also will allow to peek the highest valued node without removing it from the collection. What is the time and space complexity for Push, Pop and Peek actions

In a Formula-1 challenge, there are n teams numbered 1 to n. Each team has a car and a driver. Car’s specification are as follows:

– Top speed: (150 + 10 * i) km per hour
– Acceleration: (2 * i) meter per second square.
– Handling factor (hf) = 0.8
– Nitro : Increases the speed to double or top speed, whichever is less. Can be used only once.

Here i is the team number.
The cars line up for the race. The start line for (i + 1)th car is 200 * i meters behind the ith car.

All of them start at the same time and try to attain their top speed. A re-assessment of the positions is done every 2 seconds(So even if the car has crossed the finish line in between, you’ll get to know after 2 seconds). During this assessment, each driver checks if there is any car within 10 meters of his car, his speed reduces to: hf * (speed at that moment). Also, if the driver notices that he is the last one on the race, he uses ‘nitro’.

Taking the number of teams and length of track as the input, Calculate the final speeds and the corresponding completion times.

Write code to rotate a square matrix:
Input:
1 2 3
4 5 6
7 8 9

Output:
4 1 2
7 5 3
8 9 6

You are given two objects, Student and Course, and there exist a many to many relation between them. One student can be enrolled for more than one course and there can be many students enrolled for a single course. Design an effective data structure to store such data keeping in mind that the time complexity for search should be optimum. A search can be for the list of students enrolled for a single course, or for the list of courses a single student is enrolled.

Find the depth of Binary search tree without using recursion?

Implement a program to reverse the linear linked list in pairs. it should handle both even number of nodes and odd number of nodes. if odd number of nodes, the last node will be the last node after reversion.
Do not move the data in the nodes. Do manipulate node pointers/references. the nodes themselves need to be manipulated, not just the data in the nodes.
For example, if the initial linear linked is,
1->2->3->4->5
after reverse it should be,
2->1->4->3->5

Implement a function that checks if the given binary tree is binary search tree(BST). Use tree operations to solve this. do not try solving by pre-order traversal of the tree and then checking if the array is sorted.
instead, traverse the tree for checking if it is BST.