Akuna Capital数据相关面经_Akuna Capital数据相关面试真题及高频题

1.Interview Questions for Data/Statistics/Mathematics Positions

2.Coding Interview Questions. Coding Interview Questions

3.Understanding Distributed Systems Computing

4.Match Evaluation.

5.Substring Digit Sum Divisible by Length & Array Element Digit Sum

6.Implementing an LRU Cache in Python

7.Titles for the interview questions

8.Find N Smallest Even Integers with Start Integer

9.Data Cleaning for a Dataframe with Two Columns

10.Triangle Inclusion Test: Determining Point Placement.

11.Oscillating String Sorting Algorithm

12.Technical Project Introduction, Derivative Calculation, Eigenvalue of 3x3 Matrix, Join Distribution Probability, Intersection Dimension of Subspaces, Linear Regression Coefficient Range.

13.Title: Finding the Derivative of x^x.

14.1. Comparing String Arrays with Occurrence Counts2. Deactivating Generators with Minimum Models3. Earliest Possible Processing Time in Computing Cluster

15.1. Subsequence Partitioning 2. Autoscale Policy Implementation 3. Parallel Task Processing Time Optimization

16.Movie Ratings

17.Maximum Distinct Elements

18.Profitable Project Pairs

19.Count of Numbers with Odd Number of Divisors from 1 to 100

20.Expected Number of Throws Until Sum Is Divisible by Three

21.Expected Number of Throws to Get 'HH'

22.Properties of OLS When R2 Equals Zero

23.Calculating Correlation

24.Rolling Window Average Calculation

25.Calculate Optimal Threshold

26.Expected Number of Empty Boxes

27.Probability of Independent Events

28.Markov Chain Ergodicity

29.Linear Regression Problem

30.Steady-State Markov Chain Problem

31.Expected Value of Z=X+Y Given Generating Functions

32.Inversion Count

33.MySQL: Substring Function

34.3s Wild Card Game

35.Sort Regnal Names

36.Playing the Markets

37.Inversion Count

38.Combinations of Market Making Teams

39.Sum of Numbers Excluding Digits 7 and 8

40.Expected Number of Coin Tosses to Get Two Consecutive Heads

41.Laser Grid

42.Document Chunking

43.Frequency Sort

44.Stock Transactions Profit Calculation

45.Sorting Monarchs by Name and Reign

46.Card Game Scoring Algorithm

47.Extraordinary Substrings

48.Block Dropping Probability

49.Coin Flip Game Valuation

50.Interpreting Linear Regression Model Results

51.Expected Value of the Square of a Sum of Random Variables

52.Expected Probability of Getting Wet

53.Expected Number of Flips to Get Two Heads in a Row

54.Poisson Distribution

55.Linear Regression Concept

56.Expectation Value of Tossing a Fair Coin

57.Substring Division by Key Press Sum

58.Sort Array by Frequency and Value

59.Calculating Profit/Loss from Betting on Letter Pairs

60.Extraordinary Substrings

61.Frequency Sort

1. Interview Questions for Data/Statistics/Mathematics Positions

What was your biggest project and what were the challenges? How did you tackle them?

Is X+Y a normal distribution? Are X+Y and X-Y independent? Is E(X^2Y^2) = 1? Is E(X^2/Y^2) = 1?

If a and b are n x n matrices, does tr(AB) = tr(BA) and det(AB) = det(BA)? What are some other matrix properties such as rank?

If X and Y are standard normal distributions, what is the probability that the middle number is less than 2/3?

How many numbers exist between 1 and 5050 that do not contain the digits 7 or 8?

Note: Some irrelevant information and incomplete sentences have been removed.

2. Coding Interview Questions. Coding Interview Questions

1. Given the initial setup of a match between two players, evaluate the match's outcome for n rounds. Each round, a player removes the first number from the sequence and adds its value to their score. After that, if the removed number is even, the remaining sequence is reversed. Determine the difference in scores between the two players after the game.

2. Find a substring of a given string consisting of '0's and '1's such that the number of '1's in the substring is equal to a given integer k, the substring has the smallest length, and it is lexicographically smallest.

3. Form a special sequence using words and numbers based on certain rules and find the value in the sequence at a given position. Return the sum of the digits of the value.

Note: Separate each question with "

3. Understanding Distributed Systems Computing

1. What is Distributed Systems Computing?

2. What is AWS?

3. What are some Protein/ DNA related questions?

4. What is Sequential data?

4. Match Evaluation.

Match Outcomes. Given the initial setup of a match between two players, evaluate the match's outcome. There are two players, and there is a number sequence of size n. The first player picks the first number from the sequence and adds its value to their store. Players alternate turns for a round. Each round, a player removes the first number from the sequence and adds its value to their store. After that, if the removed number is even, the remaining sequence is reversed. Determine the difference in scores between the two players after the game.

K Smallest Substring. There is a string input, consisting of characters '0' and '1' and an integer k. Find a substring of string input_str such that the number of '1's is equal to k, it has the smallest length and it is lexicographically smallest. It is guaranteed that the answer always exists.

Document Chunking. Not enough information provided.

Note: The last question was not included in the raw text provided.

5. Substring Digit Sum Divisible by Length & Array Element Digit Sum

Input: a string: output:所有substring中，求每个字符对应电话本数码 (类似拨号键盘

那个页面，ABC对应1，DEF对应2等等）之和可以整除该substring长度的substring数量

Input:一个int array，output:以input中元素为index的数字各数位之和如:input 1，4 (则数字为1，1211),output: 1，5