注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
补充发一个Tencent AI lab的面试,由于个人在国内学业gap 一年,所以投递了腾讯AI lab想去做一些深度学习方面的研究,想去那儿待一段时间学点东西,现在已经拿到offer
一轮:
问了很多关于深度学习的知识,比如detection 算法 SSD, FPN, YOLO 等等,还有一些比较基础的知识比如batch norm以及 drop-out,反正拼基本功吧.google и
二轮:
算法: Problem1: Given an array nums containing n + 1 integers where each integer is between
1 and n (inclusive), prove that at least one duplicate number must exist. Assume that
there is only one duplicate number, find the duplicate one.
Note:. check 1point3acres for more.
1. You must not modify the array (assume the array is read only).
2. You must use only constant, O(1) extra space.
3. Your runtime complexity should be less than O(n2).
4. There is only one duplicate number in the array, but it could be repeated more
than once
. Waral dи,
Problem2: Given an array of n integers where n > 1, nums, return an array output such
that output[i] is equal to the product of all the elements of nums except nums[i].
Solve it without division and in O(n).-baidu 1point3acres
For example, given [1,2,3,4], return [24,12,8,6].
. 1point3acres
第一题其实二分查找,time complexity O(Nlog(N)), 第二题leetcode热门题目直接秒掉就不说了
. 1point 3 acres
. 1point3acres
|