largest K such that A^K is a subsequence of B - Zenefits


http://www.1point3acres.com/bbs/thread-145290-1-1.html
// Find the largest K such that A^K is a subsequence of B, where A, B are two strings. |A| << |B|.

// Power of a string:
// Let A = xyxz 鏉ユ簮涓€浜�.涓夊垎鍦拌鍧�. 
// Then,
// A^1 = A = xyxz
// A^2 = xxyyxxzz
// A^3 = xxxyyyxxxzzz
. 1point 3acres 璁哄潧
// Example:-google 1point3acres
// A = xyxz
// B = xabyzxz

// B xaybyxzxxxzz

// A xxyyxxzz
The key of the problem is to find out the largest possible k, that the A^k is the subsequence of B. 

How to find out the maximum K. The easiest way is k = lenB / lenA. But that could result to a false larger K. 

A better approach is to calculate the frequency of each character in A and B. Then calculate the MIN(B[i] / A[i]).
    public int findK(String A, String B) {
        int len1 = A.length(), len2 = B.length();
        if (len1 > len2) {
            return 0;
        }
         
        if (len1 <= 0) {
          return 0;
        }
         
        // remove space weird characters, capital to lower case etc if needed
        A = preprocess(A);
             
        // find signature for each A and B and get the max possible value for k
        int[] sigA = new int[256];
        int[] sigB = new int[256];
        for (int i = 0; i < len1; i++) {
            sigA[A.charAt(i)]++;
        }
        for (int i = 0; i < len2; i++) {
            sigB[B.charAt(i)]++;
        }
         
        int kMax = Integer.MAX_VALUE;
        for (int i = 0; i < len1; i++) {
            if (sigA[A.charAt(i)] != 0) {
                kMax = Math.min(sigB[A.charAt(i)] / sigA[A.charAt(i)], kMax);
            }
        }
         
        int lo = 0, hi = kMax;
        int ret = 0;
        while (lo <= hi) {
            int med = lo + (hi - lo) / 2;
            if (isSubSeq(expand(A, med), B)){
                ret = med;
                lo = med + 1;
            } else {
                hi = med - 1;
            }
        }
        return ret;
    }
   
    String expand(String A, int k){
        StringBuilder sbuf = new StringBuilder();
        for (int i = 0; i < A.length(); i++) {
            char c = A.charAt(i);
            for (int j = 0; j < k; j++) {
                sbuf.append(c);
            }
        }
        return sbuf.toString();
    }
         
    boolean isSubSeq(String A, String B) {
        int len1 = A.length(), len2 = B.length();
        int a = 0, b = 0;
        while (a < len1 && b < len2){
            if (A.charAt(a) == B.charAt(b)){
                a++;
                b++;
            } else {
                b++;
            }
        }
        return a == len1;
    }
         
    String preprocess(String A){
        return A.toLowerCase();
    }
  1. public int findK(String A, String B){
  2.             int len1 = A.length(), len2 = B.length();
  3.             if (len1 > len2) return 0;
  4.             if (len1 <= 0) return 0;
  5.             // remove space weird characters, capital to lower case etc if needed.
  6.             A = preprocess(A);
  7.             // find signature for each A and B and get the max possible value for k. 鐗涗汉浜戦泦,涓€浜╀笁鍒嗗湴
  8.             int[] sigA = new int[256];
  9.             int[] sigB = new int[256];. Waral 鍗氬鏈夋洿澶氭枃绔�,
  10.             for (int i = 0; i < len1; i++) sigA[A.charAt(i)]++;
  11.             for (int i = 0; i < len2; i++) sigB[B.charAt(i)]++;
  12.             int kMax = Integer.MAX_VALUE;. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
  13.             for (int i = 0; i < len1; i++){
  14.                 if (sigA[A.charAt(i)] != 0) kMax = Math.min(sigB[A.charAt(i)] / sigA[A.charAt(i)], kMax);
  15.             }
  16.             int lo = 0, hi = kMax;. 鍥磋鎴戜滑@1point 3 acres
  17.             int ret = 0;
  18.             while (lo <= hi){
  19.                 int med = lo + (hi - lo) / 2;
  20.                 if (isSubSeq(expand(A, med), B)){
  21.                     ret = med;
  22.                     lo = med + 1; 鏉ユ簮涓€浜�.涓夊垎鍦拌鍧�. 
  23.                 } else {
  24.                     hi = med - 1;
  25.                 }
  26.             }
  27.             return ret;
  28.         }
  29.         
  30.         String expand(String A, int k){
  31.             StringBuilder sbuf = new StringBuilder();
  32.             for (int i = 0; i < A.length(); i++){
  33.                 char c = A.charAt(i);
  34.                 for (int j = 0; j < k; j++) sbuf.append(c);
  35.             }. more info on 1point3acres.com
  36.             return sbuf.toString();
  37.         }
  38.         
  39.         boolean isSubSeq(String A, String B){
  40.             int len1 = A.length(), len2 = B.length();
  41.             int a = 0, b = 0;
  42.             while (a < len1 && b < len2){
  43.                 if (A.charAt(a) == B.charAt(b)){
  44.                     a++;
  45.                     b++;
  46.                 } else {
  47.                     b++;. 鐗涗汉浜戦泦,涓€浜╀笁鍒嗗湴
  48.                 }
  49.             }
  50.             return a == len1;. 鐗涗汉浜戦泦,涓€浜╀笁鍒嗗湴
  51.         }
  52.         
  53.         String preprocess(String A){
  54.             return A.toLowerCase();
  55.         }
http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=143470&highlight=zenefit
一开始思路就是k从1一个个试,不行就返回。找subsequence用dp。但是面试官说复杂度太高,就想到用双指针遍历。然后问了时间复杂度。 写好后他还要improve.想到用二分查找k.因为最小是1,最大是B.length()/A.length();

subsequence是不需要连续的。如果x^(K+1)是y的subsequence,x^(K)一定是y的subsequence
  1.         public int findLargestK(String s1, String s2){.鏈枃鍘熷垱鑷�1point3acres璁哄潧
  2.                 if(s1.length() < 1 || s1.length() > s2.length())
  3.                         return -1;
  4.                 int k = 1;
  5.                 int left = 1, right = s2.length() / s1.length();
  6.                 int lastK = -1;
  7.                 while(left <= right){
  8.                         k = left + (right - left)/2;
  9.                         String akString = generateKth(s1, k);
  10.                         if(isSub(akString, s2)){
  11.                                 lastK = k;
  12.                                 left = k + 1;
  13.                         }else{. visit 1point3acres.com for more.
  14.                                 right = k - 1;
  15.                         }
  16.                 }
  17.                 return lastK;
  18.         }
  19.         
  20.         private String generateKth(String s, int k){
  21.                 StringBuilder temp = new StringBuilder();
  22.                 for(int i = 0; i < s.length(); i++){
  23.                         for(int j = 0; j < k; j++){. Waral 鍗氬鏈夋洿澶氭枃绔�,
  24.                                 temp.append(s.charAt(i));
  25.                         }
  26.                 }
  27.                 return temp.toString();
  28.         }. more info on 1point3acres.com
  29.         
  30.         private boolean isSub(String s1, String s2){
  31.                 int i = 0;
  32.                 int j = 0;
  33.                 while(i < s1.length() && j < s2.length()){
  34.                         if(s1.charAt(i) == s2.charAt(j)){. 1point 3acres 璁哄潧
  35.                                 i++;
  36.                         }
  37.                         j++;-google 1point3acres
  38.                 }
  39.                 if(i == s1.length())
  40.                         return true;
  41.                 return false;
  42.         }

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