Google – Manager Peer Problem


Google – Manager Peer Problem
Design a data structure to support following functions:
1. setManager(A, B) sets A as a direct manager of B
2. setPeer(A, B) sets A as a colleague of B. After that, A and B will have the same direct Manager.
3. query(A, B) returns if A is in the management chain of B.
Every person only has 1 direct manager.
[Solution]
本来分析了半天以为union-find的行不通,最后发现好像也是可以的。但是和传统union-find有点不一样:
1. 不能path compression。因为这题涉及到层级关系,不能打乱。
2. 有两种union。并且在做union的时候并不是把他们的root union到一起,而是直接id[b] = ida或者id[b] = a(setManager)。这里把id命名为parent更贴切一点。
3. find不是找他们的root是不是一样,而是在找root of B的过程中,看A在不在一条chain上。
其实这题用union-find也就相当于一棵Tree, 只不过用数组来记录每个Node的parent的而已。
第二种方法就是直接Tree + Hash Table
每个TreeNode包含一个parent指针和一个neighbors list,不需要维护children。因为找在不在一条chain上都是往上找。再加一个Hash Table来hash Integer to TNode
// union-find
class ManagerPeer {
   
  int[] parent;
  int n;
   
  public ManagerPeer(int n) {
    this.n = n;
    this.parent = new int[n];
    for (int i = 0; i < n; i++) {
      parent[i] = i;
    }
  }
   
  public void setManager(int a, int b) {
    parent[b] = a;
  }
   
  public void setPeer(int a, int b) {
    parent[b] = parent[a];
  }
   
  public boolean query(int a, int b) {
    while (parent[b] != b) {
      if (parent[b] == a) {
        return true;
      }
      b = parent[b];
    }
    return false;
  }
}
// Tree + Hash Table
class ManagerPeer2 {
   
  Map<Integer, TNode> nodeMap = new HashMap<>();
   
  public void setManager(int a, int b) {
    nodeMap.putIfAbsent(a, new TNode(a));
    nodeMap.putIfAbsent(b, new TNode(b));
     
    nodeMap.get(b).parent = nodeMap.get(a);
  }
   
  public void setPeer(int a, int b) {
    nodeMap.putIfAbsent(a, new TNode(a));
    nodeMap.putIfAbsent(b, new TNode(b));
     
    nodeMap.get(a).neighbors.add(nodeMap.get(b));
    nodeMap.get(b).neighbors.add(nodeMap.get(a));
    nodeMap.get(b).parent = nodeMap.get(a).parent;
  }
   
  public boolean query(int a, int b) {
    if (!nodeMap.containsKey(a) || !nodeMap.containsKey(b)) {
      return false;
    }
     
    TNode curr = nodeMap.get(b);
    while (curr != null) {
      if (curr.equals(nodeMap.get(a))) {
        return true;
      }
      curr = curr.parent;
    }
  }
   
  private class TNode {
    int val;
    TNode parent;
    List<TNode> neighbors;
     
    public TNode(int val) {
      this.val = val;
      neighbors = new ArrayList<>();
    }
  }
}
http://www.1point3acres.com/bbs/thread-198684-1-1.html
实现一个class支持三个API:
peer A, B
manager A, B
isManager A, B

比如
peer Tim, Bill
peer Bill, Mike.鐣欏璁哄潧-涓€浜�-涓夊垎鍦�
manager Lucy, Tim. 1point3acres.com/bbs
isManager Lucy, Tim -> True
isManager Lucy, Mike -> True
manager Amy, Lucy-google 1point3acres
isManager Amy, Bill -> True

具体的来说,如果给两个人添加peer关系,他们就成为一个peer group。. From 1point 3acres bbs
如果其中一个人已经在某个peer group,另一个人没有peer group,就把后者添加到前者的peer group。
每个peer group都只有一个manager。
所以不会出现
peer Tim, Bill.鏈枃鍘熷垱鑷�1point3acres璁哄潧
manager Lucy, Tim
manager Amy, Bill
这种情况
但是, 如果两个人已经在不同的peer groups,这种情况call peer API会返回错误。manager Lucy, Tim
manager Amy, Bill
peer Tim, Bill -> error
每个manager可以有自己的peers以及manager。
每个manager的manager也是其下属的manager。
X. use union find, two maps. each layer is seen as a peer group, different layers are connected by managerEmployee map
class ManagerPeer{. visit 1point3acres.com for more.
     Map<String, String> parents= new HashMap<>();. visit 1point3acres.com for more.
     Map<String, Set<String>> managerEmployee= new HashMap<>();
     Set<String> labelNodes = new HashSet<>();. 1point 3acres 璁哄潧
private String findParents(String p1){
    if(!parents.containsKey(p1)){
    parents.put(p1, p1);
    return p1;. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
}
    while(parents.get(p1) != p1){
    parents.put(p1, parents.get(p1));
    p1 = parents.get(p1);
}
return p1;
}
public void peer(String p1, String p2){
    String parent1 = findParents(p1);. 鍥磋鎴戜滑@1point 3 acres
    String parent2 = findParents(p2);
    if(!parent1.equals(parent2)){
    if(labelNodes.contains(parent1)){. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
    parents.put(parent2, parent1);
}else{
    parents.put(parent1, parent2);
}
}
}
public void manage(String mngr, String empl){
    String label1 = findParents(mngr);. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
    String label2 = findParents(empl);
    labelNodes.add(label1); labelNodes.add(label2);
    managerEmployee.put(label1, new HashSet<>());
    managerEmployee.get(label1).add(label2);
    managerEmployee.get(label1).addAll(managerEmployee.getOrDefault(label2, new HashSet<>()));
}. 1point3acres.com/bbs
public boolean isManager(String mngr, String empl){
    if(!parents.containsKey(mngr) || !parents.containsKey(empl)) return false;
    String label1 = findParents(mngr);
    String label2 = findParents(empl);
    if(!managerEmployee.containsKey(label1) || !managerEmployee.get(label1).contains(label2)) return false;
    return true;
}
Read full article from Google – Manager Peer Problem

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts