Solved

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

13 days ago

Solved

The Heisenberg Entanglement Protocol
Abstract: A quantum signal must be routed through nodes. The cost of transmission is not purely geometric but depends on the p...

14 days ago

Solved

The Singularity: Omega Phase
Abstract: Navigate a signal through a non-linear, resource-constrained, time-varying neural network. The topology and node prop...

14 days ago

Solved

Concentric Squares Mandala
Generate concentric square rings of alternating 1s and 0s to form a layered mandala-style matrix. e.g. N = 5; 1 1 1 1 1;...

18 days ago

Solved

Circular Ring Approximation Mandala
Generate a matrix that approximates a circular ring using distance-based thresholding , a visually rich mandala-inspired challen...

18 days ago

Solved

Diagonal Cross Mandala
Generate an N×N matrix with diagonals highlighted to form an artistic X-shaped mandala pattern. e.g. N = 5; 1 0 0...

18 days ago

Solved

Plus Cross Mandala
Create a symmetrical plus (+) shaped pattern centered in an N×N matrix.

18 days ago

Solved

Vertical Mirror Mandala
Create a symmetric left-right mirrored pattern in an N×N matrix to emulate mandala reflection symmetry. e.g. N = 5; ...

18 days ago

Solved

Hourglass Mandala
Generate an hourglass shape using matrix geometry and symmetry. e.g. N = 5; 1 1 1 1 1; 0 1 1 1 0; ...

18 days ago

Solved

Record the Actions ( Medium )
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...

18 days ago

Solved

The Classic 8-5-3 Sharing ( Medium )
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...

18 days ago

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

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

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

25 days ago

Solved

Total Volume Goal ( Medium )
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

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

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

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

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

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

27 days ago

Solved

Double the 2x2 Matrix
In this challenge, you are given a predefined 2x2 matrix called x. Your task is to multiply every element in this matrix by 2 an...

30 days ago

Solved

Spiral Mandala
Generate a clockwise spiral pattern using 1s in an N×N matrix to create an intricate mandala effect. e.g. N = 5; y_correct...

1 month ago

Solved

Starburst Mandala
Create a mandala starburst using diagonal and orthogonal symmetry in a matrix.

1 month ago

Solved

Hollow Diamond Pattern
Create an N×N matrix that forms a hollow diamond shape using 1s, leaving the interior empty. This challenge emphasizes boundary ...

1 month ago

Solved

Filled Diamond Pattern
Create an N×N binary matrix that forms a filled diamond shape centered in the matrix. The diamond expands symmetrically toward t...

1 month ago

Solved

Rotating the plane region bounded by two polynomials
Let p and q be n-degree and m-degree polynomials with n >= m >= 1. Consider clockwise rotate the plane region bounded by these t...

1 month ago

Solved

Rotating 2d curve around a vertical axis
Let p be an even-degree polynomial such that has a unique vertex (single global extremum). Consider the counterclockwise rotatio...

1 month ago

Solved

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

1 month ago

Solved

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

1 month ago

Solved

Play Oware with the digits of a number
Oware is a pit and pebble game that consists of two sets of pits or houses filled with pebbles or seeds. During a turn, a player...

2 months ago