c1 capital one OA codesignal, 2025/Jan

• given a list of int, return number of int where: (1) contain at least two '7' (3) can be divided by 3; e.g., 777 or 771
• give a text (a list of strings/lines), output the branch name with most unique files (guarantee no tie)
  for example,
  switch branch1
  push file1
  push file2
  switch branch 2
  push file1
  push file2
  ==> parse the text, dict {branch_name:  a set of unique file names}
• input a 2D matrix of a terrain, and a starting coordinate (row idx, col idx) of water to flood the area, output a matrix of same size. of the "time" when each spot get wet.
  ==> BFS, layer by layer diffuse out, time++ in the while loop, dedup the BFS queue
• 我只做出N^2暴力解 跪求更快的解法 maybe sort then sweep line??!!
  In a distant universe, there exists a planet entirely covered in crystals with vibrant energy. These crystals can communicate among themselves, but their
  您好！
  本帖隐藏的内容需要积分高于 188 才可浏览
  您当前积分为 0。
  使用VIP即刻解锁阅读权限或查看其他获取积分的方式

  游客，您好！
  本帖隐藏的内容需要积分高于 188 才可浏览
  您当前积分为 0。
  VIP即刻解锁阅读权限 或 查看其他获取积分的方式
  Unlock interview details and practice with AI
  Curated Interview Questions from Top Companies
  
  nting coordinates of the crystals. It is guaranteed that:
  Guaranteed constraints:
  1. 1 ≤ centers.length ≤ 4⋅10

  复制代码
  1. 4

  复制代码
  ,
  1. centers[i].length = 2

  复制代码
  ,
  1. -10

  复制代码
  1. 5

  复制代码
  1. ≤ centers[i][j] ≤ 10

  复制代码
  1. 5

  复制代码
  .
• • The maximum absolute value of coordinates is
    1. 10

    复制代码
    1. 4

    复制代码
    .
  • The number of crystals does not exceed
    1. 4⋅10

    复制代码
    1. 4

    复制代码
    .
  • Different crystals may occupy the same coordinates.
• [output] integer
  The number of intersecting crystal pairs.

根据各点的地址，创建一个[Max(x),Max(y)]的2D array，fill（0）。每个点在2dArray[x,y]上+1。然后按照二楼的思路，每个点周围25个candidate检查一遍，得到临近点的个数。所有点都查找完后总数/2。就是O(25N)了。不过这样空间占用大

最后一题直接从答案入手就行吧。。。
对于(x, y)，直接从(x-2, y-2) check 到(x+2, y+2)，一共有25个candidate。。。
这样就是 O(25N) ~ O(N)

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

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

Was this for SDE intern role?