Problème

Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...

environ un mois il y a | 2 | 8 solveurs

A résolu

Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...

environ un mois il y a

Problème

Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...

environ un mois il y a | 2 | 8 solveurs

A résolu

Record the Actions
Find the minimum steps to get T units from jugs A and B. Return the sequence of actions as cell array of strings. Available act...

environ un mois il y a

Problème

Record the Actions
Find the minimum steps to get T units from jugs A and B. Return the sequence of actions as cell array of strings. Available act...

environ un mois il y a | 2 | 8 solveurs

A résolu

The Broken Jug: Constrain ( Hard )
One of your jugs is "broken": it can not be Emptied to the drain. It can only be Filled or Poured to another jug. Input: C, T, ...

environ un mois il y a

Problème

The Broken Jug: Constrain ( Hard )
One of your jugs is "broken": it can not be Emptied to the drain. It can only be Filled or Poured to another jug. Input: C, T, ...

environ un mois il y a | 2 | 8 solveurs

A résolu

The Classic 8-5-3 Sharing
You have 3 jugs with capacities [8,5,3]. The 8L jug, the others are empty: [8,0,0]. There is no tap and no drain. You can only p...

environ un mois il y a

Problème

The Classic 8-5-3 Sharing
You have 3 jugs with capacities [8,5,3]. The 8L jug, the others are empty: [8,0,0]. There is no tap and no drain. You can only p...

environ un mois il y a | 2 | 8 solveurs

A résolu

Total Volume Goal
Usually, the target T must be in one jug. In this version, the target T is the sum of water in all N jugs. Example: C = [3,5], ...

environ un mois il y a

Problème

Total Volume Goal
Usually, the target T must be in one jug. In this version, the target T is the sum of water in all N jugs. Example: C = [3,5], ...

environ un mois il y a | 2 | 8 solveurs

A résolu

Two Jugs: Minimum Steps
Following the first problem, now you need to find the shortest path. Given two jugs with capacities A and B, find the minimum nu...

environ un mois il y a

Problème

Two Jugs: Minimum Steps
Following the first problem, now you need to find the shortest path. Given two jugs with capacities A and B, find the minimum nu...

environ un mois il y a | 2 | 10 solveurs

A résolu

Is it Possible?
In the first part of series, we simplify the problem. Given two jugs with capacities A and B, and a target amount T, determine i...

environ un mois il y a

Problème

Is it Possible?
In the first part of series, we simplify the problem. Given two jugs with capacities A and B, and a target amount T, determine i...

environ un mois il y a | 2 | 18 solveurs

Problème

The Generalized N-Jug Water Pouring Problem
Description: You are given N water jugs with maximum capacities specified in a vector C = [ c1, c2, c3,.., c_n]. Initially, all...

environ un mois il y a | 2 | 9 solveurs

A résolu

Find a subset that divides the vector into equal halves
Given a vector x, return the indices to elements that will sum to exactly half of the sum of all elements. Example: Inpu...

environ un mois il y a

A résolu

Make a run-length companion vector
Given a vector x, return a vector r that indicates the run length of any value in x. Each element in r shows how many times the ...

environ un mois il y a

A résolu

How many trades represent all the profit?
Given a list of results from trades made: [1 3 -4 2 -1 2 3] We can add them up to see this series of trades made a profit ...

environ un mois il y a

A résolu

Given a window, how many subsets of a vector sum positive
Given a vector: [1 0 -1 3 2 -3 1] and a window of 2, A sliding window would find: 1 + 0 = 1 0 - 1 = -1 ...

environ un mois il y a

A résolu

Implement simple rotation cypher
If given a letter from the set: [abc...xyz] and a shift, implement a shift cypher. Example: 'abc' with a shi...

environ un mois il y a

A résolu

Spot the outlier
All points except for one lie on a line. Which one is the outlier? Example: You are given a list of x-y pairs in a column ...

environ un mois il y a

A résolu

Solitaire Cipher
Implement the <http://en.wikipedia.org/wiki/Solitaire_(cipher) solitaire cipher>. Since this is from Wikipedia, I am capturin...

environ un mois il y a

A résolu

Flag largest magnitude swings as they occur
You have a phenomenon that produces strictly positive or negative results. delta = [1 -3 4 2 -1 6 -2 -7]; Marching through thi...

environ un mois il y a

A résolu

How long is the longest prime diagonal?
Stanislaw Ulam once observed that if the counting numbers are arranged in a spiral, the prime numbers contained in it form a sur...

environ un mois il y a

A résolu

Find the biggest empty box
You are given a matrix that contains only ones and zeros. Think of the ones as columns in an otherwise empty floor plan. You wan...

environ un mois il y a

A résolu

Stuff the Board
You have a stack of tiles to put onto an array-like playing board. Each tile has a number (always an integer), and the board var...

environ un mois il y a

A résolu

Rotate and display numbered tile
Imagine a square tile with four numbers on it, one on each edge. We will call these edges north, east, south, and west. If th...

environ un mois il y a

A résolu

Find best domino orientation
Given a list of pairs, find the orientation they should be placed in a line, such that the sum of the absolute values of the dif...

environ un mois il y a

A résolu

Choose the best fitting dominoes
You will be given a cell array of nx2 matrices. Choose one row from each matrix. These are the ordered pairs that will be placed...

environ un mois il y a