CareerCup

For the given array count the partitions such that absolute deferrence between any two elements from partition is less then or equal to k order of elements in partition array is is independent and elements is not get repeated in portion.
Quetion: A[] = { 1, 2,3,10, 5,4}, K = 3.
There are two Possible partitions are {1,2,3}, {5, 4} or {1,2}, {3, 5, 4} or {2,3,5,}, {1,4} there are two partion such that absolute deferrence between any two elements is less then K
So the Output is 2

Print Common Suffix In Strings

Ex: cornfiled , Exfiled --- field

Explain the Data Structure which is well suited to implement UNIX commands like PWD, LS, MKDIR, CD in an imaginary OS. No code required.

Unsorted array and a position ‘P’. Return the element that is likely to come to the given location upon sorting the array. TC in O(n).

A thief trying to escape from a jail has to cross ‘N’ walls each with varying heights. He climbs ‘X’ feet every time. But, due to the slippery nature of those walls, every times he slips back by ‘Y’ feet. Now the input is given as (N, {H1, H2, H3,….Hn}, X, Y}. Calculate the total number of jumps required to cross all walls and escape from the jail.

is there a way to make the bean not initialize when spring application context coming up

Cadbury bar size of 5*3 can be distributed to 4 children.

5*4 can be distributed to 5 children.

6*3 can be distributed to 2 children.

6*4 can be distributed to 3 children. so the whole carton can be distributed among 14 children



Program output shall be 14.



Input/Output Specification: M,N,P,Q are the integer type (M,N values are the ranges for the length of cadburybar P,Q values are the ranges for breadth of Cadbury bar)

Output: Number of children who will receive cadbury bar from the carton.

You have given an array and you want to find an integer k so that the sum of the distances from k to each of the n integers is minimized. Define distance between two integers a and b as |a−b|3.

if n coin is given and each have different probability for getting head that is for coin Ai probability is Pi
find the probability for getting exactly k head

This was a question asked to my cousin in a recent phone interview with Cisco.

You're given an array of integers (unsorted) and the length is really large (perhaps a million integers). Now you are required to write an efficient code to retrieve topN integers. If N is 10, return the top 10 integers from the array. You result may or may not be sorted, that's your call. For e.g. if given array is arr = { 2, 1, 20, 3, 6, 5, 4, 8, 11, 12 }; and given N value is 3, then your result should be either {20, 11, 12} (unsorted) or {11,12, 20} (sorted).

This was design question.

I have a single timer class which is running on a single port of a machine.

There are multiple clients that can send request to this timer class as follows.

request_timer (x)
where x is time in seconds.

when the timer class gets this request from a client it starts a timer object of x seconds and after x seconds are over it sends an event to the requesting client and client can handle the event the way it wants to .

The problem is if you have large number of clients then the timer class is single point of congestion and the clients may receive the event from it after a long time.

What are the good ways to scale this for a large number of clients?

Hi, I was asked a this one at the interview. Below is the problem statement:
1) I have a array of n bitstring elements of width m bits, for example:
{1001, 0101, 1100, 0011, 1111, 0000, 0001}
2) We have to apply a filter such that out of these n elements, only k elements pass through the filter while the rest gets blocked, for example
{1001, 0101, 1100, 0011, 1111, 0000, 0001} -- filter -- > {1001, 1100, 1111}
3) Filter has been designed based on a concept of mask and ID.
mask: It tells which bits to consider out of the m bit bitstring elements. Only those bits which are set to '1' would be used for checking while the rest be ignored. for example, a mask of {1000} would mean only 4th bit would be considered for checking while the filter won't care about the other bits of an element.
ID: It is the allowed value for the designed mask. for example, an ID of 1xxx (where x is don't care) with a mask of 1000 means that any element which has 4th bit as '1' would be allowed while if the 4th bit is '0', that element would be blocked. Since the mask doesn't check the 1st, 2nd and 3rd bit, any value, '1' or '0' would be allowed to be passed through the filter

For the above example, a single mask of 1000 and ID of 1xxx solves the problem. We need to find a generic solution for any set of n elements and k allowed elements. All of the k element might not get covered by a single mask and ID. We need to find the optimum solution using minimum number of mask,ID sets with their values.

Which is faster?
while(1) {}
or
while(2) {}
I said both have same speed as the expression inside while should finally evaluate to true or false. in this case both evaluates to true and there are no extra instructions inside the while so both have same speed of execution. Interviewer said while (1) is faster than while (2).
I do not agree . do you ?
By the way interviewer was a senior manager (i,e. does not code on day-to-day basis)

C++ Program that uses Linked List to display an Address Book (Name, Address, and Phone number)
Note:phone numbers format: (xxx)-xxx-xxxx
Address should ..street...City...State...Zip

There is a bucket N which contains n nuts of different
sizes and bucket M of m bolts. Also there is a compare function which will take one bolt and a nut as input and return -1,0,1, respectively if nut size greater, equal, or lesser than bolt. Write an algorithm to find matching nits and bolts. Initially he gave sizes for nuts and bolts instead of compare function so i made use of hash map and solved it. So after that he gave this function and asked if there is a better soution than O(mn) ?

A car is to be parked in 5x5 matrix parking lane.First of all we have to search the free space in the given matrix and then we have to allocate the memory to the car .Afterwards we have to remove the car from the parking lane.(In C)

Design an algorithm for a restaurant with a host conditions are when ever a person empties his plate the host will be notified. and when ever number of persons waiting exceeds maximum notify the host.

Which data structure and java design pattern are best fitted for Car Parking problem.

I have two threads, both contain data from a database table. One thread performs some operation and update the data in the database table whereas second thread has not yet done any operation. Second thread does operation after some time and wants to update the operation. Since the first thread has already updated the data in the database table, second thread has stale data. How can we manage so that table should have the actual data not the stale data.

int n=99;
int unsignedShift = n>>>2;
System.out.println("unsignedShift="+unsignedShift);
The above result gives "unsignedShift=24". The question is if 24 is given how can I get back the original value ie n ie 99. How to do it for both positive and negative integer. How to do it in java.

very interesting.It's from cisco onsite interview.

write a function, and the output should be the function itself.

can anyone provide the code?

Given a big string (str1) find (s1) and replace by (s2).

Example :
str = "Hi i am abc and i am in abc"
s1 = "abc"
s2 = "pqrstuv"

So final o/p :
str1 = "Hi i am pqrstuv in pqrstuv"

Given a head to linked list and integer as input, write a function to delete all matching elements in the linked list

Implement Malloc() and free() functions. How is the allocation done? What data structures are used ? How will you know much memory has to be freed , like in free(ptr) , how much memory has to be freed?

How will you perform the preorder and inorder traversal of binary trees without using recursion. Basically he asked first to write a method to perform iterative preorder tree traversal and then iterative inorder tree traversal.

There are 1000 tokens numbered as 1001-2000. Two functions allocate and release the tokens and their signatures are as follows, write their implementation

int alloc_token() { 
//returns token number
} 

void free_token(int token) {
}

What is address alignment?

struct xx {
char a;
int b;
};

printf("%d", sizeof(struct xx));

what would be output of this printf statement? and what would it be if it is union?

When you receive a crash dump for a process from a particular customer, Is it possible to know the line number of which function has caused the problem?

How do you identify which process has crashed in customer env, if there are multiple process crash at same time.

x = x++ + ++y;
y = ++x + ++y;
what are the values of x,y after these are executed ?