ThousandEyes is a network intelligence company that provides visibility into the digital experience by monitoring, analyzing and troubleshooting network performance. Its platform provides insights into the performance of applications and services across the Internet, cloud and enterprise networks. Today PROGRAMHELP is sharing ThousandEyes Interview experience.
Behavioral Question (BQ).
面试过程中强调了”critical feedback”和”dive deep”。面试官一再强调，他们期望候选人具备良好的协作能力，而不是在问题出现后独自行动。错误的叙述逻辑是：遇到问题、发现问题，然后独自解决而不与团队沟通。无论采取何种解决方案，都必须与团队讨论、让大家知晓并在事后进行总结。这一点是绝对不能忽视的。
Coding section:
Product Filter Design Questions
The interviewer asked to design a class that would be used to filter web products based on multiple criteria (e.g., category, price, and Prime eligibility).
题目中给出的示例是：过滤出类别为”Clothing > Women > Dresses”且价格不超过20美元的产品。
关键在于设计一个灵活的过滤机制，能根据多个搜索条件筛选数据。面试官建议在澄清需求时，询问多个过滤条件的组合逻辑，是”与”（AND）还是”或”（OR），这可以结合实际业务场景来确定。
Coding Topic 1: Word Ladder
Given two words (beginWord and endWord) and a dictionary of words, return the number of words in the shortest sequence of transitions from beginWord to endWord (or 0 if no transition sequence exists).
Although the question itself is categorized as Hard, because of its high frequency, common BFS can easily pass the question.
The difficulty lies in the follow-up part: BFS is prone to double loops and double counting when finding neighbors.
The interviewer suggested that we need to preprocess the words into several patterns, and then build a pattern map, so that finding neighbors based on patterns in BFS can greatly reduce the duplication of computation. The interviewer approved of this optimization idea, and the next question followed.
To summarize, the difficulty of this question lies in achieving the specific optimization method desired by the interviewer, and many candidates tend to stop after a simple BFS.
Coding Topic 2: Distance between two nodes in a tree
getAllAncestors- on the basis of
getAllAncestorsAccomplishfindLCA - Finally the distance between the two nodes is calculated using LCA
This is the simplified version of Binary Lifting, and while the questions themselves are more common, the requirements for solving them are more demanding than ever before.
Coding Topic 3: Chained List Representation of Digit Sums
Given two linked lists, each representing a number, the operation of addition is required to be performed on the two numbers. The question is given in a verbal form and no specific example is provided, so special attention needs to be paid to clarification in solving the question.
关键在于确认数字是以”most significant digit”（高位在前）还是”least significant digit”（低位在前）的顺序存储。面试官确认为”most significant digit”，因此有两种常见的处理方式：
- The first method uses two stacks, pressing the numbers in the chained table onto the stacks and then summing them sequentially;
- 第二种方法是编写反转函数，先反转链表，再按低位相加。
Note that at the end of the loop, make sure that both the chain list and the feed are processed.
Follow-up: How can an algorithm with space complexity O(1) be implemented if one of the input linked tables is allowed to be modified? The solution is to modify the shorter linked table in place and then add nodes if necessary, the process is similar to the previous idea, but instead of creating a new linked table, the result is to reuse the existing nodes.
Overall, this round of interviews was quite challenging in both the BQ section and the Coding section. the Coding questions were relatively high in difficulty, especially for the requirements of certain specific optimization solutions, which required candidates to have a certain degree of topic depth and real-world experience. Behavioral questions focus on teamwork and communication, and test the candidate's ability to adapt and reflect when facing problems.
After our powerfulInterview assistance, OA ghostwriting, candidates through these interview questions analysis and communication, the interviewer not only understand the candidate's programming ability, but also see my clear thinking and effective communication skills in the problem solving process. These not only help to deal with Thousand Eyes interviews, but also enhance our ability to solve practical programming problems. I wish you all good luck in your interviews!
