CareerCup

Give the structure of a directed graph
START -> a -> b -> c -> END

If a word can start from start and end at END, then we think the word is in this diagram
For example, the string "abc" is consistent, but "ab" does not match,
Although "ab" is also inside the graph, b's next is "c" instead of END, so it's not legal word
(Note: each node can have more than one next)

1. According to the problem, design the data structure
Write a function, input is START and a string, to determine whether the string is a valid word
3. follow up, if the graph has cycle, how to do?
4. If the graph has repeated characters how to do?

Write a function that takes two numbers as strings and returns the result as a string:
mul(l string, r string) : string
Assume the numbers might be too large to be parsed into a variable of any numeric type the language has.

how to check is a small matrix appear in a big matrix
boolean isSubmatrix(int[][] small, int[][] big)

You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery,
Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of work
requires that they only make one cut at a time.
It is easy to notice that different selections in the order of cutting can led to different prices. For
example, consider a stick of length 10 meters that has to be cut at 2, 4 and 7 meters from one end.
There are several choices. One can be cutting first at 2, then at 4, then at 7. This leads to a price
of 10 + 8 + 6 = 24 because the first stick was of 10 meters, the resulting of 8 and the last one of 6.
Another choice could be cutting at 4, then at 2, then at 7. This would lead to a price of 10 + 4 + 6 =
20, which is a better price.
Your boss trusts your computer abilities to find out the minimum cost for cutting a given stick.

/**
*
* Google OnSite Round 3
*
* Data structure for Task Dependency
* A task can start only after all its pre-requisites are done
*
* Code the methods addTask(preRequisiteTask, dependentTask)
* and
* getExecutionSequence()
*
*/

/**
*
* Google OnSite Round 2
*
* Input is an integer array A
* Return an array B such that B[i] = product of all elements of A except A[i]
*
*/

/**
*
* Google Telephonic Round 2
*
* Given any uppercase string. Report the starting index at which any valid permutation of
* ABCDEF starts. If not found, then report -1.
* Possible permutations of ABCDEF are ABCDFE, BCDAFE, FEDCAB etc (a total of 6! = 720 permutations)
*
*/

/**
*
* Google Telephonic Round 3
* Find the sum of all nodes stored in a tree
*
*/

/**
*
* Google Telephonic Round 3
*
* Convert an integer to base-3 equivalent
*
*/

/**
*
* Google Telephonic Round 1
*
* Given two strings - S1 and S2.
* Arrange the characters of S1 in same alphabetical order as the characters of S2.
* If a character of S1 is not present in S2 - such characters should come at the end of
* the result string, but make sure to retain the order of such characters
* Case sensitivity is irrelevant
* e.g. S1 = "Google", S2 = "dog"
* Output = "ooggle"
*
* e.g. S1 = "abcdedadf", S2 = "cae"
* Output = "caaebdddf"
*
*/

A sequence of strings, printed first by column, on a screen of width K,
Requires the first column of the same column by column alignment,
At least one character interval between columns and columns,
Ask how many lines at least?
such as:
The string sequence is {"abc", "de", "fghij", "k", "lmno", "p"}
The screen width is 10
The answer is at least 3 lines
abc k
de lmno
fghij p

Give a decimal number, such as 123. Asking a total of smaller num than 123 made up by 1 and 0 composed of decimal numbers.
111, 110, 101, 100, 11, 10, 1, 0.

To a word, and a map, map which is a word, ask this if a word is smash able? That is, you can smash one letter each time, and the rest of the letters can form a single word (the new word is still in the map) until it is completely hit.
For example: sprint -> print -> pint -> pit -> it -> i -> ""

Minimum number of swaps of chars in only one string to make two strings the same

Matrix conversion problem. For example, give a matrix
a: 1, b: 2.
b: 2, c: 3
Then converted into
a, b, c
1, 2, .
., 2,3

Implement a grep-like function. For example
[A1 + A2, B1 + B2, C1], grep (A = A1), is to return the result that contains A1,
For example, [A1, B1, C1], [A1, B2, C1].
More tricky can be grep (A = A1, A2, B = B1), so that is included (A1 || A2) & B1.

Given an array {a0, a1, a2, ... an, b0, b1, b2 ... bn},
Rearrange this array into {a0, b0, a1, b1, a2, b2, ... an, bn}
inplace, O (1) space

Suppose there is a map with N bikes on it and now we have N individuals,
Design an algorithm so that everyone can get the bike in the shortest distance

Given a string, at each time, you can move any one of the char to the front,
ask you to find the minimum such move to get the target string
example
source abc, target cba :
abc -> bac -> cba
return 2

Give you a bunch of light bulbs. Can flip a range of open change off, turn off open, and then asked to do so k times later, just ask you a light bulb is turned on or turned off, how to do

*e*er -> peter
**eue -> queue
**o
ma*
*p*a*e*
*erso*
***k*am*on
*ouse
*a*
*ur*
***igent

where there are 26 *, and we can fill all the stars in to form valid english words while using each letter once. Given this array and a dictionary how would you fill all the words in?

public string stringWrap (String text, int characters)

text is an input string, characters on behalf of the output of
each line up to the number of bytes
input

"Thank you for shopping at the XYZ store.\n Your order has been processed successfully.\n", 20
output：
        "Thank you for\n
        shopping at the XYZ\n
        store.\n
        Your order has been\n
        processed\n
        Successfully.\n"

example 2:"Hello! How are you?"，6
output
“Hello!\n
How\n
are\n
you?\n"

Modify the following code:

def GenerateGraph(data):
    d = {}
    g = Graph()
    for word in data:
        for i in range(len(word)):
            bucket = word[:i] + '_' + word[i+1:]
            if bucket in d:
                d[bucket].append(word)
            else:
                d[bucket] = [word]

    for v in d.keys():
        for word1 in d[v]:
            for word2 in d[v]:
                if word1 != word2:
                     g.addEdge(word1,word2)
    return g

The objective is to find all combination of words by changing one letter at a time and adding to the graph if word exists in the dictionary.

We need to rewrite a different logic for the above code.

Give a string [] words,
Find the shortest string [] containing the keyword inside.
example:
words: sky cloud google search sky work blue
keywords: sky blue
return: sky work blue

Given an array, find the number of tuple such that A [i] + A [j] + A [k] = A [l] in an array, where i <j <k <l.

Given a n-nary tree, check whether it is a mirror of itself (ie, symmetric around its center).

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

Imagine a scenario where there are N cars on an infinitely long single-lane road. Each car has a unique, permanent integer speed ranging between 1 and N, inclusive (units are irrelevant). The cars can be placed in any order along the road and then told to start driving indefinitely. Let's assume that the cars are traveling from right-to-left. So the leftmost car is at the front. Given an ordering of N cars, construct an algorithm to return an array of cluster sizes

N=4

[2, 4, 1, 3] -> [2, 2]

[2, 5, 4, 3, 1] -> [4, 1]

followup：
New car speed = N+1. Given an ordering of N cars, construct an algorithm to return an array of arrays of cluster sizes that will arise when the N+1 car is inserted. The ith row in the outer array corresponds to the cluster sizes that exist when the N+1 car is inserted into the ith index

new car speed = 5

[2, 4, 1, 3] -> [[1, 2, 2], [3, 2], [3, 2], [2, 3], [2, 3]]

Given one string s1, and then insert one char into this string at any place, to get s2, find the inserted char
Could you do it in logn time

Give you a 2xN board and two kinds of tiles: 1x2 (two squares across), 2x1 (two squares up) Ask how many ways you can fill the board.

**       **       *      *                                      
*         *        **   **

Follow up is the new four kinds of tiles: L shape in different angle, , ask you how many kinds of tiles are now six

give a binary matrix, 0 on behalf of the sea, 1 on behalf of the land, the val also represents the height of the altitude, if a cell is originally on land and is also surrounded by eight neighbor are on land, that cell become 2, each cell and its eight neighbor elevation cannot differ by more than 1. Return to the highest altitude can take altitude (special case is if the entire matrix is 1, then it is unlimited)