<
回复: 3
收起左侧

HRT Intern 新鲜OA

本楼:   👍  1
100%
0%
0   👎
全局:   16
89%
11%
2

2023(7-9月) 码农类General 本科 实习@hudson-river-trading - 网上海投 - 在线笔试  | 😐 Neutral 😣 HardOther | 其他

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看附件。没有帐号?注册账号

x
HRT的新鲜OA, 一共四道题,新人不知道怎么发附件或者图片,就把文字跟大家分享一下:


第一题:
The Fibonacci sequence is defined as follows:
f=1
f=1
fn = fn-1+ fn-2 for n > 2


The first few numbers of the sequence are:
1,1,2, 3,5, 8....
A Fibonacci number is any number found in this
sequence. Note that this definition does not consider
0 to be a Fibonacci number.
Given a list of numbers, determine if each number is
the sum of two Fibonacci numbers.
Example
Given an input of [2, 5, 17] , the function is
expected to return [true, true, false]. This is
because 1 + 1 = 2, 2 + 3 = 5 but there are no two
Fibonacci numbers that sum to 17.
• [execution time limit] 1 seconds (cpp)
• [input] array.integer64 a
A list of numbers which we want to query. The
length is guaranteed to be less than 5000.
1 ≤ a; $ 1018
• [output] array.boolean
List of booleans, b, where each element b;
corresponds to the answer to query a;

第二题:
You are given a data.csv file in the /root/customers/ directory
containing information about your customers.
It has the following columns:




ID, NAME, CITY, COUNTRY, PERSON, EMPLCNT, CONTRCNT, CONTRCOST
where
ID: Unique id of the customer
NAME: Official customer company name
CITY: Location city name
COUNTRY: Location country name
PERSON: Email of the customer company contact person
EMPLCNT: Customer company employees number
CONTRCNT: Number of contracts signed with the customer
CONTRCOST: Total amount of money paid by customer (float in
Read and analyze the data.cv file, and output the answers to these
questions:
• How many total customers are in this data set?
How
您好!
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式
游客,您好!
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限查看其他获取积分的方式
ctangular-prism.
Given a list of 4 ≤ N ≤ 1000 points on a Cartesian Plane, count the number of rectangles
such that all 4 corners of the rectangle lie on the points.
All points will have integer values for 2 and y, and no point will be repeated. Each point satisfies
-100000 ≤ xi, yi ≤ 100000.
Note: the rectangle does not need to be axis aligned.

新手小白积分不够,不能在自己的帖子下面回复评论,还请好人加点米,希望能早日看到面经~
祝大家拿到很多很多offer!!!

评分

参与人数 7大米 +31 收起 理由
ai_xiaohai + 1 很有用的信息!
bryanjhy + 25 给你点个赞!
llucifer + 1 很有用的信息!
Calvin_Pang + 1 给你点个赞!
ptnnac + 1 很有用的信息!

查看全部评分


上一篇:Amazon intern OA
下一篇:加拿大Amazon NG面试完一周无回复
hji 2022-9-9 14:35:31 | 显示全部楼层
本楼:   👍  0
0%
0%
0   👎
全局:   6
100%
0%
0
楼主是普通sde还是algo呀
回复

使用道具 举报

llucifer 2022-9-9 21:59:32 | 显示全部楼层
本楼:   👍  0
0%
0%
0   👎
全局:   50
96%
4%
2
我申了Full time,拿到了一样的题
回复

使用道具 举报

tinalee2009416 2022-9-25 11:52:40 | 显示全部楼层
本楼:   👍  0
0%
0%
0   👎
全局:   0
0%
0%
0
hji 发表于 2022-9-9 02:35
楼主是普通sde还是algo呀

我投的Algo岗,和楼主的题目一样的
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册账号
隐私提醒:
  • ☑ 禁止发布广告,拉群,贴个人联系方式:找人请去🔗同学同事飞友,拉群请去🔗拉群结伴,广告请去🔗跳蚤市场,和 🔗租房广告|找室友
  • ☑ 论坛内容在发帖 30 分钟内可以编辑,过后则不能删帖。为防止被骚扰甚至人肉,不要公开留微信等联系方式,如有需求请以论坛私信方式发送。
  • ☑ 干货版块可免费使用 🔗超级匿名:面经(美国面经、中国面经、数科面经、PM面经),抖包袱(美国、中国)和录取汇报、定位选校版
  • ☑ 查阅全站 🔗各种匿名方法

本版积分规则

Advertisement
>
快速回复 返回顶部 返回列表