西三诶哎 FDE NG OA

3道选择题，2道coding，hackerrank不开摄像头，求大米！
选择题

• Time Complexity for (int i = 0; i < n; i++) { for (int j = 0; j < i
• i; j++) { for (int k = i; ~k; k -= 1) { temp++; } } }
• Hash There are 7 computers in a network (numbered from 0 to 6). Each network request is assigned to one of those computers. Hash function used for that is: H(id) = id % 7 Which computer will have maximum load if the request ids are...
• A retrieval augmented generation, i.e., RAG-based chatbot, assists doctors in diagnosing rare diseases. Factual accuracy and consistency are paramount, but traditional RAG metrics like signal-to-noise ratio and recall might be insufficient. Which two of the following approaches best address the challenges in evalu
  您好！
  本帖隐藏的内容需要积分高于 188 才可浏览
  您当前积分为 0。
  使用VIP即刻解锁阅读权限或查看其他获取积分的方式

  游客，您好！
  本帖隐藏的内容需要积分高于 188 才可浏览
  您当前积分为 0。
  VIP即刻解锁阅读权限 或 查看其他获取积分的方式
  Unlock interview details and practice with AI
  Curated Interview Questions from Top Companies
  
  denotes the value assigned to node i.
  int k: the maximum number of arms in a star we are looking for.
  
  Constraints
  2 ≤ g_nodes ≤ 10^5
  1 ≤ g_edges ≤ 10^5
  0 ≤ g_from, g_to ≤ n - 1
  0 ≤ k ≤ 10^5
  -10^3 ≤ values[i] ≤ 10^3, where 0 ≤ i < g_nodes
  The graph does not contain any self-loops.
  The graph contains at most a single edge between a pair of vertices.
  
  5.忘记了，但非常简单，本质上是在规定时间内检测duplicate message然后drop