Cerinta completa Priyanka works for an international toy company that ships by container. Her task is to the determine the lowest cost way to combine her orders for shipping. She has a list of item weights. The shipping company has
Pairs
Cerinta completa Given an array of integers and a target value, determine the number of pairs of array elements that have a difference equal to the target value. Example There are three values that differ by : , , and
New Year Chaos
Cerinta completa It is New Year’s Day and people are in line for the Wonderland rollercoaster ride. Each person wears a sticker indicating their initial position in the queue from to . Any person can bribe the person directly in
Organizing Containers of Balls
Cerinta completa David has several containers, each with a number of balls in it. He has just enough containers to sort each type of ball he has into its own container. David wants to sort the balls using his sort
Modify The Sequence
Cerinta completa You are given a sequence of integers a1,a2,a3…..an. You are free to replace any integer with any other positive integer. How many integers must be replaced to make the resulting sequence strictly increasing? Input Format The first line
Points in a Plane
Cerinta completa There are N points on an XY plane. In one turn, you can select a set of collinear points on the plane and remove them. Your goal is to remove all the points in the least number of
Non-Divisible Subset
Cerinta completa Given a set of distinct integers, print the size of a maximal subset of where the sum of any numbers in is not evenly divisible by . Example One of the arrays that can be created is .
Missing Numbers
Cerinta completa Given two arrays of integers, find which elements in the second array are missing from the first array. Example The array is the orginal list. The numbers missing are . Notes If a number occurs multiple times in
Nikita and the Game
Cerinta completa Nikita just came up with a new array game. The rules are as follows: Initially, Nikita has an array of integers. In each move, Nikita must partition the array into non-empty contiguous parts such that the sum of
Morgan and a String
Cerinta completa Jack and Daniel are friends. Both of them like letters, especially uppercase ones. They are cutting uppercase letters from newspapers, and each one of them has his collection of letters stored in a stack. One beautiful day, Morgan
