每日一练 | Data Scientist amp; Business Analyst amp; Leetcode 面试题 1511

1年前 (2022-11-12)阅读2回复1
dyyh
dyyh
  • 总版主
  • 注册排名7
  • 经验值289070
  • 级别网站编辑
  • 主题57814
  • 回复0
楼主

点击上方 蓝字 会变美

Nov.

12

Data Application Lab 自2017年6月15日起,天天和你分享讨论一道数据科学(DS)和贸易阐发(BA) 范畴常见的面试问题。

自2017年10月4日起,天天再为各人分享一道Leetcode 算法题。

期看积极逃求相关范畴工做的你天天存眷我们的问题而且与我们一路试探,我们将会在第二天给出谜底。

Day

1409

DS Interview Question

What do you understand by statistical power of sensitivity and how do you calculate it?

BA Interview Question

table: patient (pt)

table: Undergoes (u)

table: physician (p)

LeetCode Question

same tree

Deion:

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

Input: 两颗树不异

Output: true

Day

1411

谜底揭晓

DS Interview Question Answer

Why data cleaning plays a vital role in analysis?

Cleaning data from multiple sources to transform it into a format that data analysts or data scientists can work with is a cumbersome process because - as the number of data sources increases, the time take to clean the data increases exponentially due to the number of sources and the volume of data generated in these sources. It might take up to 80% of the time for just cleaning data making it a critical part of analysis task.

BA Interview Question Answer

Write a query in SQL to Obtain the names of all patients who has been prescribed some medication by his/her physician who has carried out primary care and the name of that physician.

table: patient

Answer:

SELECT pt.name AS "Patient",

p.name AS "Physician"

FROM patient pt

JOIN prescribes pr ON pr.patient=pt.ssn

JOIN physician p ON pt.pcp=p.employeeid

WHERE pt.pcp=pr.physician

AND pt.pcp=p.employeeid;

LeetCode Question Answer

linked list partition

每日一练 | Data Scientist amp; Business Analyst amp; Leetcode 面试题 1511

Deion:

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

You should preserve the original relative order of the nodes in each of the two partitions.

Input: 1-4-3-2-5-2 and x = 3

Output: 1-2-2-4-3-5

Time Complexity: O( n)

Space Complexity: O(1)

数据的特征抉择手艺

图片竟能酿成3D视频?!—— Meta与Google的AI竞赛正在展开...

数据科学10大Python库

Google BigLake是Snowflake、Redshift Co.的杀手吗?

若何为你的数据可视化找到准确的色板?

点「在看」的人都变都雅了哦

0
回帖

每日一练 | Data Scientist amp; Business Analyst amp; Leetcode 面试题 1511 相关回复(1)

青烟
青烟
沙发
很赞!在商业分析的深度上做了全面展现,希望后面问题更有挑战性。
1周前 (12-26 20:32)回复00
取消