|
|
Posted on 1/8/2019 9:17:25 AM
|
|
|
This year's job search journey is almost over, in fact, there has been no interview for a month or two, I thought about it or record the following companies, only remember those that I can remember.
My position is a Java R&D engineer, so it involves all the knowledge points in this area.
Internship
1. Morgan Stanley
The first interview was Morgan... The interviewer is very nice, and the main questions asked:
(1) Introduce the project and talk about the part you did (after the introduction, I realized that what I did was too low, and I still need to prepare)
(2) Polymorphism. In C++, virtual functions, rewriting virtual functions in derived classes, how do I know at runtime which subclass I am running in.
(3) What are the commonly used collections in java?
A: List, including ArrayList and LinkedList. ArrayList is implemented internally by arrays, which can change length. LinkedList is a linked list implementation and cannot be changed in length.
Q: Do you mean that you generally define the length of a LinkedList, say 10, and then exceed it?
A: No, it is not necessary to specify the length of the LinkedList, if it is not defined, it should be the machine that determines how much space your LinkedList can open up at most. I just add data to the extent I need.
Q: If there are many, many add operations, what problems will you encounter, it is impossible to add unlimited space for you
A: Yes... So there is a certain range, I think it should be determined by the machine how much space the maximum LinkedList can have, 32-bit and 64-bit machines should be different (Meng, actually I don't know)
Q: Well, are there any other collections you use regularly?
Answer: Set, mainly HashSet, TreeSet, LinkedHashSet, and then explain the differences between these three
Q: Analyze the complexity of HashSets and TreeSets, inserts, lookups, etc.
Answer: HashSet should be related to its hash, if it is just an ordinary hash code, it may cause a lot of conflicts, so that the linked list will be longer, and it will be slower to traverse the linked list when searching, but you use optimization methods to solve conflicts, such as secondary detection or something, reduce conflicts, it should be faster, the red and black tree used inside TreeSet, the order of search and insertion should be O(log(N))...
Then it's another question... I didn't ask any more.
|
|
Posted on 1/8/2019 10:16:23 AM
|
Landlord|
Posted on 1/9/2019 10:23:56 AM
|
。。
。。。