I have had this problem for an interview and can't seem to wrap my mind around how to solve it. I have not found any tutorials that explains the logic ...

I'm trying to implement the k-partitioning version of the Karmarkar-Karp heuristic number partitioning algorithm. But I'm struggling with its second p ...

I'm using AWS Athena to query S3 bucket, that have partitioned data by day only, the partitions looks like day=yyyy/mm/dd. When I tried to us Glue to ...

So somehow a relative of mine got these restaurant vouchers that can be used to deduct 500 baht off of each receipt. It is possible to ask the restaur ...

I have an array with recipes from 3 categories, breakfast, lunch and dinner. Each of these categories, have 10 unique recipes. I'd like to sort and ...

I'm trying to make a function that takes an array of numbers and gives you every combination those numbers can be in, in two arrays. My problem is th ...

My rules: Duplicates are allowed negative numbers are allowed obviously Since i mentioned partition, it means you cannot put an element from ...

Can somebody solve this problem on Python ? A positive integer m can be partitioned as primes if it can be written as p + q where p > 0, q > 0 ...

I'm making a matchmaking client that matches 10 people together into two teams: Each person chooses four people they would like to play with, ranked ...

Given a list of integers. Find out whether it can be divided into two sublists with equal sum. The numbers in the list is not sorted. For example: A ...

I'm pretty new to scheme overall and I'm having some issues with figuring out an assignment for school. So please no full answers, just looking for a ...

I am dealing with an algorithmic problem. I have a known graph algorithm with a single central node. The aim is to deliver goods from this central nod ...

I'm working on a program to solve a variant of the 0/1 Knapsack problem. The original problem is described here: https://en.wikipedia.org/wiki/Knapsa ...

I am solving a problem that looks like partition problem to me: I have a sequence of integers and I should find one (if there are more than one soluti ...

Partition problem is known to be NP-hard. Depending on the particular instance of the problem we can try dynamic programming or some heuristics like d ...

I have a set of floating point values that I want to divide into two sets whose size differs at most by one element. Additionally, the difference of v ...

I´ve got the following assignment. You have a multiset S with of 1<=N<=22 elements. Each element has a positive value of up to 10000000. Assmu ...

I have a problem that states the following: Given a sequence of numbers (S), an initial value (V) and a target value (T), check if there is a sequenc ...

Given a list of numbers L = { a1, a2, a3, a4, ... , aN} The problem is to divide this L into two parts, not just once but recursively until it become ...

You can exempt atmost one element from the set to acheive the goal. example:- N=3 the numbers given are = 1,2,5 So, Set 1 should be :- [1] Set 2 ...