Chapter 5 from Elements of Programming Interviews


Parity
public class Parity2 {
  public static short parity2(long x) {
    short result = 0;
    while (x != 0) {
      result ^= 1;
      x &= (x - 1); // drops the lowest set bit of x.
    }
    return result;
  }
}
public class Parity3 {
  private static short[] precomputedParity;
  static {
    precomputedParity = new short[1 << 16];
    for (int i = 0; i < (1 << 16); ++i) {
      precomputedParity[i] = Parity1.parity1(i);
    }
  }
  public static short parity3(long x) {
    return (short) (precomputedParity[(int) ((x >> 48) & 0xFFFF)]
        ^ precomputedParity[(int) ((x >> 32) & 0xFFFF)]
        ^ precomputedParity[(int) ((x >> 16) & 0xFFFF)] 
        ^ precomputedParity[(int) (x & 0xFFFF)]);
  }
}

Swap bits
  public static long swapBits(long x, int i, int j) {
    if (((x >> i) & 1) != ((x >> j) & 1)) {
      x ^= (1L << i) | (1L << j);
    }
    return x;
  }

Reverse bits
  private static ArrayList<Long> precomputedReverse = new ArrayList<Long>();
  private static long reverseBits(long x, int n) {
    for (int i = 0, j = n; i < j; ++i, --j) {
      x = SwapBits.swapBits(x, i, j);
    }
    return x;
  }
  private static void createPrecomputedTable() {
    for (int i = 0; i < (1 << 16); ++i) {
      precomputedReverse.add(reverseBits(i, 15));
    }
  }
  public static long reverseBits(long x) {
    return precomputedReverse.get((int) ((x >> 48) & 0xFFFF))
        | precomputedReverse.get((int) ((x >> 32) & 0xFFFF)) << 16
        | precomputedReverse.get((int) ((x >> 16) & 0xFFFF)) << 32
        | precomputedReverse.get((int) (x & 0xFFFF)) << 48;
  }
  
closestIntegerSameBits
  public static long closestIntegerSameBits(long x) {
    for (int i = 0; i < 63; ++i) {
      if ((((x >> i) & 1) ^ ((x >> (i + 1)) & 1)) != 0) {
        x ^= (1L << i) | (1L << (i + 1)); // swaps bit-i and bit-(i + 1)
        return x;
      }
    }

    // Throw error if all bits of x are 0 or 1
    throw new RuntimeException("all bits are 0 or 1");
  }

  public static int setBit(int x, int bit, boolean setValue) {
    return setValue ? x | (1 << bit) : x & ~(1 << bit);
  }
Power set or Combination
public static void generatePowerSet(ArrayList<Integer> S) {
for (int i = 0; i < (1 << S.size()); ++i) {
int x = i;
while (x != 0) {
int tar = (int) (Math.log(x & ~(x - 1)) / LOG_2);
System.out.print(S.get(tar));
if ((x &= x - 1) != 0) {
System.out.print(",");
}
}
System.out.println();
}
}
  
  private static void generatePowerSetHelper(ArrayList<Integer> S, int idx,
      LinkedList<Integer> res) {
    if (!res.isEmpty()) {
      // Print the subset.
      Iterator<Integer> iterator = res.iterator();
      while (iterator.hasNext()) {
        System.out.print(iterator.next());
        if (iterator.hasNext()) {
          System.out.print(",");
        }
      }
    }
    System.out.println();

    for (int i = idx; i < S.size(); ++i) {
      res.offerLast(S.get(i));
      generatePowerSetHelper(S, i + 1, res);
      res.pollLast();
    }
  }  

Base Convert
public static String convertBase(String s, int b1, int b2) {
boolean neg = s.startsWith("-");
int x = 0;
for (int i = (neg ? 1 : 0); i < s.length(); ++i) {
x *= b1;
x += Character.isDigit(s.charAt(i)) ? s.charAt(i) - '0' : s
.charAt(i) - 'A' + 10;
}

StringBuilder ans = new StringBuilder();
while (x != 0) {
int r = x % b2;
ans.append((char) (r >= 10 ? 'A' + r - 10 : '0' + r));
x /= b2;
}

if (ans.length() == 0) {
ans.append('0');
}
if (neg) {
ans.append('-');
}
ans.reverse();
return ans.toString();
}

GCD without multiplication, division or modulus operations
public static long elementaryGCD(long x, long y) {
if (x == 0) {
return y;
} else if (y == 0) {
return x;
} else if ((x & 1) == 0 && (y & 1) == 0) { // x and y are even.
return elementaryGCD(x >> 1, y >> 1) << 1;
} else if ((x & 1) == 0 && (y & 1) != 0) { // x is even, y is odd.
return elementaryGCD(x >> 1, y);
} else if ((x & 1) != 0 && (y & 1) == 0) { // x is odd, y is even.
return elementaryGCD(x, y >> 1);
} else if (x > y) { // both x and y are odd, and x > y.
return elementaryGCD(x - y, y);
}
return elementaryGCD(x, y - x); // both x and y are odd, and x <= y.
}


PrimeSieve
public static ArrayList<Integer> generatePrimesFrom1toN(int n) {
int size = (int) Math.floor(0.5 * (n - 3)) + 1;
// isPrime[i] represents (2i + 3) is prime or not.
ArrayList<Integer> primes = new ArrayList<Integer>(); // stores the
// primes
// from 1 to n.
primes.add(2);
boolean[] isPrime = new boolean[size];
Arrays.fill(isPrime, true);
for (long i = 0; i < size; ++i) {
if (isPrime[(int) i]) {
int p = (int) ((i << 1) + 3);
primes.add(p);
// Sieving from p^2, whose index is 2i^2 + 6i + 3.
for (long j = ((i * i) << 1) + 6 * i + 3; j < size; j += p) {
isPrime[(int) j] = false;
}
}
}
return primes;
}
Given two axis-aligned rectangles A and B. Write a function to determine if the two rectangles overlap.
http://leetcode.com/2011/05/determine-if-two-rectangles-overlap.html

! ( P2.y < P3.y || P1.y > P4.y || P2.x < P3.x || P1.x > P4.x )
( P2.y ≤ P3.y && P1.y ≥ P4.y && P2.x ≥ P3.x && P1.x ≤ P4.x )

  public static boolean isIntersect(Rectangle R, Rectangle S) {
    return R.x <= S.x + S.width && R.x + R.width >= S.x
        && R.y <= S.y + S.height && R.y + R.height >= S.y;
  }

  public static Rectangle intersectRectangle(Rectangle R, Rectangle S) {
    if (isIntersect(R, S)) {
      return new Rectangle(Math.max(R.x, S.x), Math.max(R.y, S.y), Math.min(R.x
          + R.width, S.x + S.width)
          - Math.max(R.x, S.x), Math.min(R.y + R.height, S.y + S.height)
          - Math.max(R.y, S.y));
    } else {
      return new Rectangle(0, 0, -1, -1); // no intersection.
    }
  }
Multiply no add operation
public static long addNoOperator(long a, long b) {
long sum = 0, carryin = 0, k = 1, tempA = a, tempB = b;
while (tempA != 0 || tempB != 0) {
long ak = a & k, bk = b & k;
long carryout = (ak & bk) | (ak & carryin) | (bk & carryin);
sum |= (ak ^ bk ^ carryin);
carryin = carryout << 1;
k <<= 1;
tempA >>= 1;
tempB >>= 1;
}
return sum + carryin;
}

public static long multiplyNoOperator(long x, long y) {
long sum = 0;
while (x != 0) {
// Examine the lg(k)-th bit of x.
if (x % 2 != 0) {
sum = addNoOperator(sum, y);
}
x >>= 1;
y <<= 1;
}
return sum;
}

Divide No Operation
  public static long divideXbyYBinSearch(long x, long y) {
    if (x < y) {
      return 0;
    }

    int powerLeft = 0;
    int powerRight = 8 << 3;
    int powerMid = -1;
    while (powerLeft < powerRight) {
      int tmp = powerMid;
      powerMid = powerLeft + ((powerRight - powerLeft) >> 1);
      if (tmp == powerMid) {
        break;
      }
      long yshift = y << powerMid;
      if ((yshift >> powerMid) != y) {
        // yshift overflowed, use a smaller shift.
        powerRight = powerMid;
        continue;
      }
      if ((y << powerMid) > x) {
        powerRight = powerMid;
      } else if ((y << powerMid) < x) {
        powerLeft = powerMid;
      } else {
        return (1L << powerMid);
      }
    }
    long part = 1L << powerLeft;
    return part | divideXbyYBinSearch(x - (y << powerLeft), y);
  }

  // @include
  public static long divideXbyY(long x, long y) {
    long res = 0;
    while (x >= y) {
      int power = 1;
      // Checks (y << power) >= (y << (power - 1)) to prevent potential
      // overflow of unsigned.
      while ((y << power) >= (y << (power - 1)) && (y << power) <= x) {
        ++power;
      }

      res += 1L << (power - 1);
      x -= y << (power - 1);
    }
    return res;
  }

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