Intuit VO 最后背靠背两轮

用bluejean video onsite

第一轮,烙印三姐+三哥

/**
Define a family tree in a language of your choice. For simplicity, assume a single parent, who may have children, who also may have children of their own. 


  {
      "name": "Bob",
      "children": [
        {
        "name": "Ann",
        "children":
        [
          {"name": "Steve"} ,
          {"name": "Clark"}
        ]
        },
        {
        "name": "George",
        "children":
        [
          {"name": "Bill" }
        ]
        }
      ]
    }


// level order traversing
[Bob]
[Ann, George]
[Steve, Clark, Bill]
  1. 打印family tree,用dfs和bfs两种方法
  2. 比较1的各种tradeoff,按照generation 打印出来每个family成员

第二轮

面试官没换,纯BQ,问简历项目

补充一下第一轮
只有半小时
算法考了一题 就是简单的level order 遍历一个树,注意不一定是二叉树

加考了一道实现swap两个int,bit 操作

请问楼主是什么时候面的呢

昨天上午