Phone interview:

1. Apply one permutation to another
2. Count Squares

Onsite:

1. It is necessary to find a string that contains all 4-digit passwords, passwords can consist only of numbers.
   https://leetcode.com/problems/cracking-the-safe/description/

2. Such a graph is given. There are k layers, each layer consists of a set of vertices, from the top of the layer i there are edges to each vertex in the layer i + 1. Ribs and vertices weighted. We must find the shortest path from the first layer to the last layer.

3. There was a non-negative 64-bit number, which was encrypted as follows. Each single bit was replaced by the letter B, zero - A. They wrote this line twice. Before the first password, between the passwords, after the second password, a bunch of random letters A and B were thrown around. Question: can this number be uniquely determined? If yes, then find.

4. Strings are given. Each line is a path to some class in java along with packages. For example: java.util.HashSet. It is necessary to build Trie(Aho-Corasick), and bring this tree in a certain format.