Accenture Coding Question 21

July 29, 2023

6 comments on “Accenture Coding Question 21”


  • sujalbhimanwar08

    import java.util.*;
    class HelloWorld {
    public static void main(String[] args) {
    int[] arr={3,2,1,-4,6,3,1};
    int n=arr.length;
    int k=3;
    int max=Integer.MAX_VALUE;
    int count=0;
    ArrayList list=new ArrayList();
    ArrayList list1=new ArrayList();
    for(int i=0;i<n-k-1;i++){
    for(int j=i;jcount){
    max=count;
    list1=new ArrayList(list);
    }
    count=0;
    list.clear();
    }
    System.out.println(list1);
    }
    }


  • Ashish

    kindly make an option to hover over previous or next questions. It is very hectic to go back and find the question again.


  • Shrutika

    #include
    #include
    using namespace std;

    int fun(int arr1[],int size, int k1){

    if(k1size){
    return 0;
    }

    vector minsum;

    for(int i=0;i<=size-k1;i++){
    int sum=0;
    for(int j=i; j<i+k1; j++){
    cout<<arr1[j]<<" ";
    sum+=arr1[j];

    }
    minsum.push_back(sum);
    cout<<endl;
    }
    sort(minsum.begin(), minsum.end());

    return minsum[0];
    }

    int main(){
    int n=7;
    int k=3;
    int arr[n]={3, 2, 1, -4, 6, 3, 1};
    cout<<fun(arr,n,k);
    return 0;
    }


  • SUMIT

    #include
    using namespace std;

    void solve(int arr[],int n,int k){
    int ans = 0;
    int minsum = 100;
    for(int i=0;i<=n-k;i++){
    int sum = 0;
    for(int j = i;j<i+k;j++){
    sum+=arr[j];
    }
    // cout<<"sum is: "<<sum<<endl;
    if(sum<minsum){
    minsum=sum;
    ans=i;
    }
    // cout<<"minsum is: "<<minsum<<endl;
    }
    for(int i=ans;i<ans+k;i++){
    cout<<arr[i]<<" ";
    }
    }
    int main()
    {
    int arr[]={3,2,1,-4,6,3,1,-5};
    int n = sizeof(arr)/sizeof(arr[0]);
    int k = 3;
    solve(arr,n,k);

    return 0;
    }