C3.ai DS OA

面试一共8道选择题+1 道 code题
code：
Convert production schedule:
A factory production schedule is expressed as k1[S1]k2[S2]S3 as a compact way for representing repeat S1 production pattern for k1 times and then S2 pattern for k2 times, where S1, S2, and S3 may also be expressed using this compressed schedule representation. For an easier understanding of what will be produced on each timestamp, we need to decompress the schedule in this compressed format, can you write a function for the decompression? For example 3[A]2[3[B]]C

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

classification problem in which the response is sampled from a non-linear complex function, which of the following algorithms has the potential to perform the best?
Logistic Regression
K-nearest neighbors
Linear Discriminant Analysis
Quadratic Discriminant Analysis
8. 32张牌选2个花色