https://github.com/luaannguyen/go-leetcode
My Golang solutions for daily Leetcode ✏️
https://github.com/luaannguyen/go-leetcode
go golang leetcode leetcode-questions leetcode-solutions
Last synced: 4 months ago
JSON representation
My Golang solutions for daily Leetcode ✏️
- Host: GitHub
- URL: https://github.com/luaannguyen/go-leetcode
- Owner: LuaanNguyen
- License: mit
- Created: 2025-01-06T20:20:10.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2025-01-24T18:14:37.000Z (5 months ago)
- Last Synced: 2025-02-26T12:04:51.234Z (4 months ago)
- Topics: go, golang, leetcode, leetcode-questions, leetcode-solutions
- Language: Go
- Homepage:
- Size: 54.7 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Daily LeetCode Solutions in Go ✏️
This repository contains my solutions to LeetCode problems in [Go](https://go.dev/).
## Folder Structure 🗂️
- `easy/`: Easy level problems.
- `medium/`: Medium level problems.
- `hard/`: Hard level problems.
## Unit Testing 🧪
In your root direction, run:
```bash
go test ./...
```
If you only want to run tests in a specific problem `(e.g., ./easy/0001_two_sum)`, run:
```bash
go test ./easy/0001_two_sum
```
## Solutions (Continue Updating...)
| Leetcode ID | Title & Solution | Coefficient Of Difficulty | Remarks |
| :-----------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------- | :-----------------------: | :----------------------------------------------------------------------------------------------: |
| [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/neighboring-bitwise-xor/description/) | [Bitwise XOR of All Pairings](/medium/2429_minimize_XOR) | Medium | _`Bit Manipulation`_ _`Brain Teaser`_ |
| [2683](https://leetcode.com/problems/bitwise-xor-of-all-pairings/description/?envType=daily-question&envId=2025-01-16) | [Neighboring Bitwise XOR](/medium/2683_neighboring_bitwise_XOR) | Medium | _`Bit Manipulation`_ _`Array`_ |
| [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`_ |
| [407](https://leetcode.com/problems/trapping-rain-water-ii/?envType=daily-question&envId=2025-01-19) | [Trapping Rain Water II](/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`_ |
| [2661](https://leetcode.com/problems/first-completely-painted-row-or-column/description/?envType=daily-question&envId=2025-01-20) | [First Completely Painter Row or Column](/medium/2661_first_completely_painted_row_or_column) | medium | _`Matrix`_ _`HashTable`_ _`Array`_ |
| [2017](https://leetcode.com/problems/grid-game/) | [Grid Game](/medium/2017_grid_game) | medium | _`Matrix`_ _`Prefix Sum`_ |
| [1765](https://leetcode.com/problems/map-of-highest-peak/description/?envType=daily-question&envId=2025-01-22) | [Map of Highest Peak](/medium/1765_map_of_highest_peak) | medium | _`Graph`_ _`Breadth-First Search`_ |
| [1267](https://leetcode.com/problems/count-servers-that-communicate/description/?envType=daily-question&envId=2025-01-23) | [Count Servers that Communicate](/medium/1267_count_servers_that_communicate) | medium | _`Counting`_ _`Array`_ |
| [802](https://leetcode.com/problems/find-eventual-safe-states/description/?envType=daily-question&envId=2025-01-24) | [Find Eventual Safe States](/medium/802_find_eventual_safe_states) | medium | _`Depth-First Search`_ _`Adjacency List`_ |
## License 🪪
```txt
MIT License
Copyright (c) 2025 Luan Nguyen
```