Problem Description Given an integer array of size n, find all elements that appear more than one-third of the time.  Input Format * The first line contains an integer N, representing the array's length. * The second line contains N space-separated integers. Output Format Print all elements that appear more

Problem Description You are given an array nums consisting of n objects that are colored red, white, or blue. The colors are represented by the following integers: * Red: 3 * White: 6 * Blue: 7 Your task is to sort the array in-place such that: 1. All objects of the same color

Problem Description Given an array of size N containing integers in the range of[1, N+1], the task is to find the missing number from the first N integers. The array is guaranteed to contain distinct integers, and exactly one integer from the range is missing. Input Format * The

Problem Description Write a program that accepts two integers, n and m, and prints all prime numbers between n and m (inclusive) such that the sum of their digits is also a prime number.  Input Format The first line contains two integers n and m. Output Format Print all prime

Problem Description Write a program that takes two integers, X and Y, as inputs. The program should find and print the number that is closest to X and is divisible by Y. Input Format * The first line contains two integers X and Y. Output Format Print the number which is

Problem Description Write a program that generates a modified password based on an initial password and an increment value, following these requirements: 1. The initial password must be at least 8 characters long. 2. It must contain at least: * One integer, * One special character from the set {'#', '

Problem Description Given an integer n, return true if it is an Armstrong number; otherwise, return false. An Armstrong number is a number that equals the sum of its own digits, each raised to the power of the number of digits.  Input Format The first line contains an integer N.

Problem Description Given two arrays, score (an array of integers) and names (an array of strings representing candidate names), where each names[i] corresponds to a score[i]. Assume that 0≤i<n and n=score.size()=names.size(). Print the name of the candidate with the highest score.

Problem Description Given an array of integers, nums, print all possible combinations of the elements in nums. Each combination should include any subset of elements, from the empty set to the entire array. Input Format * The first line contains an integer N, representing the length of the array. * The second

Problem Description Remove all the duplicate words from the string.  Duplicate words are the ones which occurs more than ones in a string. Input Format * The first line contains a string S. Output Format Print the modified string S after removing all the duplicate words. Constraints * 1 ≤ S.length ≤ 10³

Problem Description You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in the array.   Return the sum of all the unique elements of nums. Input Format * The first line contains an integer N, representing the length of the array.

Problem Description Given an integer array nums, the task is to find the contiguous subarray (containing at least one number) that has the largest sum and return that sum. Input Format * The first line contains an integer N, representing the length of the array. * The second line contains N space-separated

Problem Description You are tasked with writing a program to calculate the total shipping cost based on the weight of the package and the distance it needs to travel. The following criteria determine the shipping cost: 1. Base money: $5.00 (must be included in the shipping cost) 2. Cost

Problem Description Given an array of integer nums and an integer k, return the total number of subarrays whose sum equals k. A subarray is a contiguous non-empty sequence of elements within an array.   Input Format * The first line contains an integer N, representing the length of the array. * The