CareerCup

preorder Traversing a n-ary tree without using recurrsion

TreeNode<T> {
T val;
List<TreeNode> children;
}

Given two methods for the person class, one to find a dad and one to find a mother, using these two methods to achieve a method to determine whether the two people are related to blood, assuming a limited number of people.

Self-implemented data structures and methods, output all the heirs. To achieve birth (parent, name), dead (name), getAllSucession (). There is a king, you can use birth plus children, dead dead. The order of inheritance is the same as preorder except that this tree has multiple children.

Given an Input file of IPv4 addresses, filter and write them into Valid and Invalid IPs.

Input file = ["192.100.0.1, "10.0.0.1", "aa.bb.cc.dd", "10.0", "999.10.10.1"]
Valid = []
Invalid = []

A coffee machine has three buttons (S, M, L). After pressing each button, the coffee machine will flow out of a range of coffee [s1, s2], [m1, m2], [l1, l2], but the outflow of coffee The amount is random. There is a cup with a total capacity of c2. There is a tick c1 on the cup. If the amount of coffee is [c1, c2], it is considered full.
After asking for a series of button operations, can the coffee be filled in [c1, c2] but not overflow?

Input like method stack trace: "main, start", "foo, start", foo, end", "bar, start", "bar end", "main, end", "main2, start", "main2, end"
Output String, such as the following format, to indicate the order in which the method was called and the hierarchy

main
       Foo
       Bar
main2

public TreeNode{
int val = val;
TreeNode left, right;
public TreeNode(int val){
this.val = val;
}
given a tree and an API, delete a part of the nodes in the tree and return the forest formed after the node is deleted.
public List<TreeNode> deletenodes(TreeNode root, List<TreeNode> toDeletes){

}
example

1
 / \
 2  3
/  / \
4  5 6
If you delete the 2 and 5 nodes, you will need to return to the forest
[4,     1]
         \
          3
           \
           6

turns the following format string into a tree: node has keys, values, and subtrees.


For example, the first key is node1 and the value is ‘aaaa’


<node1>aaaaa<node2>bbbbb</node2><node3>cccc</node3><node4>dddd</node4></node1>

find longest common suffix of two linked list.

Give a 0/1 matrix to find and remove the islands. Assume that the boundaries of the matrix are 1
The definition of islands is surrounded by 0

The simplest example is
enter:
111111
100001
100101
100001
111111

Output:
111111
100001
100001
100001
111111

Write a hash function so that a string and its reverse get the same return value

Hash(‘banana’) == hash(‘ananab’)
Hash(‘banana’) == hash(‘banana’)
Hash(‘banana’) != hash(‘banaaa’)

x={a,b,c}, y={p,q}, z={r,s}
Define a
Operation, x * y * z = {{a,p,r},{a,p,s},{a,q,r},{a,q,s}......{c,q s}}
Is to output all the results in the order of each subset, implementing a class iterator that has Next() and hasNext() methods

Give a tree-like graph that lets you find the maximum length from the leaf node to the leaf node. The input is an array of edges.

Last Man Standing
A king gathers all the men in the kingdom who are to be put to death for their crimes, but because of his mercy, he will pardon one. He gathers the men into a circle and gives the sword to one man. The man kills the man to his left, and gives the sword to the man to the dead man's left. The last man alive is pardoned.

With 5 men, the 3rd is the last man alive.

Write a program that accepts a single parameter: a number N that represents the number of criminals to start with. The program should output the number of the last two men alive.

Example #1: myProgram 5

would output:

5, 3

Example #2: myProgram 7

would output:

3, 7

To determine whether two people have kinship, all data structures need their own definition

Given an integer n (say somewhere between 100 and 1000), you want to generate a random binary tree having exactly n nodes. You are only interested in the structure of the tree. Each structurally unique tree should ideally have the same chance of being generated.

Given a binary matrix, find if there is a path from the upper left corner to the lower right corner, meet the conditions each time the value of the cell must be different.
Follow up if there is a path with the same number of 0 and 1?

Given k numbers as strings. The numbers may be very large (may not fit in long long int), the task is to find sum of these k numbers.
Example
S1 = “100”
S2 = “10”
S3 = “1”
Return “111”
public string addNumbers(String[] nums){
}

There is a process sequence that contains the start and end of each process. There is a query sequence asking how many processes are running at a certain point in time. Please return the query result of the query sequence.


Example
Given logs = [[1, 1234], [2, 1234]], queries = [2], return [2].

Explanation:
There are 2 processes running at time 2.
Given logs = [[1, 1234], [2, 1234]], queries = [1, 1235], return [1, 0].

Explanation:
There is a process running at time 1, and 0 processes running at time 1235.

Given:
R number of Red Cards
B number of Black cards
K

Cards needs to be placed in a circle. Start from a position and for
every K moves remove that card And
repeat the process until all the cards are eliminated.

Question: Position the cards such that the red cards are completely
eliminated before the blacks cards are selected for elimination.

Given a BST convert it into new Data Structure that satisfies following conditions:
1. every leaf node's left ptr point to its parent and right ptr points to the next leaf
2. every non leaf node's left ptr points to its parent and right ptr is NULL
3. return the head and print the new DS

example: 
	 7 
	/ \ 
	5  9 
   / \  \ 
  4   6  10 

output: 

head->4->5->7 
| 
->6->5->7 
| 
->10->9-7

with optimal time and space complexity

input: "kitten%20pic.jpg"
output: "kitten pic.jpg"

%20 -> ' '
%3A -> '?'
%3D -> ':'

modify your input in place.
no string library functions.

void Decode(char[] str)

Given a string T of length n, partition it in n' "phrases" (p1, p2, ..., pn'),

such that
pi = pj + c, for some j<i, where + is string concatenation and c is a character

p0 = ''
p1 = pj + c where j < 1


T = p1 + p2 + ... + pn'

For example:
T = aababcabcd = a + ab + abc + abcd
p1 p2 p3 p4

Print a binary tree in vertical order using singly linked list...

There are three threads and we want them to run
one after the other. How can we do that?

In a grid, you are given a position, and every location has some value.
find the shortest length so that you can touch to any boundary of the grid.

You are given a graph and an algorithm that can find the shortest
path between any two nodes
Now you have to find the second shortest path between same two nodes.

Find product of distinct prime
factor of all numbers .
Ex
10
12
7
prime factor of 10 = 2*5
prime factor of 12 = 2*2*3
prime factor of 7 = 7

SO distinct prime factor is 2*5*3*7 = 210

encode binary in bytes is to give a matrix of size M * N,
This matrix is encoded in bytes as a 4 * 4 bool matrix
[0 0 0 0
1 0 0 1
0 0 0 0
0 0 0 1]
Will be encoded as a byte array [9, 1].
Then write a function set_one (vector <byte> arr, int M, int N, int start_row, int start_col, int end_row, int end_col);
Set all of 0 from (start_row, start_col) to (end_row, end_col) to 1
for example
start_row = 1
start_col = 2
end_row = 2
end_col = 0,
Just that 4 * 4matrix will become
[0 0 0 0
1 0 1 1
1 0 0 0
0 0 0 1]

The byte array after encode should be rewritten as [11, 129].

find out all of the state machine will guaranteed to come to safe state
ex
A -> [B, C, D, E]
B -> [A]
C -> [D, E]
D -> [E].
E -> [safe state]
Output [C, D, E] because once these states will eventually go to safe state