Bloomberg数据相关面经_Bloomberg数据相关面试真题及高频题

1.String Structure, Duplicate Finder, Light Switch Puzzle, Optimizing Fibonacci, Array Walk Circle Check

2.Your Top Proficient Programming Language?

3.Machine Learning Projects: Models Used and Problem-Solving Strategies

4.Calculating Sum and Storing in New Linked List.

5.Boosting vs. Random Forest: Superiority and Impact on Data

6.When to Use ROC vs PR Curves: Examples.

7.Non-zero Eigenvalues in Covariance Matrix of Large Dataset

8.Solving Matrix Factorization for Sparse and Dense Data

9.Interview Questions for Financial Engineer and Senior Application Developer.

10.Converting Numbers with Consecutive Digits

11.Detecting Invalid Transactions

12.Three Metrics for Evaluating Companies

13.Move Ones to Left in Zero-One Array

14.Interview QuestionsClass Imbalance and Ensemble MethodsFirst Non-repeating Alphabet Problem: Optimization and OO AnalysisMagic Numbers: Generation, Optimization, and Density

15.航班加进系统

16.Add route

17.数据结构设计

18.Calculate the average time spent by commuters in a subway system.

19.Visualization Experience and Best Practices

20.Machine Learning Model for Prospecting

21.Python (Pandas) Skills Assessment

22.SQL Skills Assessment

23.Designing an A/B Testing Framework

24.Data Processing with Pandas

25.Minimum Coin Change Combination

1. String Structure, Duplicate Finder, Light Switch Puzzle, Optimizing Fibonacci, Array Walk Circle Check

What does a string look like in c? i.e. data structure.

Given a string, find the first duplicate character in this string.

100 light bubbles, could be switched to on or off. The initial status is all off. The first round, switch every bubble, the second round, switch every two bubble, .....comes to the 100 round. Question: how to implement this process. Follow up: at the end, what bubbles are on.

Fibonacci series. Find f(n). If using recursive, how to optimize it.

Given an array, like [3,7,1,-2,4,5]. Initially at the A[0], the walk for A[i] steps, if positive, walk toward to right, if negative, walk toward to left. Determine whether it is a complete circle. Definition of complete circle: a. able to return to Arol. b.every point is visited. How to implement this, and what's the time complexity. Definition of complete circle: a. able to return to Ajol. b.every point is visited.

2. Your Top Proficient Programming Language?

What is the programming language that you have the most proficiency?

3. Machine Learning Projects: Models Used and Problem-Solving Strategies

What are one to two ML projects that you worked on? What models did you use? What problems did you encounter and how did you solve them?

4. Calculating Sum and Storing in New Linked List.

For a given single linked list of integers, how would you find the sum of the list and store the result in a new single linked list?

5. Boosting vs. Random Forest: Superiority and Impact on Data

为什么boosting结果比randomforest好，对什么样的数据结果提升更明显。