Facebook interview - Suffix Array Order - 我的博客 - ITeye技术网站


Facebook interview - Suffix Array Order - 我的博客 - ITeye技术网站
首先定义了suffix string 或者说suffix arrary
如果有个数组是 int[] text = {10, 20, 30, 25}
那么 suffix[0] = {10, 20, 30, 25}
           suffix[1] = {20, 30, 25}
           suffix[2] = {30, 25}
           suffix[3] = {25}
如果对这些数组进行lexical order 的排序,我们可以得到
suffix[0] < suffix[1] < suffix[3] < suffix[2]
问题是:
    input: int[] text
    output: int[] suffix_array_order
e.g.
input: int[] text = {10, 20, 30, 25}
output: int[] suffix_array_order = {0, 1, 3, 2}

Solution:
注意: Arrays.sort(T[], Comparator)只能用于排序对象数组,不能用于排序int, long之类的原始值数组!
  1. public Integer[] suffixArrayOrder(int[] A) {  
  2.     int n = A.length;  
  3.     Integer[] order = new Integer[n];  
  4.     for(int i=0; i<n; i++) {  
  5.         order[i] = i;  
  6.     }  
  7.       
  8.     Arrays.sort(order, new Comparator<Integer>(){  
  9.         @Override  
  10.         public int compare(Integer o1, Integer o2) {  
  11.             int res = A[o1] - A[o2];  
  12.             while(res == 0 && o1 < n && o2 < n) {  
  13.                 res = A[o1++] - A[o2++];  
  14.             }  
  15.             return res;  
  16.         }  
  17.     });  
  18.       
  19.     System.out.println(Arrays.toString(order));  
  20.     return order;  
  21. }

第二题: input:  int[] text, int[] subText
              output: boolean isExist;
检查text数组中有没有一个subarray 是subText。要求时间小于O(N^2), N == text.length;
这里假设我们有了第一题的 suffix_array_order.
(做法是binary search)

http://www.geeksforgeeks.org/suffix-array-set-1-introduction/

就是相当于把所有的substring 排序,然后binary search
You don't need to create an LIst<List> for all the suffix arrays since that will take extra space and time to create. What I did is to create an wrapper class:
Class Index{
    public int index;
    public int[] array;
}
Just pass the reference of whole input array to the wrapper class object.
I answered O(n log n), n is the length of the array at the interview and passed.

After that, I think if we consider the worse case of comparing two string, the worst case time should be O(n^2 log n).
  1. public class Index {
  2.     int[] suff;
  3.     int idx;
  4.     Index(int[] _suff, int _idx) {
  5.         suff = _suff;
  6.         idx = _idx;
  7.     } 
  8. }

  9. //Sort
  10. int[] suffixOrder(int[] text, int n) {
  11.     int[] res = new int[n];
  12.     Index[] indices = new Index[n];
  13.     for (int i=0; i < n; i++) {
  14.         int[] suffix = Arrays.copyOfRange(text, i, text.length);
  15.         indices[i] = new Index(suffix, i);
  16.     }

  17.     Arrays.sort(indices, new Comparator<Index>() {
  18.         public int compare(Index i1, Index i2) {
  19.             int p1 = 0;
  20.             int p2 = 0;
  21.             while (p1 < i1.suff.length && p2 < i2.suff.length) {
  22.                 if(i1.suff[p1] != i2.suff[p2]) {
  23.                     return i1.suff[p1] - i2.suff[p2];
  24.                 } else {
  25.                     p1 ++;
  26.                     p2 ++;
  27.                 }
  28.             }
  29.             if (p2 == i2.suff.length) {
  30.                 return 1;
  31.             }
  32.             return -1;
  33.         }
  34.     });

  35.     for (int i = 0; i < n; i++) {
  36.         res[i] = indices[i].idx;
  37.     }
  38.     return res;
  39. }

  40. // Search
  41. boolean search(int[] text, int n, int[] sub_text, int m) {
  42.     int[] suffix_order = suffixOrder(text, n);
  43.     Comparator<Index> textCompare = new Comparator<Index>(){
  44.         @Override
  45.         public int compare(Index i1, Index i2){
  46.             while (a < text.length && b < sub_text.length) {
  47.                 if (text[a] != sub_text[b]) {
  48.                     return text[a] - sub_text[b];
  49.                 } else {
  50.                     a ++;
  51.                     b ++;.
  52.                 }
  53.             }
  54.             if(a == text.length) return -1;
  55.             return 0;.
  56.         }
  57.     };

  58.     int lo = 0;
  59.     int hi = n - 1;
  60.     while (lo <= hi) {
  61.     int mid = (lo + hi) / 2;
  62.     int[] suffix = Arrays.copyOfRange(text, suffix_order[mid], text.length);
  63.     int cmp = textCompare(suffix, sub_text); 
  64.     if (cmp == 0) {
  65.         return true;
  66.     } else if(cmp < 0) {
  67.         lo = mid + 1;
  68.     } else {}
  69.         hi = mid - 1;
  70.     }
  71.     return false;
  72. }



Read full article from Facebook interview - Suffix Array Order - 我的博客 - ITeye技术网站

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