Statistiques
0 Problèmes
30 Solutions
RANG
N/A
of 302 370
RÉPUTATION
N/A
CONTRIBUTIONS
0 Questions
0 Réponses
ACCEPTATION DE VOS RÉPONSES
0.00%
VOTES REÇUS
0
RANG
of 21 741
RÉPUTATION
N/A
CLASSEMENT MOYEN
0.00
CONTRIBUTIONS
0 Fichier
TÉLÉCHARGEMENTS
0
ALL TIME TÉLÉCHARGEMENTS
0
CONTRIBUTIONS
0 Publications
CONTRIBUTIONS
0 Public Chaîne
CLASSEMENT MOYEN
CONTRIBUTIONS
0 Point fort
NOMBRE MOYEN DE LIKES
Feeds
A résolu
5-year Annedversaries
This is the Bonus Round problem for the 2025 Cody Contest. Attend the watch party on Friday, March 27 to see how 6 champions fro...
8 mois il y a
A résolu
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...
8 mois il y a
A résolu
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...
8 mois il y a
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 ...
8 mois 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 ...
8 mois 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...
8 mois il y a
A résolu
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...
8 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. ...
9 mois il y a
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...
9 mois il y a
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 ...
9 mois il y a
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...
9 mois il y a
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, ...
9 mois il y a
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...
9 mois il y a
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], ...
9 mois il y a
A résolu
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...
9 mois il y a
A résolu
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...
9 mois il y a
A résolu
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...
9 mois il y a
A résolu
PACMAT 05 - Optimized Ghosts, PACMAT increasing speed, 12 Lives
The Classic PACMAN game brought to Cody. PACMAT requires clearing the Yellow Dots while avoiding the wandering ghosts in 12 l...
10 mois il y a
A résolu
Jump Game
Bạn được cho một mảng số nguyên nums. Ban đầu bạn được đặt ở vị trí chỉ mục đầu tiên của mảng, và mỗi phần tử trong mảng biểu th...
10 mois il y a
A résolu
Leo Bậc Thang
Bạn đang leo cầu thang. Cần n bước để lên đến đỉnh. Mỗi lần bạn có thể leo 1 hoặc 2 bước. Hỏi có bao nhiêu cách khác nhau để le...
10 mois il y a
A résolu
[Master Regular Expression] String To Integer
Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer. The algorithm for myAtoi(string s)...
10 mois il y a
A résolu
[Master Regular Expression] Unique Email Addresses
Every valid email consists of a local name and a domain name, separated by the '@' sign. Besides lowercase letters, the email ma...
10 mois il y a
A résolu
[Master Regular Expression] Keyboard Row
Given an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American ke...
10 mois il y a
A résolu
[Master Regular Expression] Goat Latin
You are given a string sentence that consist of words separated by spaces. Each word consists of lowercase and uppercase letters...
10 mois il y a
A résolu
[Master Regular Expression] Reformat Phone Number
You are given a phone number as a string number. number consists of digits, spaces ' ', and/or dashes '-'. You would like to re...
10 mois il y a
A résolu
Calendar Matrix
Return a calendar matrix for the given values of month and year. Assume that Sunday is the first day of the week. The resulting ...
environ un an il y a
A résolu
The Matrix Construction
Given two input ,first one is CN (Column Number), Second one is Dim Can you produce such a matrix for example CN=6; Dim=2 ...
environ un an il y a
A résolu
Diagonal of a Spiral Matrix
Write a function that will return same output as diag(spiral(n)). The only exception is that spiral and diag functions are not a...
environ un an il y a
A résolu
Fibonacci Decomposition
Every positive integer has a unique decomposition into nonconsecutive Fibonacci numbers f1+f2+ ... Given a positive integer n, r...
environ un an il y a
A résolu
Investigate the frequency of last digits of prime numbers
The last digit of a prime number greater than 5 can be 1, 3, 7, or 9. If the primes are distributed randomly, then these digits ...
environ un an il y a





