Amazon Interview Question for SDE1s


Country: India
Interview Type: In-Person




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

The idea is to accommodate "cheapest" tasks first using a cpu with the least free cores.

def count(tasks, cpus):
    tasks = sorted(tasks)
    heapq.heapify(cpus)
    res = 0
    for t in tasks:
        while cpus and cpus[0] < t:
            heapq.heappop(cpus)
        if not cpus:
            return res
        cores = cpus[0]
        res += 1
        heapq.heapreplace(cpus, cores - t)
    return res

- adr July 23, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

def count(tasks, cpus):
tasks = sorted(tasks)
heapq.heapify(cpus)
res = 0
for t in tasks:
while cpus and cpus[0] < t:
heapq.heappop(cpus)
if not cpus:
return res
cores = cpus[0]
res += 1
heapq.heapreplace(cpus, cores - t)
return res

- Anonymous August 07, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class AIQ {
    public static void main(String args[]) {
        int process[] = {3,5,7};
        int core[] = {1,3,5};
        
        System.out.println(findMaxProcessAllocation(process,core));
    }
    
    public static int findMaxProcessAllocation(int[] process,int[] core){
        int maxCore = findMaxCore(core);
        int result = 0;
        for(int i=0;i<process.length;i++){
            if(process[i] <= maxCore){
                result++;
            }
        }
        return result;
    }
    
    public static int findMaxCore(int[] core){
        int max = 0;
        for(int i=0;i<core.length;i++){
            if(core[i] > max){
                max = core[i];
            }
        }
        return max;
    }
}

- Vasanth August 14, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class AIQ {
    public static void main(String args[]) {
        int process[] = {3,5,7};
        int core[] = {1,3,5};
        
        System.out.println(findMaxProcessAllocation(process,core));
    }
    
    public static int findMaxProcessAllocation(int[] process,int[] core){
        int maxCore = findMaxCore(core);
        int result = 0;
        for(int i=0;i<process.length;i++){
            if(process[i] <= maxCore){
                result++;
            }
        }
        return result;
    }
    
    public static int findMaxCore(int[] core){
        int max = 0;
        for(int i=0;i<core.length;i++){
            if(core[i] > max){
                max = core[i];
            }
        }
        return max;
    }
}

- Vasanth August 14, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class AIQ {
public static void main(String args[]) {
int process[] = {3,5,7};
int core[] = {1,3,5};

System.out.println(findMaxProcessAllocation(process,core));
}

public static int findMaxProcessAllocation(int[] process,int[] core){
int maxCore = findMaxCore(core);
int result = 0;
for(int i=0;i<process.length;i++){
if(process[i] <= maxCore){
result++;
}
}
return result;
}

public static int findMaxCore(int[] core){
int max = 0;
for(int i=0;i<core.length;i++){
if(core[i] > max){
max = core[i];
}
}
return max;
}
}

- Vasanth August 14, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

and

public class AIQ {
public static void main(String args[]) {
int process[] = {3,5,7};
int core[] = {1,3,5};

System.out.println(findMaxProcessAllocation(process,core));
}

public static int findMaxProcessAllocation(int[] process,int[] core){
int maxCore = findMaxCore(core);
int result = 0;
for(int i=0;i<process.length;i++){
if(process[i] <= maxCore){
result++;
}
}
return result;
}

public static int findMaxCore(int[] core){
int max = 0;
for(int i=0;i<core.length;i++){
if(core[i] > max){
max = core[i];
}
}
return max;
}
}

- Vasanth August 14, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

and

public class AIQ {
public static void main(String args[]) {
int process[] = {3,5,7};
int core[] = {1,3,5};

System.out.println(findMaxProcessAllocation(process,core));
}

public static int findMaxProcessAllocation(int[] process,int[] core){
int maxCore = findMaxCore(core);
int result = 0;
for(int i=0;i<process.length;i++){
if(process[i] <= maxCore){
result++;
}
}
return result;
}

public static int findMaxCore(int[] core){
int max = 0;
for(int i=0;i<core.length;i++){
if(core[i] > max){
max = core[i];
}
}
return max;
}
}

and

- Vasanth August 14, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public static int findMaxProcessAllocation(int[] process,int[] core){
int maxCore = findMaxCore(core);
int result = 0;
for(int i=0;i<process.length;i++){
if(process[i] <= maxCore){
result++;
}
}
return result;
}

- Vasanth August 14, 2018 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

This problem cab solved by applying solution for maximum bipartite graph problem.

- Balaraju July 30, 2018 | 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