Rejected two faces
Cloud + AI group, the specific direction of information security tools development
one side:
1) describe the principle of quick sort, and quick sort of the writing process, while speaking out when quick sort will trigger the worst time complexity
2) two strings:
A:"abcbdc"
B: "bcd"
Analyzing the full array B, is present in a sub-strings A
Two faces:
1) Find the maximum depth of a binary tree
2) Find the longest path in the binary tree (the leaf node to a leaf node)
3) The problem 2) the longest path print
