专栏名称: 大数据应用
数据应用学院被评为2016北美Top Data Camp, 是最专业一站式数据科学咨询服务机构,你的数据科学求职咨询专家!
目录
相关文章推荐
网信内蒙古  ·  关于发布2025年第一批数据领域国家标准需求的通知 ·  5 小时前  
网信内蒙古  ·  关于发布2025年第一批数据领域国家标准需求的通知 ·  5 小时前  
数据派THU  ·  清华团队 AI ... ·  9 小时前  
CDA数据分析师  ·  Deepseek教我自学Python,貌似3 ... ·  昨天  
CDA数据分析师  ·  用Deepseek处理复杂数据效果好吗?小白 ... ·  昨天  
大数据文摘  ·  历史性一刻!顶级域名ai.com重定向到De ... ·  3 天前  
51好读  ›  专栏  ›  大数据应用

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

大数据应用  · 公众号  · 大数据  · 2018-03-29 08:34

正文

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


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


Day 223


DS Interview Questions

What’s the difference between a generative and discriminative model?


BA Interview Questions

What is the meaning of ‘lifetime value’ (LTV)? What LTV can tell you?


LeetCode Questions

    • Description:

      • Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.

      • Your algorithm’s runtime complexity must be in the order of O(log n).

    • Input: [5, 7, 7, 8, 8, 10] and target value 8

    • Output: [3, 4]

    • Assumptions:

      • If the target is not found in the array, return [-1, -1]


欲知答案如何?请见下期分解!



Day 222 答案揭晓


DS Interview Questions

Why is “Naive” Bayes naive?

Naive Bayes is considered “Naive” because it makes an assumption which is virtually impossible to see in real-life data: the conditional probability is calculated as the pure product of the individual probabilities of components. This implies the absolute independence of features — a condition probably never met in real life.

Reference: https://www.quora.com/Why-is-naive-Bayes-naive?share=1


BA Interview Questions

SQL: Query the list of CITY names ending with vowels (a, e, i, o, u) from STATION. Your result cannot contain duplicates.

The STATION table is described as follows:

Answer:

SELECT DISTINCT

city

FROM

station

WHERE

city

REGEXP

'[aeiou]$';


LeetCode Questions

  • Description:

    • 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).







请到「今天看啥」查看全文