Snapchat Interview Misc


http://www.1point3acres.com/bbs/thread-198209-1-1.html
题目是给一些tasks,每个tasks有一些dependencies,要求输出task 的执行顺序,每个task只执行一次,并且所有dependencies执行完了之后再执行当前任务. 1point3acres.com/bbs
就是很简单的拓扑排序,然而我并没有写熟练. 1point 3acres 璁哄潧
而且小哥不会写C++,而我只会写C++,先把他给的java interface转成C++的struct……我本来对java就不怎么熟,这中间解释了半天

边写边涂改。他面试用的东西是一个online judge一样的,可以跑程序,然后可以写输入。他让我test的时候,我以为要从stdin读入。我想 这尼玛还得建好图。在那犹豫了一会儿,他说 你可以hard coding。我才接着写test cases,然后测试了一下。
想出的几个test cases都跑过了,结果正确。

最后他问了个问题说如果tasks太多无法fit in memory怎么办,我就思密达了

每个task里面有两个Method 一个是execute 另一个是getDependencies() 就是返回它所依赖的task的List
http://www.1point3acres.com/bbs/thread-186745-1-1.html
给一个int的matrix,里面只有0和1,matrix[i][j]表示i和j是朋友,如果是0表示两人不是朋友,
是朋友的分成一个组,问能分几组。比如1和2是朋友,3和他们都不是朋友,那么就是2组,
return 2就可以。自己写test自己测
对 我用的union find 当时没多想还有什么别的解法 面完2天给的消息

Number of island 1 是必须要连在一起在算一组 但是这个比如1和2,1和5是朋友 这样他们是一组的 我觉得如果你用BFS的话 应该就不行 因为1和2连着 但是中间是0就走不到5 但是如果用union find的话 就是一样的方法了 没什么差别

这题BFS,DFS都可以做,和number of Island 1的区别在于,比如对于friend i, 不是对上下左右四个点做进一步的搜索,而是对i的所在的那一行进行搜索。当然,要加visited set进行判断已经搜过的friend 例如dfs:
public static void dfs(int[][] matrix, HashSet<Integer> visited, int curr){
    visited.add(curr);
    int n = matrix.length;
    for(int i=0;i<n;i++){
        if(matrix[curr][i]==1 && i!=curr && !visited.contains(i)){
            dfs(matrix,visited,i);
        }
    }
}

  1.         public static int groupFriends(int[][] matrix) {
  2.                 UnionFind uf = new UnionFind(matrix);
  3.                 int m = matrix.length;
  4.                 int n = matrix[0].length;
  5.                 for(int i = 0; i < m; i++) {.鏈枃鍘熷垱鑷�1point3acres璁哄潧
  6.                         for(int j = 0; j < n; j++) {.1point3acres缃�
  7.                                 if(matrix[i][j] == 1) {
  8.                                         uf.union(i, j);. 1point3acres.com/bbs
  9.                                 }
  10.                         }
  11.                 }
  12.                 return uf.count;
  13.         }
  14. class UnionFind {
  15.         public int count = 0;
  16.         private int[] id = null;
  17.         public UnionFind(int[][] matrix) {
  18.                 count = matrix.length;. 鍥磋鎴戜滑@1point 3 acres
  19.                 id = new int[count];
  20.                 for(int i = 0; i < id.length; i++) id[i] = i; 鏉ユ簮涓€浜�.涓夊垎鍦拌鍧�. 
  21.         }
  22.         
  23.         public int find(int p) {
  24.                 while(p != id[p]) {. 鐗涗汉浜戦泦,涓€浜╀笁鍒嗗湴
  25.                         p = id[p];
  26.                 }
  27.                 return p;
  28.         }.1point3acres缃�
  29.         
  30.         public boolean union(int p, int q) {
  31.                 p = find(p); 鏉ユ簮涓€浜�.涓夊垎鍦拌鍧�. 
  32.                 q = find(q);
  33.                 if(p == q) return false;
  34.                 id[p] = q;
  35.                 count--;. more info on 1point3acres.com
  36.                 return true;
  37.         }. visit 1point3acres.com for more.
  38. }
http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=154918&extra=page%3D1%26filter%3Dsortid%26sortid%3D311%26sortid%3D311
1、word ladder II 2、给一个整数数组表示一列整数并定义这样一个游戏:两个玩家A和B分别轮流从数组的两端取一个数字,并在游戏结束之后计算自己的
收益(取得的整数的总和)。假定玩家A可以先取,求在玩家B采取贪心策略和最优策略这两种情况下,玩家A所能获得的最大收益。

3、首先给出一个树节点的定义方式,一个用Java写的例子如下 class Node {   public char label;   public Node
left, right;   Node(char label) {     this.label = label   } }
然后以此为基础输入给定一个DAG(Directed Acyclic
Graph),这个DAG的每一个节点都是一个树节点,并且这个DAG有且只有一个根节点(没有incoming edges)。如果从根节点执行中序遍历算法,要求推导出最坏情况下遍历结果有多长。并且要求写代码,输出这个遍历中第k个节点。

当时没有跟面试官确认left和right指针都指向同一个节点的case会不会发生,根据讨论我猜是不会发生的。但其实也没有本质区别。 . more info on 1point3acres.com 中序遍历就是标准的二叉树中序遍历的算法。

4、XML Parser

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