Added 1368. Minimum Cost to Make at Least One Valid Path in a Grid

Author: LuaanNguyen

README.md

@@ -28,18 +28,19 @@ go test ./easy/0001_two_sum
 
 ## Solutions (Continue Updating...)
 
-|                                                              Leetcode ID                                                              | Title & Solution                                                                                      | Coefficient Of Difficulty |                     Remarks                      |
-| :-----------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------- | :-----------------------: | :----------------------------------------------: |
-|                                      [0001](https://leetcode.com/problems/two-sum/description/)                                       | [Two Sum](/easy/0001_two_sum)                                                                         |           Easy            |             _`HashTable`_ _`Array`_              |
-|                                   [0392](https://leetcode.com/problems/is-subsequence/description/)                                   | [Is Subsequence](/easy/0392_is_subsequence)                                                           |           Easy            |           _`Two Pointers`_ _`String`_            |
-|                          [3042](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/description/)                           | [Count Prefix and Suffix Pairs I](/easy/3042_count_prefix_and_sufix_pairs_I)                          |           Easy            |               _`Array`_ _`String`_               |
-|                         [2185](https://leetcode.com/problems/counting-words-with-a-given-prefix/description/)                         | [Counting Words With a Given Prefix](/easy/2185_counting_words_with_a_given_string)                   |           Easy            |     _`Array`_ _`String`_ _`String Matching`_     |
-|       [1400](https://leetcode.com/problems/construct-k-palindrome-strings/description/?envType=daily-question&envId=2025-01-11)       | [Construct K Palindrome Strings](/medium/1400_construct_k_palindrome_strings)                         |          Medium           | _`HashTable`_ _`String`_ _`Greedy`_ _`Counting`_ |
-| [2116](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/description/?envType=daily-question&envId=2025-01-12) | [Check if a Parentheses String Can Be Valid](/medium/2116_check_if_a_parentheses_string_can_be_valid) |          Medium           |         _`Stack`_ _`String`_ _`Greedy`_          |
-| [3223](https://leetcode.com/problems/minimum-length-of-string-after-operations/description/?envType=daily-question&envId=2025-01-13)  | [Minimum Length of String After Operations](/medium/2116_check_if_a_parentheses_string_can_be_valid)  |          Medium           |      _`HashTable`_ _`String`_ _`Counting`_       |
-| [2657](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/description/?envType=daily-question&envId=2025-01-14) | [Find the Prefix Common Array of Two Arrays](/medium/2657_find_the_prefix_common_array_of_two_arrays) |          Medium           |             _`HashTable`_ _`Array`_              |
-|                [2429](https://leetcode.com/problems/minimize-xor/description/?envType=daily-question&envId=2025-01-15)                | [Minimize XOR](/medium/2429_minimize_XOR)                                                             |          Medium           |               _`Bit Manipulation`_               |
-|        [2425](https://leetcode.com/problems/bitwise-xor-of-all-pairings/description/?envType=daily-question&envId=2025-01-16)         | [Bitwise XOR of All Pairings](/medium/2429_minimize_XOR)                                              |          Medium           |      _`Bit Manipulation`_ _`Brain Teaser`_       |
+|                                                              Leetcode ID                                                              | Title & Solution                                                                                                            | Coefficient Of Difficulty |                                             Remarks                                              |
+| :-----------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------- | :-----------------------: | :----------------------------------------------------------------------------------------------: |
+|                                      [0001](https://leetcode.com/problems/two-sum/description/)                                       | [Two Sum](/easy/0001_two_sum)                                                                                               |           Easy            |                                     _`HashTable`_ _`Array`_                                      |
+|                                   [0392](https://leetcode.com/problems/is-subsequence/description/)                                   | [Is Subsequence](/easy/0392_is_subsequence)                                                                                 |           Easy            |                                   _`Two Pointers`_ _`String`_                                    |
+|                          [3042](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/description/)                           | [Count Prefix and Suffix Pairs I](/easy/3042_count_prefix_and_sufix_pairs_I)                                                |           Easy            |                                       _`Array`_ _`String`_                                       |
+|                         [2185](https://leetcode.com/problems/counting-words-with-a-given-prefix/description/)                         | [Counting Words With a Given Prefix](/easy/2185_counting_words_with_a_given_string)                                         |           Easy            |                             _`Array`_ _`String`_ _`String Matching`_                             |
+|       [1400](https://leetcode.com/problems/construct-k-palindrome-strings/description/?envType=daily-question&envId=2025-01-11)       | [Construct K Palindrome Strings](/medium/1400_construct_k_palindrome_strings)                                               |          Medium           |                         _`HashTable`_ _`String`_ _`Greedy`_ _`Counting`_                         |
+| [2116](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/description/?envType=daily-question&envId=2025-01-12) | [Check if a Parentheses String Can Be Valid](/medium/2116_check_if_a_parentheses_string_can_be_valid)                       |          Medium           |                                 _`Stack`_ _`String`_ _`Greedy`_                                  |
+| [3223](https://leetcode.com/problems/minimum-length-of-string-after-operations/description/?envType=daily-question&envId=2025-01-13)  | [Minimum Length of String After Operations](/medium/2116_check_if_a_parentheses_string_can_be_valid)                        |          Medium           |                              _`HashTable`_ _`String`_ _`Counting`_                               |
+| [2657](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/description/?envType=daily-question&envId=2025-01-14) | [Find the Prefix Common Array of Two Arrays](/medium/2657_find_the_prefix_common_array_of_two_arrays)                       |          Medium           |                                     _`HashTable`_ _`Array`_                                      |
+|                [2429](https://leetcode.com/problems/minimize-xor/description/?envType=daily-question&envId=2025-01-15)                | [Minimize XOR](/medium/2429_minimize_XOR)                                                                                   |          Medium           |                                       _`Bit Manipulation`_                                       |
+|        [2425](https://leetcode.com/problems/bitwise-xor-of-all-pairings/description/?envType=daily-question&envId=2025-01-16)         | [Bitwise XOR of All Pairings](/medium/2429_minimize_XOR)                                                                    |          Medium           |                              _`Bit Manipulation`_ _`Brain Teaser`_                               |
+| [1368](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/?envType=daily-question&envId=2025-01-18) | [Minimum Cost to Make at Least One Valid Path in a Grid](/hard/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid) |           Hard            | _`Breadth First Search`_ _`Graph`_ `Heap(Priority Queue)` _`Matrix`_ _`Shortest Path`_ _`Array`_ |
 
 ## License 🪪
 

hard/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid.go

@@ -0,0 +1 @@
+package minimum_cost_to_make_at_least_one_valid_path_in_a_grid

hard/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid_test.go

@@ -0,0 +1 @@
+package minimum_cost_to_make_at_least_one_valid_path_in_a_grid