Table of contents
- Preface
- 1. The longest common subsequence of two strings (characters may not be consecutive)
- 2. The longest common substring of two strings (characters must be consecutive)
- 3. Reconstruct the binary tree using preorder and inorder sequences
- 4. Find the complete lexicographic order of a set of characters
- 5. Find the first k smallest numbers in a set of numbers
- postscript
Preface
"Practical Interview Experience" is the second part of this column. This blog post is the twelfth blog post. It mainly collects hand-written algorithm questions that are often tested in interviews. If necessary, you can:
- Click here to return to the index articles of this column
- Click here to return to the previous article "[Java Campus Recruitment Interview] Practical Interview Experience (11)"
- Click here to go to the next article "[Java Campus Recruitment Interview] Practical Interview Experience (Thirteen) - Common Intelligence Questions"