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

大数据 53 Views

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

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

Day 117

DS Interview Questions

What is sampling? How many sampling methods?

BA Interview Questions

SQL Interview questions practices: Imagine we have two tables names ‘employees’ and ‘projects’, write a query to find out employee name and project name who has assigned more than one project.

Leetcode Questions

Longest Substring Without Repeating Characters

Description:

Given a string, find the length of the longest substring without repeating characters.

Input: “abcabcbb”

Output: 3

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

Day 116 答案揭晓

DS Interview Questions

What is difference between Bayesian and Frequentist?

Bayesians condition on the data actually observed and consider the probability distribution on the hypotheses;

Frequentists condition on a hypothesis of choice and consider the probability distribution on the data, whether observed or not.

BA Interview Questions

R programming: How do you evaluate the logistic regression? Name the principle of the likelihood ratio test.

A logistic regression is said to provide a better fit to the data if it demonstrates an improvement over a model with fewer predictors. This is performed using the likelihood ratio test, which compares the likelihood of the data under the full model against the likelihood of the data under a model with fewer predictors. Removing predictor variables from a model will almost always make the model fit less well (i.e. a model will have a lower log likelihood), but it is necessary to test whether the observed difference in model fit is statistically significant.

Leetcode Questions

Add Two Linked Lists

Description:

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Tips:

使用dummy node

处理到所有case:

l1 或 l2 位 null

l1 l2长度相等

l1 长于 l2

l2 长于 l1

答案需要进位

Code: 

时间复杂度:O(max(m,n))

空间复杂度:O(1)

点击“阅读原文”查看数据应用学院核心课程

如未说明则本站原创,转载请注明出处:NULL » 每日一练 | Data Scientist & Business Analyst & Leetcode 面试题 217