This article introducesClass of 2024 Fall RecruitmentMiddle.BOSS Direct Recruitment(used form a nominal expression)Recommendation/Search System Engineera jobone's whole faceThe interview basics, questions asked, etc.
2023surname Nian12month, in time for the end of the fall recruiting season, to pitch theBOSS Direct Recruitment(used form a nominal expression)Recommendation/Search System EngineerPosition and not sure of the department it is in. Finished one side so far, documenting the one side experience here.
First of all, this drop is on theBOSSDirect hire thisAPPThe direct delivery, did not take the official website delivery process; at this stage (the fall recruitment are coming to an end), and then go to the net application then I feel that the significance is not great, so generally is to look at theBOSSDirect hire on the right company, positionHRSend a resume invitation (probably because the user activity was very high when I was looking for an internship in the first place, so in theAPPIt's been going on for most of the year.HR(who sends out invitations), and will apply to move the process forward if there are relevant invitations and they feel like they can give it a try.
This interview is the same as the first interview of the fall recruitment (Baidu search machine learning, deep learning algorithm positions), is the algorithm direction of the interview, so you can obviously feel the interviewer for internship experience, project experience are not so much to ask questions, but directly on the algorithmic aspects of the content - of course, this is also related to the fact that I'm more biased towards the The interviewer mainly asked about algorithms, so it was obvious that the interviewer didn't ask much questions about internships and projects, but asked directly about algorithms. Most of the algorithmic questions asked by the interviewer were related to data structures, mainly focusing on optimizing the temporal and spatial performance of searching for data structure elements. Although I feel that the algorithm interview is really difficult, but I do feel that this kind of interview is very interesting, and I will rack my brain to recall what algorithmic ideas or optimization techniques were used in those highly praised solutions when I was brushing up on the problems - while if it is an interview in the direction of development, then the questions tend to focus on internships and project experiences, and I feel that I am about to memorize them. I feel like I'm about to memorize it, and it's not as interesting as the algorithmic interviews hahahaha. After an interview, I really gained a lot of new content and knowledge.
Interviews
-
morning
10:00kick off and continue25Minutes or so. -
online video interviews.
1Bit of an interviewer; the interviewer was very kind. -
Introduce yourself first; ask questions
25Minutes.
Question
- What kind of projects and internships did you have at the undergraduate and graduate level?
- What kind of projects do you work on with Aliyun at the graduate level? What type of project was it? What did you do in general?
- arrayscap (a poem)linked listWhat are the differences? What are the characteristics and advantages of each? What are the application scenarios of each?
- For aordered array, what is the lowest time complexity to find a certain value in it? What method is used to find it at this point? What is the minimum time complexity for aordered listAnd?
- insofar aslinked listHow to optimize the time complexity of a lookup of data in a For alinked list, which will have its value and position in the form ofhash tableform of saving, how exactly is this saving process implemented? What is the time complexity of this process?
- For an orderedlinked list, would like to speed up its lookup of values, what are some ways to optimize it?
- Do you understand."stopwatch"The concept?
- bothunordered array, how do you find the intersection of elements in both? What is the time complexity? Is it possible to optimize? You mentioned that the intersection of elements inhash tableto find it in, the time complexity of the search must always be
O(1)Is it? If these twoarraysOne or each of thearraysWhat about duplicate data in - How are hash conflicts resolved? What is the time complexity?
- Javarespond in singingC++What are the differences between thehash tablerelated data structures? What are their respective underlying implementations? Whyred and black treesHash tables can be implemented?
- Two disorganizedarraysHow to find duplicates in both (both in the array
Ain the arrayB(in) the elements? - An ordered single linked table
AContains100million nodes; wish to construct a new linked tableBSaved in sectionsAin some of the nodes, thus optimizing theAto find an element in a file; so what do you think of theBHow many nodes should be saved everyAthe nodes in the IfBSaved.10million nodes, then based onBfindAWhat is the average number of searches for any element in the - What are the individual's career expectations and plans?
topic of an algorithm
- None (in this case, topics without hand-tearing algorithmic code).
End-of-interview rhetorical questions
- Is knowledge of machine learning, deep learning algorithms required for this position?
- Is this position more focused on the development of algorithms (the math side) or the landing of algorithms (the development side)?
Feedback
- The interviews are over.
1Over a month and no response yet, it's definitely gone cold.
At this point, the job is done.