This repository contains my solutions to LeetCode problems in Go.
easy/: Easy level problems.medium/: Medium level problems.hard/: Hard level problems.
In your root direction, run:
go test ./...If you only want to run tests in a specific problem (e.g., ./easy/0001_two_sum), run:
go test ./easy/0001_two_sum| Leetcode ID | Title & Solution | Coefficient Of Difficulty | Remarks |
|---|---|---|---|
| 3042 | Count Prefix and Suffix Pairs I | Easy | Array String |
| 2185 | Counting Words With a Given Prefix | Easy | Array String String Matching |
| 1400 | Construct K Palindrome Strings | Medium | HashTable String Greedy Counting |
| 2116 | Check if a Parentheses String Can Be Valid | Medium | Stack String Greedy |
| 3223 | Minimum Length of String After Operations | Medium | HashTable String Counting |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium | HashTable Array |
| 2429 | Minimize XOR | Medium | Bit Manipulation |
| 2425 | Bitwise XOR of All Pairings | Medium | Bit Manipulation Brain Teaser |
| 2683 | Neighboring Bitwise XOR | Medium | Bit Manipulation Array |
| 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 | Trapping Rain Water II | Hard | Breadth First Search Graph Heap(Priority Queue) Matrix Shortest Path Array |
| 2661 | First Completely Painter Row or Column | medium | Matrix HashTable Array |
| 2017 | Grid Game | medium | Matrix Prefix Sum |
| 1765 | Map of Highest Peak | medium | Graph Breadth-First Search |
| 1267 | Count Servers that Communicate | medium | Counting Array |
MIT License
Copyright (c) 2025 Luan Nguyen