《数据科学面试40+真题讲解》,K神本年度最后一次开课


一亩三分地论坛

 找回密码
 Sign Up 注册获取更多干货
码农求职神器Triplebyte:
不用海投,内推你去多家公司面试
Airbnb 数据科学职位
in analytics and inference
天天打游戏、照样领工资,
你要不要来?
把贵司招聘信息放这里
查看: 3364|回复: 2
收起左侧

liveramp OA+面经!

[复制链接] |试试Instant~ |关注本帖
calvinhmw 发表于 2015-11-16 01:53:43 | 显示全部楼层 |阅读模式

2015(10-12月) 码农类 本科 实习@LiveRamp - 网上海投 - 技术电面 在线笔试 |Failfresh grad应届毕业生

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

您需要 登录 才可以下载或查看,没有帐号?Sign Up 注册获取更多干货

x

OA 第一题就是那个跳青蛙的问题。。要用dp 来做:
A small frog wants to get to the other side of a pond. The frog is initially located on
one bank of the pond (position 0) and wants to get to the other bank (position X).
The frog can jump any (integer) distance between 1 and D. If X > D then the frog. 鍥磋鎴戜滑@1point 3 acres
cannot jump right across the pond. Luckily, there are leaves falling from a tree onto
the surface of the pond, and the frog can jump onto and from the leaves.
You are given a zero-indexed array A consisting of N integers. This array represents
falling leaves. Initially there are no leaves. A[K] represents the position where a leaf
will fall in second K.. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
The goal is to find the earliest time when the frog can get to the other side of the 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
pond. The frog can jump from and to positions 0 and X (the banks of the pond) and. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
every position with a leaf.
For example, you are given integers X = 7, D = 3 and array A such that:.鐣欏璁哄潧-涓浜-涓夊垎鍦
A[1] = 3. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷

A[ 2] = 1

A[3] - 4

A[ 4] = 2. From 1point 3acres bbs

A[ 5] = 5
. 鍥磋鎴戜滑@1point 3 acres
Initially, the frog cannot jump across the pond in a single jump. However, in second
3, after a leaf falls at position 4, it becomes possible for the frog to cross. This is the
earliest moment when the frog can jump across the pond (by jumps of length 1, 3
and 3).
Write a function:

class Solution { public int solution(int[] A, int x, int D);

that, given a zero-indexed array A consisting of N integers, and integers X and D,
returns the earliest time when the frog can jump to the other side of the pond. If
the frog can leap across the pond in just one jump, the function should return 0. If-google 1point3acres
the frog can get to the other side of the pond just after the very first leaf falls, the
function should also return 0. If the frog is never able to jump to the other side of
the pond, the function should return -1.
For example, given integers X, D and array A as defined above, the function should
return 3 as explained above..鏈枃鍘熷垱鑷1point3acres璁哄潧
Assume that:
N is an integer within the range [0..100,000];
鏉ユ簮涓浜.涓夊垎鍦拌鍧.

第二题: what excites you about working at liveRamp?

.鏈枃鍘熷垱鑷1point3acres璁哄潧
第一轮电面. visit 1point3acres.com for more.
让我解释怎样找到shortest path from a source to a target in a graph. 不能coding。。要口头解释 。。所以跟他解释用bfs,把pseudo code 大概说了一遍

一周后收到reject.

sunnywrq 发表于 2016-1-20 02:15:58 | 显示全部楼层
求问:frog的那个题目中,N就是A的长度吧?因为我看有的面经中要求的solution为int solution(int A[], int N, int X, int D)
回复 支持 反对

使用道具 举报

doufu 发表于 2016-11-8 08:03:01 | 显示全部楼层
楼主,你的面试官是谁呀?
回复 支持 反对

使用道具 举报

本版积分规则

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明

custom counter

GMT+8, 2017-11-22 14:14

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

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