Facebook Interview Question for SDE1s


Country: United States




Comment hidden because of low score. Click to expand.
2
of 2 vote

geeksforgeeks.org/prime-factorization-using-sieve-olog-n-multiple-queries/
geeksforgeeks.org/print-all-prime-factors-of-a-given-number/

- revant June 09, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

The cost can be difficult to compute but an upper bound could be O(nlogn) assuming that we traverse through all the primes and assume the cost of computing the number of factors given a prime is logn.

primes = [2, 3, 5, 7, 11, 13, 17, 19, 23]

def computeFactors(n):
    if n in primes: return [n]
    factors = []
    for prime in primes:
        while (n % prime) == 0:
            factors.append(prime)
            n /= prime
        if n == 1:
            break
    return factors

- Fernando June 09, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

/* 
Prime factors
Automatic finding of primes and then factors.
So, here, we go.
*/
def prime_factors_str( n ){
  // basic stuff 
  upto = ceil( n ** 0.5 )
  // should be pretty easily understandable 
  #(primes, factors) = fold( [2:upto],  [ list(), list() ] ) ->  {
    // is my current no prime ?
    pp = $.o // possible prime
    #(primes,factors) = $.p 
    continue ( exists( primes ) :: { $.o /? pp  } )
    // now it is prime 
    primes += pp 
    // now, is it a factor ?
    while ( pp /? n  ){ n /= pp ; factors += pp  } 
    $.p // return  
  }
  // print factors 
  str ( factors , '*' ) 
}
println( prime_factors_str(90) )

- NoOne June 09, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

The key to this problem is finding all the prime numbers until n and then dividing n by all the prime numbers one by one"

public class Solution {
  public String getPrimeFactors(int n) {
    if(n <= 3) {
      return Integer.toString(n);
    }
    Boolean[] primes = this.getPrimes(n);
    int number = n;
    StringBuilder sb = new StringBuilder();
    for(int i = 2; i < primes.length; i++) {
      if(!primes[i] || number % i != 0) {
        continue;
      }
      while(number % i == 0) {
        sb.append(i);
        sb.append(" * ");
        number = number / i;
      }

      if(number == 1) {
        break;
      }
    }
    sb.delete(sb.length() - 3, sb.length());
    return sb.toString();
  }

  private Boolean[] getPrimes(int n) {
    if(n < 2) {
      throw new IllegalArgumentException("n has to be bigger than 1");
    }
    Boolean result = new Boolean[n + 1];
    this.initArray(result);
    int prime = 2;
    while(prime <= Math.sqrt(n)) {
      this.checkOffNonPrimes(prime, result);
      prime = this.getNextPrime(prime, result);
    }
    return result;
  }

  private void checkOffNonPrimes(int index, Boolean[] result) {
    for(int i = index*index; i < result.length; i = i + index) {
      result[i] = false;
    }
  }

  private void getNextPrime(int index, Boolean[] result) {
    int i = index + 1;
    while(i < result.length && !result[i]) {
      i++;
    }
    return i;
  }

  private void initArray(Boolean[] array) {
    if(n < 2) {
      throw new IllegalArgumentException("n has to be bigger than 1");
    }
    Arrays.fill(result, true);
    array[0] = false;
    array[1] = false;
  }
}

- nk June 16, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

function primeFactors(n){
    var i = 2;
    while (n>1) {
	if(n%i==0){
		console.log("factor: "+i);
		n/=i;
        } else {
		i++;
        }
    }
}

- jaylu June 26, 2017 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More