**？**Good algorithm for combining items from N lists into one with balanced distribution?

Let's say I have the three following listsA1A2A3 B1B2C1C2C3C4C5 I'd like to combine them into a single list, with the items from each list as evenly distributed as possible sorta like this:C1A1C2B1C

**？**Algorithm to maximize the distance (avoid repetition) of picking elements from sets

I'm looking to find an algorithm that successfully generalizes the following problem to n number of sets, but for simplicity assume that there are 4 different sets, each containing 4 elements. Also we

**？**Efficient algorithm for ordering different types of objects

Given that we have a collection of videos of different types (say types A,B and C,...), we are looking for an efficient algorithm to order these objects into a playlist so that we have maximum dispers

**？**how to find all integer solutions to sum(xi) =b, with linear constraints

Suppose sum(xi) = 10, 0<= xi <= 2, i = 1, 2, ..., 10. How to find all integer solutions for xi. thank you. I have read about Euclidean algorithm, but it looks like just for two unknown variables

**？**how to find all integer solutions to sum(xi) =b, with linear constraints

Suppose sum(xi) = 10, 0<= xi <= 2, i = 1, 2, ..., 10. How to find all integer solutions for xi. thank you. I have read about Euclidean algorithm, but it looks like just for two unknown variables

**？**how to find all integer solutions to sum(xi) =b, with linear constraints

Suppose sum(xi) = 10, 0<= xi <= 2, i = 1, 2, ..., 10. How to find all integer solutions for xi. thank you. I have read about Euclidean algorithm, but it looks like just for two unknown variables

**？**Is there an algorithm for choosing a few strings from a list so that the number of strings equal the number of different letters in them?

Edit2: I think the solution of David Eisenstat works but I will check it before I call the question solved.Example list of strings:1.) "a"2.) "ab"3.) "bc"4.) "dc"5.) "efa"6.) "ef"7.)

**？**How to solve the equation sum{max(a_i, x)}=y with variable x? Is there any algorithm with O(n) time complexity?

I am trying to find an algorithm to solve the following equation: ∑ max(ai, x) = yin which the ai are constants and x is the variable.I can find an algorithm with O(n log n) time complexity as follow

**？**Solving a linear program in case of an equality constraint

I had asked a question, which can be found here : Computing the optimal combination And had been suggested Linear programming. I have looked up Linear programming and the Simplex method. But all the e

**？**Minimize sum of distances in point pairs

I have a bunch of points on a 2-dimensional Grid. I want to group the Points into pairs, while minimizing the sum of the euclidean distances between the points of the pairs.Example:Given the points: p

**？**degenerate in simplex method

I am reading about linear programming using simplex method in book Introduction to Algorithm Design and analysis.I am having difficulty in understanding text. Here is text snippet. The principal adva

**？**Equation for testing if a point is inside a circle

If you have a circle with center (center_x, center_y) and radius radius, how do you test if a given point with coordinates (x, y) is inside the circle? In general, x and y must satisfy (x - center

**？**Sort points in clockwise order?

Given an array of x,y points, how do I sort the points of this array in clockwise order (around their overall average center point)? My goal is to pass the points to a line-creation function to end up

**？**Count number of points inside a circle fast

Given a set of n points on plane, I want to preprocess these points somehow faster than O(n^2) (O(nlog(n)) preferably), and then be able to answer on queries of the following kind "How many of n poin

**？**Subdivided icosahedron - how to find the nearest vertex to an arbitrary point

I have an application that creates an approximation to sphere by subdividing an icosahedron. The Cartesian vertex coordinates are converted to spherical coordinates so that all vertices sit on the sur

**？**Determining a mean camber line

Fellow programmers,I know this is a little outside your juridistiction, but I was wondering perhaps if you have time, if you could help me with one "procedure". Not in view of math but what would be t