is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
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.
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.
I am writing first time on this site. Do corrections if required.
- cyril.satya October 25, 2013package com.core;
import java.util.BitSet;
public class PrimeProg {
/**
* @param args
*/
public static void main(String[] args) {
int n = 50;// pass through the command line arguments.
int cnt = getPrimeCount(n);
int[] primeArr = new int[cnt];
int count = 0;
for(int k = 2;k <= n; k++){
if(findPrimes(k)){
primeArr[count++] = k;
}
}
int[] resultArr = swap(primeArr);
for(int i = 0; i < resultArr.length; i++) {
System.out.println(resultArr[i]);
}
}
private static int[] swap(int[] primeArr) {
int start = 0;
int mid = 0;
int end = primeArr.length-1;
boolean b= true;
boolean c= true;
for(int i=0; i<primeArr.length;i++) {
int x = primeArr[i]/10;
switch(x) {
case 1: {
int temp = primeArr[start];
primeArr[start] = primeArr[i];
primeArr[i] = temp;
start++;
mid++;
break;
}
case 2: {
if(b) {
++mid;
}
int temp = primeArr[mid];
primeArr[mid] = primeArr[i];
primeArr[i] = temp;
mid++;
b=false;
break;
}
case 3:{
if(primeArr[mid] != 3 && primeArr[mid+1] == 3) {
int temp = primeArr[mid];
primeArr[mid] = primeArr[mid+1];
primeArr[mid+1]=temp;
mid++;
}
int temp = primeArr[mid];
primeArr[mid] = primeArr[i];
primeArr[i] = temp;
mid++;
c=false;
break;
}
}
}
/*int temp = primeArr[mid];
primeArr[mid] = primeArr[end];
primeArr[end] = temp;*/
return primeArr;
}
private static boolean findPrimes(int i) {
boolean flag = true;
for(int j=2;j<=Math.sqrt(i);j++) {
if(i%j == 0) {
flag = false;
break;
}
}
return flag;
}
public static int getPrimeCount(int n){
if(n < 2)
return 0;
BitSet candidates = new BitSet(n - 1);
candidates.set(0, false);
candidates.set(1, false);
candidates.set(2, n);
for(int i = 2; i < n; i++)
if(candidates.get(i))
for(int j = i + i; j < n; j += i)
if(candidates.get(j) && j % i == 0)
candidates.set(j, false);
return candidates.cardinality();
}
}