citadel oa 总结

总结了一下citadel 的oa题目，我抽到的题都在期中，求加米！
1. Sprint Training (力口伞气领)**

Imagine there are n points along a straight trail, while a runner run sprints of intervals between those point.The training plan is an array a[], which implies the runner should run from point a to point a[i+1].

`For example, given n = 10, a = [2, 4, 1, 2].
The runner should run from point 2 to point 4,
then turn back from point 4 to point 1,
and then from point 1 to point 2.`

Find the point that visited the most by runner after he finished training, i.e. in above example, point 2 is the most visited.If more than one point are visited the most, find the point with minimum index.

2. visiting cities
[img]https://s3.us-west-2.amazonaws.com/secure.notion-static.com/1c4b4d42-1370-4352-8d33-c5d6bfd068c3/Untitled.png?X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Credential=AKIAT73L2G45EIPT3X45%2F20220904%2Fus-

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

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

**So you need to compute the odd count**
even ^ any number  = even
odd ^ any number =odd
even * even = even
odd * odd = odd
5. Shrink Number Line (俐抠久要林)
6. Subarray sum divisible by k(俐抠久起司)
7. longest subarray with sum <= k 滑动窗口
8. Do the belong
Given three corner points of a triangle, and one more point P. Write a function to check whether P lies within the triangle or not.
For example, consider the following program, the function should return true for P(10, 15) and false for P'(30, 15)[/i]

omg多谢！

2的图好像挂了，可以重新上传一下吗

得得Pen 发表于 2022-9-9 19:23
2的图好像挂了，可以重新上传一下吗

已发，你看看能不能看到

话说直接发利口题号会被封杀吗2333