CampEd - Aceprep


minimum_cars	Minimum Cars	N friends want to go to a restaurant for a party. Find the minimum number of cars required to accommodate all the friends. Note : A single car can accommodate 4 people. Input:-4 4 2 7 98 Input Description: The first line contains A single integer T - The number of test cases. Then The test cases follow. -The first and only line of each test case contains an integer N - denoting The number of friends. Output: 1 1 2 25 Output Description: For each test case, output the minimum number of cars required to accommodate all the friends. Constraints: 1<=T<=1000 2<=N<=1000 Explanation: Test Case 1: There are only 4 friends and a single car can accommodate 4 people. Thus, only 1 car is required. Test Case 2: There are only 2 friends and a single car can accommodate 4 people. Thus, only 1 car is required Test Case 3: There are 7 friends and 2 cars can accommodate 8 people. Thus, 2 cars are required.	EASY
array_destructuring	Array Destructuring	Use array destructuring to extract the first and third elements into variables. Input:-"(apple,banana,cherry)" Input Description: Input: Array Output: "(apple,cherry)" Output Description: First and third elements as variables. Constraints: 1 <= array length <= 1000 Explanation:	EASY
movement_in_arrays	Movement in arrays	Consider an array A of size N. You start from the index 0 and your goal is to reach index N-1 in exactly M moves. At any index, you can move forward or backward by a number of steps that is equal to a prime divisor of the value which exists at that index. You cannot go beyond the array while going forward or backward. Write a program to determine whether it is possible to reach index N-1 in M moves. Input:-2 3 2 3 2 1 6 3 2 2 2 2 2 3 Input Description: First line: T (number of test cases) First line in each test case: N Second line in each test case: N space-separated integers (denoting the array A) Third line in each test case: M Output: YES NO Output Description: For each test case, print YES or NO depending upon the result. Constraints: 1<= T <=10 2<= N<=40 1<=A[i]<=10^6 1<= M <= 10^6 Explanation: null	HARD
podium_finish	Podium Finish	Sam got his dream seat in F1 and secured a 3rd place in his debut race. He now wants to know the time gap between him and the winner of the race. You are his chief engineer and you only know the time gap between sam and the runner up of the race, given as A seconds, and the time gap between the runner up and the winner of the race, given as B seconds. Please calculate and inform sam about the time gap between him and the winner of the race. Input:-4 1 1 2 5 3 2 5 6 Input Description: The first line of input will contain A single integer T, denoting The number of test cases. -each test case consists of A single line of input containing two space-separated integers A and B denoting The time gap between sam and The runner up and The time gap between The runner up and The winner respectively. Output: 2 7 5 11 Output Description: For each test case, output The time gap between sam and The winner of The race. Constraints: 1<=T<=100 1<=A,B<=10 Explanation: Test case 1: The time gap between sam and runner up is 1 second. The time gap between runner up and the winner is 1 second. Thus, the time gap between sam and the winner is 1+1=2 seconds. Test case 2: The time gap between sam and runner up is 2 seconds. The time gap between runner up and the winner is 5 second. Thus, the time gap between sam and the winner is 2+5=7 seconds. Test case 3: The time gap between sam and runner up is 3 seconds. The time gap between runner up and the winner is 2 second. Thus, the time gap between sam and the winner is 3 + 2 = 5 seconds. Test case 4: The time gap between sam and runner up is 5 seconds. The time gap between runner up and the winner is 6 second. Thus, the time gap between sam and the winner is 5 + 6 = 11 seconds.	EASY
battle_ready	Battle Ready	An army chief was known to be a very superstitious person. He believed that a soldier is "lucky" if the soldier is holding an even number of weapons, and "unlucky" otherwise. He considered the army as "READY FOR BATTLE" if the count of "lucky" soldiers is strictly greater than the count of "unlucky" soldiers, and "NOT READY" otherwise. Given the number of weapons each soldier is holding, your task is to determine whether the army formed by all these soldiers is "READY FOR BATTLE" or "NOT READY". Input:-4 11 12 13 14 Input Description: The first line of input consists of a single integer N denoting the number of soldiers. The second line of input consists of N space separated integers A1, A2, ..., AN, where Ai denotes the number of weapons that the ith soldier is holding. Output: NOT READY Output Description: Generate one line output saying "READY FOR BATTLE", if the army satisfies the conditions that Kattapa requires or "NOT READY" otherwise (quotes for clarity). Constraints: 1 <= N <= 100 1 <= Ai <= 100 Explanation: In this example : N = 4 and the array A = [11, 12, 13, 14]. The 1st soldier is holding 11 weapons (which is odd), the 2nd soldier is holding 12 weapons (which is even), the 3rd soldier is holding 13 weapons (which is odd), and the 4th soldier is holding 14 weapons (which is even). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 2. Notice that we have an equal number of people holding even number of weapons and odd number of weapons. The answer here is "NOT READY" since the number of soldiers holding an even number of weapons is not strictly greater than the number of soldiers holding an odd number of weapons.	EASY
juice_business	Juice business	While Sam was drinking sugarcane juice, he started wondering about the following facts: -The juicer sells each glass of sugarcane juice for 50 coins. -He spends 20% of his total income on buying sugarcane. -He spends 20% of his total income on buying salt and mint leaves. -He spends 30% of his total income on shop rent. Sam wonders, what is the juicer's profit (in coins) when he sells N glasses of sugarcane juice? Input:-4 2 4 5 10 Input Description: The first line of input will contain an integer T — The number of test cases. The description of T test cases follows. -The first and only line of each test case contains an integer N, as described in The problem statement. Output: 30 60 75 150 Output Description: For each test case, output on a new line the juicer's profit when he sells N glasses of juice. Constraints: 1<=T<=1000 1<=N<=10^6 Explanation: Test case 1: The total income is 50×2=100 coins. The juicer spends 20 coins on sugarcane, 20 coins on salt and mint leaves and 30 coins on rent. Thus,the profit is 100?(20+20+30)=30 coins. Test case 2: The total income is 50×4=200 coins. The juicer spends 40 coins on sugarcane, 40 coins on salt and mint leaves and 60 coins on rent. Thus, the profit is 200?(40+40+60)=60 coins. Test case 3: The total income is 50×5=250 coins. The juicer spends 50 coins on sugarcane, 50 coins on salt and mint leaves and 75 coins on rent. Thus, the profit is 250?(50+50+75)=75 coins. Test case 4: The total income is 50×10=500 coins. The juicer spends 100 coins on sugarcane, 100 coins on salt and mint leaves and 150 coins on rent. Thus, the profit is 500?(100+100+150)=150 coins.	EASY
find_minimum_in_rotated_sorted_array_ii	Find Minimum in Rotated Sorted Array II	Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become: [4,5,6,7,0,1,4] if it was rotated 4 times. [0,1,4,4,5,6,7] if it was rotated 7 times. Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]]. Given the sorted rotated array nums that may contain duplicates, return the minimum element of this array. You must decrease the overall operation steps as much as possible. Input:-38355 Input Description: Single line list input contain spaces separated integers Output: 1 Output Description: return the minimum element of this array Constraints: 1) n == nums.length 2) 1 <= n <= 5000 3) -5000 <= nums[i] <= 5000 4) nums is sorted and rotated between 1 and n times. Explanation: null	HARD
course-enrollment-system-for-an-lms	Course Enrollment System for an LMS	You are tasked with building a simple Course Enrollment System for an LMS. The system should handle students enrolling in courses, as well as the ability to manage course capacities. Your goal is to implement the following functionality: 1. Create Courses: Each course has a name, a capacity (maximum number of students allowed), and a list of enrolled students. 2. Create Students: Each student has a name and can enroll in multiple courses. 3. Enroll Students in Courses: A student can enroll in a course if the course has available spots. If a course is full, the enrollment should fail with an appropriate error message. 4. Check Enrollment: A student should not be allowed to enroll in the same course twice. Attempting to do so should return an error message. 5. Drop a Course: A student can drop a course they are enrolled in, freeing up a spot in the course for other students. 6. Enrollment Summary: After enrolling or dropping, return the number of remaining spots in the course. Requirements: 1. Course Class: • Should store the course name, the total capacity, and a list of enrolled students. • The enroll(student) method should check if the course has spots available and whether the student is already enrolled. If so, add the student to the course; otherwise, return an appropriate message. • The drop(student) method should allow a student to drop the course, freeing up a spot. 2. Student Class: • Should store the student’s name and a list of courses they are enrolled in. • The enroll_in_course(course) method should enroll the student in a course if they are not already enrolled and if there are available spots. • The drop_course(course) method should allow the student to drop the course. 3. Edge Cases: • Ensure a student cannot enroll in the same course twice. • Ensure a student cannot drop a course they are not enrolled in. • Ensure course capacity is respected during enrollments and drops.	MEDIUM
two-sum	Two Sum	Given an array of integers, return indices of the two numbers such that they add up to a specific target.	EASY
maximum-subarray-sum	Maximum Subarray Sum	Write a function to find the contiguous subarray within a one-dimensional array arr of integers which has the largest sum. Return the sum of this subarray.	EASY
minimum-number-of-coins-to-make-change	Minimum Number Of Coins To Make Change	Given an array of coins or denominations and a target sum, calculate the minimum number of coins required to match the total. Note that the coins array will have denominations that are Infinitely available, i.e. coins can be repeated and added to calculate the target.	MEDIUM

0 of 11 row(s) selected.

Rows per page

Page 1 of 1

Solve

Minimum Cars

N friends want to go to a restaurant for a party. Find the minimum number of cars required to accommodate all the friends. Note : A single car can accommodate 4 people. Input:-4 4 2 7 98 Input Description: The first line contains A single integer T - The number of test cases. Then The test cases follow. -The first and only line of each test case contains an integer N - denoting The number of friends. Output: 1 1 2 25 Output Description: For each test case, output the minimum number of cars required to accommodate all the friends. Constraints: 1<=T<=1000 2<=N<=1000 Explanation: Test Case 1: There are only 4 friends and a single car can accommodate 4 people. Thus, only 1 car is required. Test Case 2: There are only 2 friends and a single car can accommodate 4 people. Thus, only 1 car is required Test Case 3: There are 7 friends and 2 cars can accommodate 8 people. Thus, 2 cars are required.

EASY

Array Destructuring

Use array destructuring to extract the first and third elements into variables. Input:-"(apple,banana,cherry)" Input Description: Input: Array Output: "(apple,cherry)" Output Description: First and third elements as variables. Constraints: 1 <= array length <= 1000 Explanation:

EASY

Movement in arrays

Consider an array A of size N. You start from the index 0 and your goal is to reach index N-1 in exactly M moves. At any index, you can move forward or backward by a number of steps that is equal to a prime divisor of the value which exists at that index. You cannot go beyond the array while going forward or backward. Write a program to determine whether it is possible to reach index N-1 in M moves. Input:-2 3 2 3 2 1 6 3 2 2 2 2 2 3 Input Description: First line: T (number of test cases) First line in each test case: N Second line in each test case: N space-separated integers (denoting the array A) Third line in each test case: M Output: YES NO Output Description: For each test case, print YES or NO depending upon the result. Constraints: 1<= T <=10 2<= N<=40 1<=A[i]<=10^6 1<= M <= 10^6 Explanation: null

HARD

Podium Finish

Sam got his dream seat in F1 and secured a 3rd place in his debut race. He now wants to know the time gap between him and the winner of the race. You are his chief engineer and you only know the time gap between sam and the runner up of the race, given as A seconds, and the time gap between the runner up and the winner of the race, given as B seconds. Please calculate and inform sam about the time gap between him and the winner of the race. Input:-4 1 1 2 5 3 2 5 6 Input Description: The first line of input will contain A single integer T, denoting The number of test cases. -each test case consists of A single line of input containing two space-separated integers A and B denoting The time gap between sam and The runner up and The time gap between The runner up and The winner respectively. Output: 2 7 5 11 Output Description: For each test case, output The time gap between sam and The winner of The race. Constraints: 1<=T<=100 1<=A,B<=10 Explanation: Test case 1: The time gap between sam and runner up is 1 second. The time gap between runner up and the winner is 1 second. Thus, the time gap between sam and the winner is 1+1=2 seconds. Test case 2: The time gap between sam and runner up is 2 seconds. The time gap between runner up and the winner is 5 second. Thus, the time gap between sam and the winner is 2+5=7 seconds. Test case 3: The time gap between sam and runner up is 3 seconds. The time gap between runner up and the winner is 2 second. Thus, the time gap between sam and the winner is 3 + 2 = 5 seconds. Test case 4: The time gap between sam and runner up is 5 seconds. The time gap between runner up and the winner is 6 second. Thus, the time gap between sam and the winner is 5 + 6 = 11 seconds.

EASY

Battle Ready

An army chief was known to be a very superstitious person. He believed that a soldier is "lucky" if the soldier is holding an even number of weapons, and "unlucky" otherwise. He considered the army as "READY FOR BATTLE" if the count of "lucky" soldiers is strictly greater than the count of "unlucky" soldiers, and "NOT READY" otherwise. Given the number of weapons each soldier is holding, your task is to determine whether the army formed by all these soldiers is "READY FOR BATTLE" or "NOT READY". Input:-4 11 12 13 14 Input Description: The first line of input consists of a single integer N denoting the number of soldiers. The second line of input consists of N space separated integers A1, A2, ..., AN, where Ai denotes the number of weapons that the ith soldier is holding. Output: NOT READY Output Description: Generate one line output saying "READY FOR BATTLE", if the army satisfies the conditions that Kattapa requires or "NOT READY" otherwise (quotes for clarity). Constraints: 1 <= N <= 100 1 <= Ai <= 100 Explanation: In this example : N = 4 and the array A = [11, 12, 13, 14]. The 1st soldier is holding 11 weapons (which is odd), the 2nd soldier is holding 12 weapons (which is even), the 3rd soldier is holding 13 weapons (which is odd), and the 4th soldier is holding 14 weapons (which is even). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 2. Notice that we have an equal number of people holding even number of weapons and odd number of weapons. The answer here is "NOT READY" since the number of soldiers holding an even number of weapons is not strictly greater than the number of soldiers holding an odd number of weapons.

EASY

Juice business

While Sam was drinking sugarcane juice, he started wondering about the following facts: -The juicer sells each glass of sugarcane juice for 50 coins. -He spends 20% of his total income on buying sugarcane. -He spends 20% of his total income on buying salt and mint leaves. -He spends 30% of his total income on shop rent. Sam wonders, what is the juicer's profit (in coins) when he sells N glasses of sugarcane juice? Input:-4 2 4 5 10 Input Description: The first line of input will contain an integer T — The number of test cases. The description of T test cases follows. -The first and only line of each test case contains an integer N, as described in The problem statement. Output: 30 60 75 150 Output Description: For each test case, output on a new line the juicer's profit when he sells N glasses of juice. Constraints: 1<=T<=1000 1<=N<=10^6 Explanation: Test case 1: The total income is 50×2=100 coins. The juicer spends 20 coins on sugarcane, 20 coins on salt and mint leaves and 30 coins on rent. Thus,the profit is 100?(20+20+30)=30 coins. Test case 2: The total income is 50×4=200 coins. The juicer spends 40 coins on sugarcane, 40 coins on salt and mint leaves and 60 coins on rent. Thus, the profit is 200?(40+40+60)=60 coins. Test case 3: The total income is 50×5=250 coins. The juicer spends 50 coins on sugarcane, 50 coins on salt and mint leaves and 75 coins on rent. Thus, the profit is 250?(50+50+75)=75 coins. Test case 4: The total income is 50×10=500 coins. The juicer spends 100 coins on sugarcane, 100 coins on salt and mint leaves and 150 coins on rent. Thus, the profit is 500?(100+100+150)=150 coins.

EASY

Find Minimum in Rotated Sorted Array II

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become: [4,5,6,7,0,1,4] if it was rotated 4 times. [0,1,4,4,5,6,7] if it was rotated 7 times. Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]]. Given the sorted rotated array nums that may contain duplicates, return the minimum element of this array. You must decrease the overall operation steps as much as possible. Input:-38355 Input Description: Single line list input contain spaces separated integers Output: 1 Output Description: return the minimum element of this array Constraints: 1) n == nums.length 2) 1 <= n <= 5000 3) -5000 <= nums[i] <= 5000 4) nums is sorted and rotated between 1 and n times. Explanation: null

HARD

Course Enrollment System for an LMS

You are tasked with building a simple Course Enrollment System for an LMS. The system should handle students enrolling in courses, as well as the ability to manage course capacities. Your goal is to implement the following functionality: 1. Create Courses: Each course has a name, a capacity (maximum number of students allowed), and a list of enrolled students. 2. Create Students: Each student has a name and can enroll in multiple courses. 3. Enroll Students in Courses: A student can enroll in a course if the course has available spots. If a course is full, the enrollment should fail with an appropriate error message. 4. Check Enrollment: A student should not be allowed to enroll in the same course twice. Attempting to do so should return an error message. 5. Drop a Course: A student can drop a course they are enrolled in, freeing up a spot in the course for other students. 6. Enrollment Summary: After enrolling or dropping, return the number of remaining spots in the course. Requirements: 1. Course Class: • Should store the course name, the total capacity, and a list of enrolled students. • The enroll(student) method should check if the course has spots available and whether the student is already enrolled. If so, add the student to the course; otherwise, return an appropriate message. • The drop(student) method should allow a student to drop the course, freeing up a spot. 2. Student Class: • Should store the student’s name and a list of courses they are enrolled in. • The enroll_in_course(course) method should enroll the student in a course if they are not already enrolled and if there are available spots. • The drop_course(course) method should allow the student to drop the course. 3. Edge Cases: • Ensure a student cannot enroll in the same course twice. • Ensure a student cannot drop a course they are not enrolled in. • Ensure course capacity is respected during enrollments and drops.

MEDIUM

Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

EASY

Maximum Subarray Sum

Write a function to find the contiguous subarray within a one-dimensional array arr of integers which has the largest sum. Return the sum of this subarray.

EASY

Minimum Number Of Coins To Make Change

Given an array of coins or denominations and a target sum, calculate the minimum number of coins required to match the total. Note that the coins array will have denominations that are Infinitely available, i.e. coins can be repeated and added to calculate the target.

MEDIUM