photo

Hoang Nguyen Khanh Ngan


Last seen: 7日 前 2025 年からアクティブ

Followers: 0   Following: 1

統計

Cody

0 問題
23 解答

ランク
N/A
of 301,186

評判
N/A

コントリビューション
0 質問
0 回答

回答採用率
0.00%

獲得投票数
0

ランク
 of 21,188

評判
N/A

平均評価
0.00

コントリビューション
0 ファイル

ダウンロード
0

ALL TIME ダウンロード
0

ランク
14,638
of 173,292

コントリビューション
0 問題
23 解答

スコア
400

バッジ数
6

コントリビューション
0 投稿

コントリビューション
0 パブリック チャネル

平均評価

コントリビューション
0 ハイライト

平均いいねの数

  • Community Group Solver
  • Speed Demon
  • Leader
  • Commenter
  • Promoter
  • Solver

バッジを表示

Feeds

表示方法

解決済み


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

7日 前

解決済み


Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...

7日 前

解決済み


Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...

7日 前

解決済み


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

7日 前

解決済み


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

7日 前

解決済み


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

7日 前

解決済み


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

7日 前

解決済み


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

7日 前

解決済み


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

7日 前

解決済み


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

7日 前

解決済み


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

23日 前

解決済み


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

25日 前

解決済み


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

25日 前

解決済み


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

25日 前

解決済み


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

25日 前

解決済み


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

25日 前

解決済み


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

25日 前

解決済み


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

25日 前

解決済み


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

3ヶ月 前

解決済み


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

3ヶ月 前

解決済み


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

3ヶ月 前

解決済み


Fibonacci Decomposition
Every positive integer has a unique decomposition into nonconsecutive Fibonacci numbers f1+f2+ ... Given a positive integer n, r...

4ヶ月 前

解決済み


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

4ヶ月 前