Accenture Interview Question for Dev Leads


Country: India
Interview Type: Phone Interview




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

#include <bits/stdc++.h>

using namespace std;
int counts = 0;
void part(int *arr, int s, int e){ //nlogn
    int part_i = -1, mini = e - s + 1;
    int m1 = (s+e)/2, m2 = (s+e)/2 + 1;
    for(int i = s; i <= e; i++){
        int temp = -1;
        if(arr[i]){
            temp = abs(m1 - i);
            if((s-e)%2) temp = min(temp, abs(m2-i));
            if(temp < mini) part_i = i, mini = temp;
        }
    }
    if(part_i == -1) return;
    else counts += e-s;
    if(s != part_i) part(arr, s, part_i - 1);
    if(e != part_i) part(arr, part_i + 1, e);
}

int main(){
    int n, m; cin >> n >> m;
    int *arr = new int[n];
    for (int i = 0; i < n; i++) arr[i] = 0;
    for (int i = 0; i < m; i++) {
        int a; cin >> a; a--;
        arr[a] = 1;
    }
    part(arr, 0, n-1);
    cout << counts << endl;
    return 0;
}

- Anonymous September 22, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

#include <bits/stdc++.h>

using namespace std;
int counts = 0;
void part(int *arr, int s, int e){ //nlogn
    int part_i = -1, mini = e - s + 1;
    int m1 = (s+e)/2, m2 = (s+e)/2 + 1;
    for(int i = s; i <= e; i++){
        int temp = -1;
        if(arr[i]){
            temp = abs(m1 - i);
            if((s-e)%2) temp = min(temp, abs(m2-i));
            if(temp < mini) part_i = i, mini = temp;
        }
    }
    if(part_i == -1) return;
    else counts += e-s;
    if(s != part_i) part(arr, s, part_i - 1);
    if(e != part_i) part(arr, part_i + 1, e);
}

int main(){
    int n, m; cin >> n >> m;
    int *arr = new int[n];
    for (int i = 0; i < n; i++) arr[i] = 0;
    for (int i = 0; i < m; i++) {
        int a; cin >> a; a--;
        arr[a] = 1;
    }
    part(arr, 0, n-1);
    cout << counts << endl;
    return 0;
}

- Anonymous September 22, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

#include <bits/stdc++.h>

using namespace std;
int counts = 0;
void part(int *arr, int s, int e){ //nlogn
    int part_i = -1, mini = e - s + 1;
    int m1 = (s+e)/2, m2 = (s+e)/2 + 1;
    for(int i = s; i <= e; i++){
        int temp = -1;
        if(arr[i]){
            temp = abs(m1 - i);
            if((s-e)%2) temp = min(temp, abs(m2-i));
            if(temp < mini) part_i = i, mini = temp;
        }
    }
    if(part_i == -1) return;
    else counts += e-s;
    if(s != part_i) part(arr, s, part_i - 1);
    if(e != part_i) part(arr, part_i + 1, e);
}

int main(){
    int n, m; cin >> n >> m;
    int *arr = new int[n];
    for (int i = 0; i < n; i++) arr[i] = 0;
    for (int i = 0; i < m; i++) {
        int a; cin >> a; a--;
        arr[a] = 1;
    }
    part(arr, 0, n-1);
    cout << counts << endl;
    return 0;
}

- Pratik September 22, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Are the employee sitting in circular way

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

Are the employee sitting in circular way

- Rahul September 27, 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