AMCAT Coding Questions and Answers 2024, Get Amcat Coding Questions

AMCAT Coding Questions and Answers 2024 | AMCAT Coding Questions with Solutions | AMCAT Coding Interview Questions | Amcat Coding Questions | Amcat Coding Questions and Answers Pdf 

AMCAT Coding Questions and Answers 2024: The Coding Questions and Answers is very important in the IT Sector and Private Job Sector. Now days candidates are mostly interested in the off-Campus drive and private jobs. Eagerly prepare for the Coding Interview, Assessment Test, and attend the many samples online test for Private jobs. Following of the hiring, AMCAT issued the Off Campus Drive for eligible and capable candidates. The AMCAT Hiring selection process coding test, technical test etc., The Coding Interview round will be asked many questions through sample of C, C++, Java, Python Programming Languages. Thoroughly prepare for the AMCAT Coding Interview. Here we uploaded major common AMCAT Coding Questions and AMCAT Coding Interview Questions. Applicants must prepare AMCAT Coding Questions and Answers.

You have spent a time to solve the AMCAT Coding Questions while using this page. The Very AMCAT questions consist of each programming languages. So, candidates prepare all programming languages on one by one. Variety of the sample Amcat Coding Questions makes confidence to attend the AMCAT Hiring. Once you have selected in the AMCAT coding Interview round, you will be move on further selection process. The coding interview round is main part of the AMCAT Hiring. Candidates focused to prepare AMCAT Coding Questions and AMCAT Coding Interview Questions and Answers.

Amcat Coding Questions and Answers 

Question 1: Foundation Installation 

Fountains are installed at every position along a one-dimensional garden of length n. Array locations[] represents the coverage limit of these fountains. The ith fountain (where 1sisn) has a coverage limit of locations[i] that can range from the position max((i – locations[i]), 1) to min((i + locations[i]), n ). In other words, the h fountains do not reach outside the boundaries of the garden. In the beginning,all the fountains are switched off. Determine the minimum number of fountains that need to be activated to cover the n length garden by water.

Example

• n = 3
• locations[] = {0, 2, 13, then
  • For position 1: locations[1] = 0, max((1 – 0),
    • 1) to mini (1+0), 3) gives range = 1 to 1
  • For position 2: locations[2] = 2, max((2-2),
    • 1) to min( (2+2), 3) gives range = 1 to 3
  • For position 3: locations[3] = 1, max( (3-1),
    • 1) to min( (3+1), 3) gives range = 2 to 3

For the entire length of this garden to be covered, only the fountain at position 2 needs to be activated.

Function Description

Complete the function fountainActivation in the editor below.

fountainActivation has the following Parameter:

• int locations[n]: the fountain locations

Returns

• int: the minimum number of fountains that must be activated

Constraints

• 1<_n<_ 10^5
•  O<_locations[i] <_ mini (n,100) (where 1 <_1<_10^5)

► Input Format For Custom Testing

Sample Case 0

Sample Input For Custom Testing

• 3 ->locations[] size n = 3
• 1 ->locations[] [1, 1, 1
• 1 ->Sample Output

Sample Output

• 1

Explanation

Here, locations = {1, 1, 13

• For position 1: locations[1] = 1, maxi (1 -1), 1) to min((1+1), 3) gives range = 1 to 2
• For position 2: locations[2] = 1, max( (2 -1), 1) to min( (2+1), 3) gives range = 1 to 3
• For position 3: locations[3] = 1, max((3 -1), 1) to min((3+1), 3) gyes range = 2 to 3

If the 2nd fountain is active, the range from position 7 to 3 will be covered. The total number of fountains needed is 1.

C++ PROGRAM 

#include<bits/stdc++.h>

#define ll long long

using namespace std;

bool compare(pair < int, int > A, pair < int, int > B)

{

  if (A.first = B.first)

    return A.second < B.second;

  return A.first < B.first;

}

int solve(int location[], int n)

{

  pair < int, int > range[n];

  for (int i = 0; i < n; i++)

  {

    int id = i + 1;

    range[i].first = max(1, id - location[i]);

    range[i].second = min(n, id + location[i]);

  }

  sort(range, range + n, compare);

  int i = 0;

  int ans = 0;

  while (i < n)

  {

    pair < int, int > p = range[i];

    ans++;

    while (i + 1 < n && range[i].first == range[i + 1].first)

    {

      p.second = max(p.second, range[i + 1].second);

      i++;

    }

    //cout<<p.second<<" "<<i<<endl;

    while (i < n && range[i].second <= p.second)

      i++;

    //cout<<p.second<<" "<<i<<endl; } return ans; } int main() { int n; cin >> n;

  int location[n];

  for (int i = 0; i < n; i++) cin >> location[i];

  cout << solve(location, n) << endl;

  return 0;

}

JAVA PROGRAM 

import java.util.*;

class Main {

    static int minCntFoun(int a[], int N) {

        int[] dp = new int[N + 1];
        Arrays.fill(dp, -1);

        // Mark the reachable indices for each fountain
        for (int i = 0; i < N; i++) {
            int left = Math.max(i - a[i], 0);
            int right = Math.min(i + a[i]+1, N);
            dp[left] = Math.max(dp[left], right);
        }

        int cntfount = 1;
         int idxRight = dp[0];
        int idxNext = 0;

        // Traverse the reachable indices and activate fountains
        for (int i = 0; i < N; i++) {

            idxNext=Math.max(idxNext,dp[i]);
            if(i==idxRight){
            cntfount++;
            idxRight = idxNext;
            }

        }

        return cntfount;
    }

    // Driver Code
    public static void main(String[] args) {
        Scanner scan=new Scanner(System.in);
        int n = scan.nextInt();
        int[] location=new int[n];
        for(int i=0;i < n;i++){
            location[i]=scan.nextInt();

        }

        System.out.print(minCntFoun(location, n));
    }
}

#include<stdio.h>
#include<string.h>
int main() 
{
    int i,j;
    int num_box=0,k=0,sum=0,times=0,tst_case,temp=0;
    long c[10000],s[10000];
    printf("Enter the number of test case:");
    scanf("%d",&tst_case);
    printf("Enter the number of boxes:");
    for(int l=0;l<tst_case;l++)
    {
        scanf("%d",&num_box);
    }
    printf("Enter the number of candies in each box:");
    for(i=0;i<num_box;i++)
    {
        scanf("%ld",&c[i]);
    }
    for(i=0;i<num_box;i++)
    {
        for(j=i+1;j<num_box;j++) { if(c[i]>c[j])
            {
                temp=c[i];
                c[i]=c[j];
                c[j]=temp;
            }
        }
    }
    sum=0;
    k=0;
    for(i=0;i<num_box;i++)
    {
        sum=sum+c[i];
        s[k]=sum;
        k++;
    }
    times=0;
    printf("Minimum time requried:");
    for(i=1;i<k;i++)
    times=times+s[i];
    
    printf("%d\n",times);
    
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main() 
{
    int i,j;
    int num_box=0,k=0,sum=0,times=0,tst_case,temp=0;
    long c[10000],s[10000];
    cout<<("Enter the number of test case:");
    cin>>tst_case;
    cout<<("Enter the number of boxes:");
    for(int l=0;l<tst_case;l++) { cin>>num_box;
    }
    cout<<("Enter the number of candies in each box:");
    for(i=0;i<num_box;i++) { cin>>c[i];
    }
    for(i=0;i<num_box;i++)
    {
        for(j=i+1;j<num_box;j++) { if(c[i]>c[j])
            {
                temp=c[i];
                c[i]=c[j];
                c[j]=temp;
            }
        }
    }
    sum=0;
    k=0;
    for(i=0;i<num_box;i++)
    {
        sum=sum+c[i];
        s[k]=sum;
        k++;
    }
    times=0;
    cout<<("Minimum time requried:");
    for(i=1;i<k;i++)
    times=times+s[i];
    
    cout<<times;
    
    return 0;
}

import java.util.Scanner;
public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n, i, k = 0, sum = 0, s1 = 0, t, temp = 0, j;
        long c[] = new long[1000009];
        long s[] = new long[100009];
        System.out.println("Enter a no");
        t = sc.nextInt();
        for (int l = 0; l < t; l++)
        {
            n = sc.nextInt();
            for (i = 0; i < n; i++)
                c[i] = sc.nextLong();
            for (i = 0; i < n; i++) {
                for (j = i + 1; j < n; j++) { if (c[i] > c[j])
                    {
                        temp = (int) c[i];
                        c[i] = c[j];
                        c[j] = temp;
                    }
                }
            }
            sum = 0;
            k = 0;
            for (i = 0; i < n; i++)
            {
                sum = (int) (sum + c[i]);
                s[k] = sum;
                k++;
            }
            s1 = 0;
            for (i = 1; i < k; i++)
                s1 = (int) (s1 + s[i]);
            System.out.println(s1);
        }
    }

}

T =  int(input())
arr = []
arr1 = []
for i in range(0, T):
    N = int(input())
    for i in range(0, N):
        arr.append(int(input()))
        arr.sort()
        count = arr[0]
    for i in range(1, len(arr)):
        count = count + arr[i]
        arr1.append(count)
print(sum(arr1))

#include 
int rotLeft(int arr[], int n, int d)
{
    int i, j;
    int first;
    for(i=0; i<d; i++)
    {
        first = arr[0];
        for(j=0; j<n-1; j++)
        {
            arr[j] = arr[j+1];
        }
        arr[j] = first;
    }
    return *arr;
}
int main()
{
    int n, d, i;
    scanf("%d",&n);
    scanf("%d",&d);
    int list[n];
    for(i=0; i<n; i++)
    {
        scanf("%d",&list[i]);
    }
    rotLeft(list, n, d);
    for(i=0; i<n; i++)
    {
        printf("%d ",list[i]);
    }
}

#include<bits/stdc++.h>
using namespace std;
int rotLeft(int arr[], int n, int d)
{
    int i, j;
    int first;
    for(i=0; i<d; i++)
    {
        first = arr[0];
        for(j=0; j<n-1; j++) { arr[j] = arr[j+1]; } arr[j] = first; } return *arr; } int main() { int n, d, i; cin>>n;
    cin>>d;
    int list[n];
    for(i=0; i<n; i++) { cin>>list[i];
    }
    rotLeft(list, n, d);
    for(i=0; i<n; i++)
    {
        cout<<list[i]<<" ";
    }
}

import java.util.*;
class Main
{
    public static void rotateLeft(int a[],int n, int d)
    {
        int first,i,j;
        for(i=0;i<d;i++)
        {
            first=a[0];
            for(j=0;j<n-1;j++)
                a[j]=a[j+1];
            a[j]=first;
        }
    }
    public static void main(String[] args)
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int d=sc.nextInt();
        int a[]=new int[n];
        for(int i=0;i<n;i++)
            a[i]=sc.nextInt();
rotateLeft(a,n,d);

for(int i=0;i<n;i++)
System.out.print(a[i]+" ");
}
}

def rotateLeft(n,d,arr):
    for i in range(d):
        arr = rotatearr(n,arr)
    return arr
    
def rotatearr(n, arr):
    first = arr[0]
    for i in range(n-1):
        arr[i] = arr[i+1]
    arr[n-1] = first
    return arr

, d = map(int, input().split())
arr = list(map(int, input().split()))
for i in rotateLeft(n,d,arr):
    print(i, end=" ")

#include<bits/stdc++.h>

using namespace std;
map < char, char > M;
map < int, bool > prime;

int main() {
    prime[2] = true;
    prime[3] = true;
    prime[5] = true;
    prime[7] = true;
    char vow[] = {
        'a',
        'e',
        'i',
        'o',
        'u'
    };
    char con[] = {
        'b',
        'c',
        'd',
        'f',
        'g',
        'h'
    };
    int jv = 0, jc = 0;
    string s;
    cin >> s;
    for (auto i: s) {
        if (prime[i - '0']) {
            if (M[i]) {} else {
                M[i] = vow[jv];
                jv++;
            }
        } else if (M[i]) {} else {
            M[i] = con[jc];
            jc++;
        }
    }
    for (auto i: s) cout << M[i];
}

import java.util.*;
class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String vowel = "aeiou";
        char arr[] = new char[10];
        arr[2] = 'a';
        arr[3] = 'e';
        arr[5] = 'i';
        arr[7] = 'o';
        char ch = 'b';
        for (int i = 1; i < arr.length; i++) {
            if (vowel.indexOf(ch) != -1) {
                ch++;
                continue;
            } else if (arr[i] == 0)
                arr[i] = (char) ch++;
        }
        int temp = n;
        int res = 0;
        while (temp != 0) {
            res = res * 10 + temp % 10;
            temp = temp / 10;
        }
        int i = 1;
        while (res != 0) {
            System.out.print(arr[res % 10]);
            res = res / 10;
        }
    }

}

s = input()
res = []
x, y = 0, 0
v = "aeiou"
c = "bcdfgh"
p = "2357"
ans = sorted(set(s))
for i in ans:
    if i in p:
        res.append(v[x])
        x += 1
    else:
        res.append(c[y])
        y += 1
for i in s:
    print(res[ans.index(i)], end="")

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, p, m = INT_MAX, ans = 0;
    cin >> n;
    vector < int > a(n);
    for (int i = 0; i < n; i++) { cin >> p;
        if (p < m) {
            m = p;
            ans++;
        }
    }
    cout << ans - 1;
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        int n, p, ans = 0, m = Integer.MAX_VALUE;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            p = sc.nextInt();
            if (p < m) {
                m = p;
                ans++;
            }
        }
        System.out.print(ans - 1);
    }
}

n = int(input())
a = list(map(int, input().split()))
m = a[0]
ans = 0
for i in range(1, n):
    if a[i] < m:
        m = a[i]
        ans += 1
print(ans)

Find More Govt Jobs in

Railway Job

Government Exam Result

Competitive Exam

Upcoming Jobs

Defence job

Engineering Job