Python, C++, C, Java, Javascript, R, MATLAB, CSS, Arduino
Spoken Languages:
English, Spanish
Professional Interests:
Robotics and Autonomous Systems, Motion and Path Planning, SLAM, Embedded Systems
Estadística
0 Preguntas
2.210 Respuestas
21 Archivos
Cody62 Problemas
5454 Soluciones
CLASIFICACIÓN
37
of 301.513
REPUTACIÓN
5.348
CONTRIBUCIONES
0 Preguntas
2.210 Respuestas
ACEPTACIÓN DE RESPUESTAS
0.00%
VOTOS RECIBIDOS
626
CLASIFICACIÓN
1.619 of 21.310
REPUTACIÓN
1.171
EVALUACIÓN MEDIA
4.60
CONTRIBUCIONES
21 Archivos
DESCARGAS
63
ALL TIME DESCARGAS
9464
CLASIFICACIÓN
4
of 175.013
CONTRIBUCIONES
62 Problemas
5454 Soluciones
PUNTUACIÓN
58.897
NÚMERO DE INSIGNIAS
144
CONTRIBUCIONES
0 Publicaciones
CONTRIBUCIONES
0 Público Canales
EVALUACIÓN MEDIA
CONTRIBUCIONES
7 Temas destacados
MEDIA DE ME GUSTA
0
Feeds
Resuelto
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...
alrededor de 4 horas hace
Resuelto
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...
alrededor de 5 horas hace
Resuelto
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...
alrededor de 7 horas hace
Resuelto
The Singularity: Omega Phase
Abstract: Navigate a signal through a non-linear, resource-constrained, time-varying neural network. The topology and node prop...
alrededor de 8 horas hace
Resuelto
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;...
4 días hace
Resuelto
Circular Ring Approximation Mandala
Generate a matrix that approximates a circular ring using distance-based thresholding , a visually rich mandala-inspired challen...
4 días hace
Resuelto
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...
4 días hace
Resuelto
Plus Cross Mandala
Create a symmetrical plus (+) shaped pattern centered in an N×N matrix.
4 días hace
Resuelto
Vertical Mirror Mandala
Create a symmetric left-right mirrored pattern in an N×N matrix to emulate mandala reflection symmetry. e.g. N = 5; ...
4 días hace
Resuelto
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; ...
4 días hace
Resuelto
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...
5 días hace
Resuelto
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...
5 días hace
Resuelto
Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...
5 días hace
Resuelto
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 días hace
Resuelto
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 días hace
Resuelto
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], ...
13 días hace
Resuelto
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, ...
13 días hace
Resuelto
Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...
13 días hace
Resuelto
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. ...
13 días hace
Resuelto
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 ...
13 días hace
Resuelto
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 ...
13 días hace
Resuelto
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...
16 días hace
Resuelto
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...
alrededor de 1 mes hace
Resuelto
Starburst Mandala
Create a mandala starburst using diagonal and orthogonal symmetry in a matrix.
alrededor de 1 mes hace
Resuelto
Hollow Diamond Pattern
Create an N×N matrix that forms a hollow diamond shape using 1s, leaving the interior empty. This challenge emphasizes boundary ...
alrededor de 1 mes hace
Resuelto
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...
alrededor de 1 mes hace
Resuelto
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...
alrededor de 1 mes hace
Resuelto
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...
alrededor de 1 mes hace
Resuelto
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...
alrededor de 1 mes hace
Resuelto
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...
alrededor de 1 mes hace
