http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=144699&extra=page%3D1%26filter%3Dsortid%26sortid%3D311%26searchoption%255B3046%255D%255Bvalue%255D%3D3%26searchoption%255B3046%255D%255Btyp



http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=144699&extra=page%3D1%26filter%3Dsortid%26sortid%3D311%26searchoption%255B3046%255D%255Bvalue%255D%3D3%26searchoption%255B3046%255D%255Btyp

3. Bloomberg
1) Remove subtree. 就是给一颗树,但是每个Node都是只有它的Parent的pointer而不是它的child的pointer,然后给你一个unsorted array里面存着所有的Node,和一个target node,要求你remove那个target node的subtree。
2) 给一个m行n列的矩阵和一个开始的位置,要求返回最长的进行相同加减运算的路径。比如开始的点的值是5. 那可以走下去的路径比如可以是5->9->13->17 (都是+4)或者5->4->3->2(都是-1)或者5->5->5这样
面完1个小时给我发邮件说过了,叫我第二天再去面。第二天:
1) 算是system design吧,看到就感觉懵比了(完全没学过system design)。说是一个有很多个层的distributed system,一台电脑发送一个request会在第一层中任选一个服务器发送过去,然后在第二层中任选一个服务器,然后在第三层中任选一个服务器,每个服务器处理后都有可能直接返回上一层,或者是继续发往下一层……blabla,已知某个request出问题了,问你怎么找问题出在哪里。反正我懵了……于是把暑假实习时候某个监控系统的原理胡乱扯了一通就算过了……. 涓€浜�-涓夊垎-鍦帮紝鐙鍙戝竷
2)给一个矩阵,求里面的最长单向increase或单向decrease的sequence——可以是从任何位置开始的sequence。反正也是个改良版BFS. from: 1point3acres.com/bbs 
面完又跟HR唠嗑了一阵子,就给我发Offer惹 O(∩_∩)

Read full article from http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=144699&extra=page%3D1%26filter%3Dsortid%26sortid%3D311%26searchoption%255B3046%255D%255Bvalue%255D%3D3%26searchoption%255B3046%255D%255Btyp


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts