TCS Ninja Coding Questions and Answers 2023

n, k = map(int, input().split())
arr = list(map(int, input().split()))
print(min((n - len(set(arr)) + 1) * k, k + (n - len(set(arr)) + 1)))

#include <iostream>
#include <vector>
#include <algorithm>
#include <climits> // Added header for INT_MAX
using namespace std;

int calculateInefficiency(const vector& salaries, int numTables, int tableCost) {
    int inefficiency = 0;
    int argumentsCount = 0;

    for (int i = 0; i < numTables; i++) {
        int tableArguments = 0;
        vector&ltint&gt tableEmployees;

        // Get the employees sitting at the current table
        for (int j = i; j < salaries.size(); j += numTables) {
            tableEmployees.push_back(salaries[j]);
        }

        // Count the number of arguments at the current table
        sort(tableEmployees.begin(), tableEmployees.end());
        for (int j = 1; j < tableEmployees.size(); j++) {
            if (tableEmployees[j] == tableEmployees[j - 1]) {
                tableArguments++;
            }
        }

        inefficiency += tableCost + tableArguments;
        argumentsCount = max(argumentsCount, tableArguments);
    }

    inefficiency -= argumentsCount;
    return inefficiency;
}

int findOptimalInefficiency(const vector& salaries, int numTables, int tableCost) {
    int minInefficiency = INT_MAX;

    // Generate all possible combinations of tables
    for (int i = 1; i <= numTables; i++) {
        int inefficiency = calculateInefficiency(salaries, i, tableCost);
        minInefficiency = min(minInefficiency, inefficiency);
    }

    return minInefficiency;
}

int main() {
    int N, K;
    cout << "Enter the number of employees: ";
    cin >> N;

    vector salaries(N);
    cout << "Enter the salaries of employees: ";
    for (int i = 0; i < N; i++) {
        cin >> salaries[i];
    }

    cout << "Enter the cost of renting each table: ";
    cin >> K;

    int optimalInefficiency = findOptimalInefficiency(salaries, N, K);
    cout << "The optimal inefficiency is: " << optimalInefficiency << endl;

    return 0;
}

import java.util.*;

public class Main {
    public static int calculateInefficiency(int[] salaries, int numTables, int tableCost) {
        int inefficiency = 0;
        int argumentsCount = 0;

        for (int i = 0; i < numTables; i++) {
            int tableArguments = 0;
            List tableEmployees = new ArrayList<>();

            // Get the employees sitting at the current table
            for (int j = i; j < salaries.length; j += numTables) {
                tableEmployees.add(salaries[j]);
            }

            // Count the number of arguments at the current table
            Collections.sort(tableEmployees);
            for (int j = 1; j < tableEmployees.size(); j++) {
                if (tableEmployees.get(j).equals(tableEmployees.get(j - 1))) {
                    tableArguments++;
                }
            }

            inefficiency += tableCost + tableArguments;
            argumentsCount = Math.max(argumentsCount, tableArguments);
        }

        inefficiency -= argumentsCount;
        return inefficiency;
    }

    public static int findOptimalInefficiency(int[] salaries, int numTables, int tableCost) {
        int minInefficiency = Integer.MAX_VALUE;

        // Generate all possible combinations of tables
        for (int i = 1; i <= numTables; i++) {
            int inefficiency = calculateInefficiency(salaries, i, tableCost);
            minInefficiency = Math.min(minInefficiency, inefficiency);
        }

        return minInefficiency;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the number of employees: ");
        int N = scanner.nextInt();

        int[] salaries = new int[N];
        System.out.print("Enter the salaries of employees: ");
        for (int i = 0; i < N; i++) {
            salaries[i] = scanner.nextInt();
        }

        System.out.print("Enter the cost of renting each table: ");
        int K = scanner.nextInt();

        int optimalInefficiency = findOptimalInefficiency(salaries, N, K);
        System.out.println("The optimal inefficiency is: " + optimalInefficiency);
    }
}