推荐:数据科学课程和书籍清单以及培训讲座


一亩三分地论坛

 找回密码
 获取更多干活,快来注册

一亩三分地官方iOS手机应用下载
查看: 3582|回复: 1
收起左侧

整理一下facebook见过的面经

[复制链接] |试试Instant~ |关注本帖
NeptuneFrank 发表于 2015-10-19 03:35:29 | 显示全部楼层 |阅读模式

2015(1-3月) 码农类 硕士 全职@Facebook - 内推 - 技术电面 |Pass在职跳槽

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

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

x

1.+2 3 sum


2. Given set of points in 2d grid space. Find a grid point such that sum
of distance from all the points to this common point is minimum.. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴

3. Print a binary tree by vertical level order

4. Calculate the average of each level of a tree.
. visit 1point3acres.com for more.
5. how do you find the lowest common ancestor of two nodes in a binary tree

6. ??
1--a
2--b
...
26--z
given a digit , return the count of the possible output
eg. '1313' --- 4
acac mac mm acm 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
'101' --1
ja
cannot discard any digit .



7.Given a matrix, calculate the sum of a sub matrix given the start and end indices of the sub matrix (do dynamical programming on this)

8. sort 3 color in array (use self-over writing with two ends.).. Waral 鍗氬鏈夋洿澶氭枃绔,


9.+1 implement sqrt() with integer (use Binary Search.)

10. find if one string is one edit distance away from the other string (check all possible cases)

. more info on 1point3acres.com11. get the n-th Fibonacci number

12. find the depth of a binary tree,

. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
13. merge two arrays, A + B -> A ( do it in-place, i feel. Why do not you merge sorted arrays from their largest element? (from max instead? very good question)). 1point3acres.com/bbs


14. Check to see if one array is a subset of another.. Waral 鍗氬鏈夋洿澶氭枃绔,

15. balance trees with weight???
. Waral 鍗氬鏈夋洿澶氭枃绔,
16. add binary(leetcode). 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
.1point3acres缃
17.+1 binary tree print all paths from root to leef
How to do it iteratively? 用一个stack实现preorder来做?

/*
Given a binary tree, print out all of its root-to-leaf
paths, one per line. Uses a recursive helper to do the work.
*/
void printPaths(struct node* node) {
  int path[1000];
  printPathsRecur(node, path, 0);
}
. visit 1point3acres.com for more.
/*
Recursive helper function -- given a node, and an array containing. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
the path from the root node up to but not including this node,. 鍥磋鎴戜滑@1point 3 acres
print out all the root-leaf paths.
*/
void printPathsRecur(struct node* node, int path[], int pathLen) {
  if (node==NULL) return;

  // append this node to the path array.1point3acres缃
  path[pathLen] = node->data;
  pathLen++;

  // it's a leaf, so print the path that led to here. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴
  if (node->left==NULL && node->right==NULL) { 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
    printArray(path, pathLen);
  }
  else {
  // otherwise try both subtrees
    printPathsRecur(node->left, path, pathLen);
    printPathsRecur(node->right, path, pathLen);. 1point 3acres 璁哄潧
  }
}

// Utility that prints out an array on a line.
void printArray(int ints[], int len) {
  int i;
  for (i=0; i<len; i++) {
    printf("%d ", ints);
  }. visit 1point3acres.com for more.
  printf("\n");
}


. 1point 3acres 璁哄潧18. clone graph

.1point3acres缃19. count and say(leetcode)
. From 1point 3acres bbs
20. Divide without division


21. Big Integer multiplication. (optimization required, how to do 8 digits*8 digits, etc).

. visit 1point3acres.com for more.
. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
23.+1 Push all the zero's of a given array to the end of the array. In place only. Ex 1,2,0,4,0,0,8 becomes 1,2,4,8,0,0,0
鏉ユ簮涓浜.涓夊垎鍦拌鍧.

24. You're given an array of integers(eg [3,4,7,1,2,9,8]) Find the index of values that satisfy A+B = C + D, where A,B,C & D are integers values in the array.
-google 1point3acres
Eg: Given [3,4,7,1,2,9,8] array
The following
3+7 = 1+ 9 satisfies A+B=C+D
so print (0,2,3,5)
. 1point3acres.com/bbs

25. Find intersection of 2 sorted arrays.



.鏈枃鍘熷垱鑷1point3acres璁哄潧


评分

3

查看全部评分

本帖被以下淘专辑推荐:

 楼主| NeptuneFrank 发表于 2015-10-19 03:36:05 | 显示全部楼层
关注一亩三分地公众号:
Warald_一亩三分地
highlight的是见过多次的
回复 支持 反对

使用道具 举报

本版积分规则

关闭

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

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

custom counter

GMT+8, 2017-7-26 05:21

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

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