CareerCup

Gives you an int m, and a set of char (0,1,2,3,4,5,6,7,8,9)
Lets you implement a function that generates a id based on the characters in the set. Each time you return a string, it must be unique. satisfying the same character can not appear consecutively more than m times, such as m = 3, "1000" is valid,
"0000" is not valid.
The smaller the string, the better.

Let’s say you have two input arrays with sorted elements. Find the union.

a[] = {2, 10, 14, 19, 51, 71}
b[] = {2, 9, 19, 40, 51}

Union = {2, 9, 10, 14, 19, 40, 51}

A group of friends are tracking the miles per gallon for each of their cars. Each time one of them fills up their gas tank, they record the following in a file: His or her name The type of car they drove How many miles driven since they last filled up How many gallons purchased at this fill up Date of the fill Their data is formatted as a comma separate value (csv) file with the following format for each row:(#person,carName,milesDriven,gallonsFilled,fillupDate) Miles are recorded as floating-point numbers and gallons as integers. Please create a program that allows members of this group to determine the miles per gallon (MPG) of each of their cars during a specific time range. Note: person may have more than one so a time range query might need to output data for one or more cars. A skeleton class will be provided; your job will be to complete the program. The principal function for querying MPG is of the form (the exact name, data types, etc., can be learned by inspecting the "solution" class in the skeleton code): GetRangeMPG(PersonName, StartDate, EndDate) Returns list of objects containing (CarName, MPG) MPG is calculated as (total miles traveled during time period)/ (total gallons filled during time period. The dates you receive in the query should be treated inclusively.

To push dominoes, find out how many dominoes are standing in the end

For example, the input is ".R...RL..R..L..", which means pushing the 2nd, 6th, and 12th dominoes to the right and pushing the 8th and 15th dominoes to the left. This example returns 4th. 1,7,16,17 blocks are standing

The question is that there are a lot of vm, what is the total vm consumption max. For example, (2,4,8), (3,5,3) this input,
This means that 2 to 4 seconds have a memory usage of 8 and 3 to 5 seconds of 3, so the answer is 11 at 3 seconds.
Return 11 to it. Note that (1,2,3) and (2,3,4) such that the middle 3+4=7 is good.
Follow up is usage is not constant, such as (1,2,1,2) the first second usage is 1,
The second second is 2, the linear increase, the highest is how much.

Given an alphabet where we do not know the order of the letters also do not know the number of letters.

We are give an input list of tuples where each entry in the list gives an ordering between the 2 letters

Determine the alphabet order.

Ex-
<A, B>
<C, D>
<C, E>
<D, E>
<A, C>
<B, C>
Order is A, B, C, D, E

AWS phone interview
Find the left view of binary tree
1
/ \
2 3
/\ \
4 5 6
/ /
7 8
/
9
return [1, 2, 4, 7, 9]

Given as list of movies in a csv file, extract the movie name and genre and be able to return a query based on the years and the genre.

Basically, Parsing a CSV input file and build an indexed data storage to allow search the data in time manner.

Given a list of tasks each with memory requirements and time, only one machine has K memory.
Do not consider the context switch, page swap, virtual memory, (for example, the machine has only 20mb memory, a task that requires 25MB of the task can only wait until there is enough memory to run it.) The running task cannot be suspended.
Ask how long it takes to complete all these tasks. . .

1) You sell roses. Each rose cost 30 cents to buy and you can sell them for $10 a dozen.
a) How many you need to sale to break even if you bought 600 roses?
b) Tomorrow is holiday - there's 20% likelihood you will sale 600 roses, 50% likelihood of selling 900 roses and 30% likelihood of selling 1200 roses. How many would you buy to maximize profit?

Write a method that can take in an unordered list of airport pairs visited during a trip, and return the list in order:

Unordered: ("ITO", "KOA"), ("ANC", "SEA"), ("LGA", "CDG"), ("KOA", "LGA"), ("PDX", "ITO"), ("SEA", "PDX")
Ordered: ("ANC", "SEA"), ("SEA", "PDX"), ("PDX", "ITO"), ("ITO", "KOA"), ("KOA", "LGA"), ("LGA", "CDG")

/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/

Find the largest duplicate subtree in a binary tree


For example,

        1
       / \
      2   3
     /   / \
    4   2   4
       /
      4
The following are two duplicate subtrees:

      2
     /
    4
and

    4

but the former is the largest, thus return the root of the first subtree

Given a target string, an input request replaces the word after the given index a->b such as:
Target string: "Hello world!"
Input:{s:0, a:Hello b: Goodbye}
Output:"Goodbye world!".
The requirement is that input be given to several words that need to be changed at one time: {{s:0,a:Hello,b:Goodbye},{s:11,a:!,b:?},{s:6 a: World,b:friend}}
And each modified index is based on the original unmodified target string so the end result is
"Goodbye friend?"

given a n-ary tree, find the total distance from this node to any other nodes

class TreeNode {
int val;
List<TreeNode> children;
TreeNode(int val) {
this.val = val;
children = new ArrayList<>();
}
}


public int findDistance(TreeNode root, TreeNode node) {

}

How many squares are inside a m*n rectangle where some grids in the rectangle were grey and the gray grid could not appear in the small squares.

Given an int array, check if all the numbers can be divided into 5 consecutive numbers.
Eg: [1,2,2,3,3,4,4,5,5,6] Yes: (1,2,3,4,5) (2,3,4,5,6)
Followup: ask if you know that all the numbers are between 1 and 13,
what's a good optimization.

You have two matrixs, how to move the first matrix
(move up, down, left, and right) so that the two matrix in the two matrixs match most.

eg:
matrix 1:                matrix 2:
0 0 1                    0 0 0  
0 1 1                    1 1 0  
0 0 0                    1 1 0

Then, after taking matrix1 (1 left shift + 1 down),
the number of 1 in the match with matrix2 is 3

how to check if two graphs are structurally identical

class UndirectedGraphNode {

List<UndirectedGraphNode> neighbors;
UndirectedGraphNode() {
neighbors = new ArrayList<>();
}
}

convert a Sorted array to complete BST

Give a connected graph, no cycle,
Find the node where the average distance from all other nodes is the smallest

Input: an int array without sorting, then do a binary search on it, and find the number of digits that cannot be found by binary search.

<key = "a"; val = "3"; depend_list = null;/>; <key = "b"; val = "a * a";
Depend_list = {a};/>; <key = "c"; val = "a * b"; depend_list = {a,b};/>;
Lets output a map<key, value>,a -> 3, b -> 9, c -> 27
Follow-up questions: Make a statistic for all keys and corresponding map entries with the same value.

Given an array, find an x such that all numbers less than x are equal to themselves. Numbers greater than it are equal to x, and all numbers add up to a target
For example, [1 3 5 7 9] target=24, answer is8. Because when x=8, the array has only 9>8, so 1+3+5+7+8=24 is the closest to the target.

Give an N-length array with only 0 and 1 inside
Requires to find the minimum number of conversions needed to convert the array to 0 before all 1.
The conversion is to change a 0 to 1 or a 1 to 0,
And the number of 0 and 1 in the converted array can be arbitrary.
Just find the minimum conversion step

Imagine a horizontal corridor bounded by y = y1 and y = y2 lines on a 2D-plane. There are N sensors with centers (x, y) each of which operates in a range (r) on the plane . So, they cover some circular areas on the plane. See the figure below.

o            |
_____o___o__|____________ y = y1
		o	|OOO
__________oo|_____O______ y = y2
	O		|  O
_ _ _ _ _ _ | _ _ _ _ _ _
			|
	o O		|		o O
		O	|
			|
O			|
			|

The question is whether a path exist from x=-inf to x=+inf via corridor without being detected any radar.

Constraints:
1. You are free to move any direction only if you stay in the corridor.
2. You are free to go through corridor borders.
3. N sensors are given as list of (x, y, r) like [(1, 3, 2), (-1, -3, 4)]. x and y are signed integers. r is a unsigned integer.
4. y1 and y2 are integers.

My solution:
1. Create an intersection graph of N sensors by comparing them each other via Euclidean distance

(x1 - x2)^2 + (y1 - y2)^2 <= (r1 + r2)^2

2. If there is a path between y=y1 and y=y2 through intersected sensors, there do not exist any path from x=-inf to x=+inf. Otherwise, there do exist a path. So, I used BFS to search such a path.

Worst Case Complexity:
1. O(n^2)
2. O(V + E) = O(n + intersection_count)

Total: O(n^2)

My Best Case Optimization for Intersection Graph:
1. For each sensor, create two events for start and end of circles vertically. y = (y1 - r) and y = (y1 + r)
2. For each sensor, register those two events into an array.
3. Use a line sweep algorithm over 2, which is O(nlogn + intersection_count) and intersection_count may be n^2 at worst case.

I wonder if I should have had a better solution with the worst case < O(n^2).

Numbers with 4 are considered to be unlucky, floor numbers are skipped with numbers with 4; for a top level n, ask how many layers there are actually; for example n=20, that is 18 levels [Remove 4, 14]

I read this question here in careercup and saw no comments on it. So, I am answering it.
given a string find the sum of number of unique substring characters.
means if string is ACAX. the sub strings are A,C,A,X,AC,CA,AX,ACA,CAX,ACAX. in ACA, A occurs more than once so, its count is not considered, but C occurs once so its count is 1. Similarly in ACAX, A's count=0,C's count=1,X's count=1. In such a manner find sum of all counts for all substrings. The worst case time complexityis O(n). IF same substring occurs more than once then find its sum for that many times.

Input unsorted integer array represents a list of coins,
find the minimum amount of money that cannot be formed by these coins, each coin can only be used once
     E.g. {1,1} -> 3, {1,2,4} -> 8

Give me a list of int, find the length of the smallest cycle. For example, 1, 2, 1, 2, the length of the cycle is 2. Then 1, 2, 1, 2, 1 has a minimum length of 2. Then the length of 1, 2, 1, 2, 3 should be 5 because the entire list is not in repeat. Then the minimum length of 1, 2, 1, 2, 1, 1, 2 is 2.

Find the kth missing element in a sorted array. For example [2,3,5,7], k = 0: return 4, k = 1: return 6

expected time complexity logn