<iframe src="https://www.googletagmanager.com/ns.html?id=GTM-KVGHS6G" height="0" width="0" style="display:none;visibility:hidden"></iframe>

Hudson River Trading计算机科学面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
面试题
全部(6)
OOD(0)
Algorithm(5)
System Design(0)
高频题(0)
Math(1)
全部(6)
OOD(0)
Algorithm(5)
System Design(0)
高频题(0)
Math(1)
1.Eigenvectors and Eigenvalues of a Matrix
2.Sorting a Deviated Sequence
3.Nested List to Binary Tree Conversion and Merging
4.Black and White Chess
5.Fancy Number
6.Optimal Strategy for a Word Guessing Game
1. Eigenvectors and Eigenvalues of a Matrix
Find the eigenvectors and eigenvalues of an n*n matrix with n on the diagonal and ones on every other entry.
2. Sorting a Deviated Sequence
Given a sorted sequence of length n where each element's position deviates by at most k (with k < n), suggest an algorithm to sort the sequence.
3. Nested List to Binary Tree Conversion and Merging
The first part of the question involves pre-order traversal of a binary tree. The second part is similar to LeetCode problem 617, 'Merge Two Binary Trees'. The challenge here is that you are not given a root node or a node definition, but rather a nested list that you need to convert into a tree structure before proceeding.
4. Black and White Chess
Given a series of moves for both players in a game of black and white chess, return the number of black and white pieces on the board.
5. Fancy Number
Given a number n, return all the numbers in the open interval (0, n) that, when converted to base-4, consist only of the digits 0 and 1.