Statistics
RANK
N/A
of 301,307
REPUTATION
N/A
CONTRIBUTIONS
0 Questions
0 Answers
ANSWER ACCEPTANCE
0.00%
VOTES RECEIVED
0
RANK
of 21,235
REPUTATION
N/A
AVERAGE RATING
0.00
CONTRIBUTIONS
0 Files
DOWNLOADS
0
ALL TIME DOWNLOADS
0
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
0 Public Channels
AVERAGE RATING
CONTRIBUTIONS
0 Discussions
AVERAGE NO. OF LIKES
Feeds
Solved
Robust Huffman Decoding: The Single-Bit Error Challenge
In the world of data compression, Huffman coding is a classic algorithm. However, it is notoriously fragile: a single bit error ...
12 hours ago
Solved
Interstellar Navigation: Minimum Time with Moving Hazards
You are the pilot of a spaceship at the origin P_start = (0,0,0) at time t = 0. Your mission is to reach a space station located...
12 hours ago
Solved
The Optimal 2D Guillotine Cutting Stock Problem
You are working in a factory that produces rectangular glass sheets. You have a large stock plate of size W x H. Customers have ...
12 hours ago
Solved
The Quantum Knight's Tour on a Toroidal Hexagonal Board
In this challenge, you must navigate a knight on a Toroidal Hexagonal Grid of size The grid: We use the Axial Coordinate Syst...
12 hours ago
Solved
The Omega Protocol: Hyper-dimensional Navigation and the Singularity Constraint
Description [EMERGENCY TRANSMISSION - GALACTIC COMMAND] Subject: Mission Omega-7 - Navigation through the K-94 Tesseract Anoma...
12 hours ago
Problem
The Omega Protocol: Hyper-dimensional Navigation and the Singularity Constraint
Description [EMERGENCY TRANSMISSION - GALACTIC COMMAND] Subject: Mission Omega-7 - Navigation through the K-94 Tesseract Anoma...
12 hours ago | 1 | 2 solvers
Problem
Robust Huffman Decoding: The Single-Bit Error Challenge
In the world of data compression, Huffman coding is a classic algorithm. However, it is notoriously fragile: a single bit error ...
14 hours ago | 1 | 1 solver
Problem
The Optimal 2D Guillotine Cutting Stock Problem
You are working in a factory that produces rectangular glass sheets. You have a large stock plate of size W x H. Customers have ...
14 hours ago | 1 | 1 solver
Problem
Interstellar Navigation: Minimum Time with Moving Hazards
You are the pilot of a spaceship at the origin P_start = (0,0,0) at time t = 0. Your mission is to reach a space station located...
15 hours ago | 0 | 1 solver
Problem
The Quantum Knight's Tour on a Toroidal Hexagonal Board
In this challenge, you must navigate a knight on a Toroidal Hexagonal Grid of size The grid: We use the Axial Coordinate Syst...
15 hours ago | 0 | 1 solver
Solved
[Master Regular Expression] Largest Substring Between Two Equal Character
Given a string s, return the length of the longest substring between two equal characters, excluding the two characters. If ther...
15 days ago
Solved
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; ...
22 days ago
Solved
[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 ...
25 days ago
Solved
[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...
25 days ago
Solved
[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 ...
25 days ago
Solved
[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...
25 days ago
Solved
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. ...
26 days ago
Problem
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. ...
26 days ago | 2 | 7 solvers
Solved
Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...
26 days ago
Problem
Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...
26 days ago | 2 | 7 solvers
Solved
Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...
26 days ago
Problem
Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...
26 days ago | 2 | 8 solvers
Solved
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...
26 days ago
Problem
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...
26 days ago | 2 | 8 solvers
Solved
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, ...
26 days ago
Problem
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, ...
26 days ago | 2 | 8 solvers
Solved
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...
26 days ago
Problem
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...
26 days ago | 2 | 8 solvers
Solved
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], ...
26 days ago
Problem
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], ...
26 days ago | 2 | 8 solvers
