pocket gem onsite

原帖地址:一亩三分地

onsite 的题目和大家差不多,具体可以看下我的面经合集, 这里就使用下别人的叙述,感谢各位大神的分享,一下题目描述为转载,作者君如果看到了,可以和我留言,我去给加分。有些follow up是之前没有看到的,我写在后面
1. 转载:“别名叫做机器人在2D平面坐标走路(警告:会问的非常深入). more info on 1point3acres.com
大概题目就是给你一个K,如果坐标digit的sum不超过k,那么就是valid的点,负数一律按照绝对值处理”
2,Input String[] array = {“ab, bc, bz”} Output “abcz”-google 1point3acres
Input String[] array = {“fbz, jb, ebj”} Output “efbjz” 要满足三个条件: 1. Output unique character 2. output的string里,character相对顺序不变。Input不会有“bc ”,“cb”这种情况出现 3.满足以上两个条件,按照lexicographical order, 输出最小的可能性. follow up: how to detect invalidate input? this means how to detect cycle in direct graph
3. 转载:“有player, achievement, requirement, reward几个class需要设计,要求如下
代码要求简单,易读添加新的成就,不用修改代码添加新的属性,修改代码的量需要最小.”
follow up: how to use those class? the Factory design pattern, How to design configuration file?
4. Word Break, Word BreakII which are same as leetcode. the time complexity, use dp to implemnt the word break 2
5. 转载:“有一个切好的披萨缺了一块,你和朋友轮流拿(每次只能拿边上的),求怎样拿才能保证拿到的area最大。纠结了半天只能强上DFS”
My problem is different from this one. He ask me How to get max sum of areas?
Good luck for every one!