A résolu

Breaking Out of the Matrix
Do you want to take the Red Pill, or the Blue Pill? If you take the Blue Pill, you will simply pass along to the next problem...

23 jours il y a

Problème

Project Aether: Non-Linear Temporal Flow Optimization
Ⅰ. Description In the year 2450, you are the Chief Architect of the Neo-Elysium defense grid. You must manage energy distributi...

24 jours il y a | 1 | 4 solveurs

A résolu

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 ...

24 jours il y a

A résolu

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...

24 jours il y a

A résolu

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 ...

24 jours il y a

Problème

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...

24 jours il y a | 2 | 2 solveurs

Problème

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 ...

24 jours il y a | 1 | 9 solveurs

Problème

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 ...

24 jours il y a | 1 | 4 solveurs

Problème

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...

24 jours il y a | 2 | 4 solveurs

Problème

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...

24 jours il y a | 1 | 7 solveurs

A résolu

[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...

environ un mois il y a

A résolu

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; ...

environ 2 mois il y a

A résolu

[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 ...

environ 2 mois il y a

A résolu

[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...

environ 2 mois il y a

A résolu

[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 ...

environ 2 mois il y a

A résolu

[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...

environ 2 mois il y a

A résolu

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. ...

environ 2 mois il y a

Problème

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. ...

environ 2 mois il y a | 2 | 9 solveurs

A résolu

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 2 mois il y a

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 2 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 2 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 2 mois il y a | 2 | 9 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 2 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 2 mois il y a | 2 | 9 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 2 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 2 mois il y a | 2 | 9 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 2 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 2 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 2 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 2 mois il y a | 2 | 9 solveurs