CareerCup

You have a plain with lots of rectangles on it, find out how many of them intersect

Sort a list of numbers in which each number is at a distance k from its actual position

Store a set of sudden-death tournament results in a compact format (eg. a bit array) and a set of predicted match results (also in a bit array). Score the predictions, giving one point per correctly guessed match, without unpacking the bit array into a more convenient format (ie. you have to traverse the tree in-place).

Implement a simple regex parser which, given a string and a pattern, returns a boolean indicating whether the input matches the pattern. By simple, we mean that the regex can only contain special character: * (star), . (dot), + (plus). The star means what you'd expect, that there will be zero or more of previous character in that place in the pattern. The dot means any character for that position. The plus means one or more of previous character in that place in the pattern.

1. find all the combinations of a string in lowercase and uppercase. For example, string "ab" -> "ab", "Ab", "aB", "AB". So, you will have 2^n (n = number of chars in the string) output strings. The goal is for you to test each of these string and see if it match a hidden string.

int[] first = {3}; // size 1
int[] second = new int[3]; // size 3
second[0] = 2;
second[1] = 4; //2,4

Second array has enough space to hold all elements of first and second array, where both the arrays are merged. Now write code to have first array into second.

The following Cracking the coding interview code doesn't work.

public static int[] merge2(int[] first, int[] second){
int lastA = first.length-1; //0
int lastB = second.length-1; //2
int indexMerge = (lastA + lastB);
while(lastA >= 0 && lastB >= 0){
if(first[lastA] > second[lastB]){
second[indexMerge] = first[lastA];
indexMerge--;
lastA--;
}else{
second[indexMerge] = second[lastB];
indexMerge--;
lastB--;
}

}

while(lastA >= 0){
second[indexMerge] = first[lastA];
indexMerge--;
lastA--;
}
return second;
}

You are given a 2-Dimensional array with M rows and N columns. You are initially positioned at (0,0) which is the top-left cell in the array. You are allowed to move either right or downwards. The array is filled with 1's and 0's. A 1 indicates that you can move through that cell, a 0 indicates that you cannot move through the cell. Given a function numberOfPaths which takes in the above 2-D array, return the number of paths from the top-left cell to the bottom-right cell (i.e. (0,0) to (M-1,N-1)).

Consider in Java arraylist we have mix of int, double, float, string, etc. How will you find if a given index of arraylist have string. No need to worry about generics and type safe.

Consider the following array {1,2,3,4,5,2,5,4,4};
In the above array, index 4 could be considered as breaking point where summation of 0 to 4 in the array is equal to summation of 5 to end of array. We need to find the breaking point for the given array. I solved this. But follow up was for this array

{1,0,-1,-1,1};

. Mathematically the later array's breaking point is 2.

How do you add two numbers that are larger/longer than Integer datatype? I said I would use BigInteger , then he asked how will you add if the number is larger than BigInteger?

Implement Stack operations using two queues. I wrote some code, later he asked, how many elements could be added to this queue. (My code was like this Queue<Integer> q1 = new Queue<Integer>(); ) What would be the maximum number of elements that this queue would accomodate? My code was in java.

Program an iterator for a Linked List which may include nodes which are nested within other nodes. i.e. (1)->(2)->(3(4))->((5)(6). Iterator returns 1->2->3->4->5->6

Given a line length insert white space so text is uniformly displayed within the given length

What is mean by non blocking thread safe? Is it different from thread safe blokcing? Code a non blocking thread safe queue in Java

Implement a circular queue of integers of user-specified size using a simple array. Provide routines to initialize(), enqueue() and dequeue() the queue. Make it thread safe.

Write a function that receives three integer inputs for the lengths of the sides of a triangle and returns one of four values to determine the triangle type (1=scalene, 2=isosceles, 3=equilateral, 4=error). Generate test cases for the function assuming another developer coded the function

Given two log files, each with a billion usernames (each username appended to the log file), find the usernames existing in both documents?

Everyone knows that finding a loop in the single linked list is using runner and follower method. Could you provide mathematical proof of correctness for it and why it works. I said something like induction hypothesis. Someone help me with the correct answer.

How will you find if a string is a substring of another string in O(n) complexity. For example, "tl" is substring of bottle.