Feeds
解決済み
Combine Data With Gaps
Combine data sets a and b where the datasets have "gaps" or unique points. Example: Input a = [1,0; 2,1; ...
7日 前
解決済み
[Master Regular Expression] Validate IP Address
Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is ...
10日 前
解決済み
[Master Regular Expression] Strong Password Checker II
A password is said to be strong if it satisfies all the following criteria: It has at least 8 characters. It contains at l...
10日 前
解決済み
[Master Regular Expression] Vowel-Consonant Score
You are given a string s consisting of lowercase English letters, spaces, and digits. Let v be the number of vowels in s and c ...
10日 前
解決済み
[Master Regular Expression] String Matching in an Array
Given an array of string words, return all strings in words that are a substring of another word. You can return the answer in a...
10日 前
解決済み
The Ultimate Water Challenge ( Expert )
Description: In the previous problems, you were given a target T and asked to find the minimum number of steps to reach it. ...
11日 前
問題
The Ultimate Water Challenge ( Expert )
Description: In the previous problems, you were given a target T and asked to find the minimum number of steps to reach it. ...
11日 前 | 1 | 6 個のソルバー
解決済み
Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...
11日 前
問題
Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...
11日 前 | 1 | 6 個のソルバー
解決済み
Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...
11日 前
問題
Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...
11日 前 | 1 | 6 個のソルバー
解決済み
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...
11日 前
問題
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...
11日 前 | 1 | 6 個のソルバー
解決済み
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, ...
11日 前
問題
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, ...
11日 前 | 1 | 6 個のソルバー
解決済み
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...
11日 前
問題
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...
11日 前 | 1 | 6 個のソルバー
解決済み
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], ...
11日 前
問題
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], ...
11日 前 | 1 | 6 個のソルバー
解決済み
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...
11日 前
問題
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...
11日 前 | 1 | 7 個のソルバー
解決済み
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...
11日 前
問題
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...
11日 前 | 1 | 13 個のソルバー
問題
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...
11日 前 | 1 | 6 個のソルバー
解決済み
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...
11日 前
解決済み
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 ...
11日 前
解決済み
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 ...
11日 前
解決済み
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 ...
11日 前
解決済み
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...
11日 前
解決済み
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 ...
11日 前
