OA for Staff Software Engineer

Sharing my recent experience with C1. Applied for a Staff Engineer role, did the OA, but got an email a week later that business nedds changed and they are not hiring anymore.

Questions:

Python Coding Interview Questions

Question 1: Evaluate Arithmetic Equations

Problem statement

You are given four arrays: a, b, c, and signs. Each element in signs is either "+" or "-".

For each corresponding set of elements a[i], b[i], and c[i], evaluate the equation a[i] + b[i] == c[i] if the sign is "+", or a[i] - b[i] == c[i] if the sign is "-".

Return a Boolean array res, where each element indicates whether the corresponding equation is true or false.

Example

Input:

1. a = [1, 5, 10]b = [2, 3, 4]c = [3, 2, 14]signs = ["+", "-", "+"]

复制代码

Output:

1. [True, True, True]

复制代码

Solution

1. def check_equations(a, b, c, signs):    res = []    for x, y, z, sign in zip(a, b, c, signs):        if sign == "+":            res.append(x + y == z)        elif sign == "-":            res.append(x - y == z)        else:            raise ValueError(f"Invalid sign: {sign}")    return res

复制代码

Question 2: Find the Branch with the Most Files

Problem statement

You are given a list of log entries representing operations on different branches of a version control system.

Each log entry is one of the following:

• "switch branch": Switch to the specified branch.
  
• "push filename": Add a file to the currently selected branch.
  

Process all log entr

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

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

of distinct values stored in the frequency dictionary.


Important correction for Question 4

The original removal logic needs an adjustment: multiplying contribution by the number of occurrences k can overcount triplets when multiple copies of x exist, because triplets containing two occurrences of x are not possible when diff > 0, but the neighboring frequency calculations can still be affected by the removal order if not handled carefully.

For the stated arithmetic-triplet definition and diff > 0, the provided incremental formula is valid: each triplet contains at most one occurrence of any particular value, so removing all k copies subtracts exactly k times the contribution from one occurrence.