Search & Filtering
In a wedding that you are attending, there are some chairs that have digits inscribed at their
backs. The chairs are lined in a row such that they form a string of the digits. Find the
minimum number of sets M that can be formed from these digits such that:
1. The number of digits in each set is one gf more than one.
2. Each set is formed using consecutive digits and no digit can be used more than once.
3. In each set, the number formed using the digits is less than or equal to Y.
Victor has an array of size n. He loves to play with these n numbers. Each time he plays
with them, he picks up any two consecutive numbers and adds them. On adding both the
numbers, it costs him k*(sum of both numbers).
Find the minimum cost of adding all the numbers in the array.
Input Specification:
input1: Size of array.
input2: Elements of the array.
input3: Value of k.
Output Specification:
Return the minimum cost of adding all the numbers of the array.
Charles wants to buy a necklace in which.
1. There is a minimum of 1 pearl and maximum of X pearls, such that each
pearl has its own magnificent coefficient
2. The pearls should be in non-decreasing order of their magnificence power.
You are given the maximum number of pearls in a necklace and the range of
the magnificent coefficients of the pearls. Find the number of necklaces that
can be made that follow the mentioned conditions.
10, 50, 30, 40, 20.
Define an array that will store the values
and use the bubble sort to display them in
descending order and in ascending order.
Results 'can' look like this:
Before Desc Asce
10 50 10
50 40 20
30 30 30
40 20 40
20 10 50
Your application must contain the following functionalities. Use constructors, getter
and setter functions.
a. For each employee your application must have the details such as
name, empid, department, designation, experience, basicPay, DA,
gradePay, personalPay, iTax, professionalTax, epf
b. Get the employee details from user(admin)
c. In the menu give the user options to add, edit, delete or display the
employee details.
You must write a small application in JAVA that stores SRC candidate names and the votes they received. Your program must: 1. Create an array of SRC candidate names. Populate the array with ten names. 2. Create an array of votes. Populate the array with the number of votes for every candidate. The two arrays work in parallel. 3. Print the name of every candidate with his/her number of votes. 4. Print the total number of votes casted. 5. Add votes for a specific candidate. a. Read the name of the candidate b. Add one vote for the specific candidate c. Print the name of the candidate and his/her number of votes
You must write a small application in JAVA that stores SRC candidate names and the votes they received. Your program must: 1. 2. Create an array of SRC candidate names. Populate the array with ten names. Create an array of votes. Populate the array with the number of votes for every candidate. The two arrays work in parallel. 3. 4. 5. Print the name of every candidate with his/her number of votes. Print the total number of votes casted. Add votes for a specific candidate. a.
Write a program that replaces two or more consecutive blanks in a string by a
single
blank. For example, if the input is
Grim return to the planet of apes !!
the output should be
Grim return to the planet of apes!!
Each student has a number associated with them representing their problem-solving capability. The higher the capability the higher the chances of selection. Now every student wants to know the number of students ahead of him with higher problem-solving capability.
Input: 6(number of students) {4 , 9 , 5 , 3 , 2 , 10}
Output: {0 , 0 , 1 , 3 , 4 , 0}
