Hoang Nguyen Khanh Ngan

Last seen: 13 giorni fa | Attivo dal 2025

Followers: 1 Following: 1

Statistica

Feeds

Risolto

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 giorni fa

Risolto

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

13 giorni fa

Risolto

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 giorni fa

Risolto

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

13 giorni fa

Risolto

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 giorni fa

Risolto

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

13 giorni fa

Risolto

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

13 giorni fa

Risolto

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

13 giorni fa

Risolto

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

13 giorni fa

Risolto

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

13 giorni fa

Risolto

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

29 giorni fa

Risolto

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

circa un mese fa

Risolto

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

circa un mese fa

Risolto

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

circa un mese fa

Risolto

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

circa un mese fa

Risolto

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

circa un mese fa

Risolto

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

circa un mese fa

Risolto

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

circa un mese fa

Risolto

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

4 mesi fa

Risolto

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

4 mesi fa

Risolto

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

4 mesi fa

Risolto

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

4 mesi fa

Risolto

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 mesi fa