每日一练 | Data Scientist & Business Analyst & Leetcode 面试题 298

大数据应用 · 公众号 · 大数据 · 2018-02-21 10:52

正文

自2017年6月15日起，数据应用学院与你一起温习数据科学（DS）和商业分析（BA）领域常见的面试问题。从2017年10月4号起，每天再为大家分享一道Leetcode算法题。

希望积极寻求相关领域工作的你每天关注我们的问题并且与我们一起思考，我们将会在第二天给出答案。

Day 198

DS Interview Questions

How would you create a taxonomy to identify key customer trends in unstructured data?

BA Interview Questions

R language:

Use the ‘rivers’ dataset to write a for loop. The loop prints the dataset:

rivers shorter than 500 are a ‘short river’;

rivers longer than 2000 are a ‘long river’;

and rivers in the middle range are printed in their original numbers.

LeetCode Questions

Description:

Write a program to find the node at which the intersection of two singly linked lists begins.

Input:

A: a1 → a2

↘

c1 → c2 → c3

↗

B: b1 → b2 → b3

Output: c1

Assumptions:

The array may contain duplicates.

欲知答案如何？请见下期分解！

Day 197 答案揭晓

DS Interview Questions

What is the function of activation function in ANN?

To add the non-linear factor into the model.

BA Interview Questions

R language:

Get 1000 simulations of a paired dice game.

A game immediately stops if you have an initial total (2 dice) of 5,6,7,8,9.

If the first cast does not meet those 5 totals you would continue until you get either 11 or 12.

What is the average number of dice casts per game?

sum=0

for(i in 1:1000){

times1=1

if(sum(sample(d,2,replace = T)) %in% c(5,6,7,8,9)){}

else{

while(!(sum(sample(d,2,replace = T)) %in% c(11,12))){times1=times1+1}

}

sum=sum+times1

}

avg=sum/1000;avg

Leetcode Questions

Description:

Follow up for “Find Minimum in Rotated Sorted Array”:
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
Find the minimum element.