LeetCode Solutions in Go

Stats

Difficulty	Count
Easy	11
Medium	0
Hard	0

Problems

#	Title	Difficulty	Tags
100	Same Tree	Easy	DFS
101	Symmetric Tree	Easy	DFS
104	Maximum Depth of Binary Tree	Easy	DFS
108	Convert Sorted Array to Binary Search Tree	Easy	DFS
66	Plus One	Easy	array, math
67	Add Binary	Easy
69	Sqrt(x)	Easy	Binary Search
70	Climbing Stairs	Easy	Fibonacci
83	Remove Duplicates from Sorted List	Easy	Singly Linked List
88	Merge Sorted Arrary	Easy	Merge
94	Binary Tree Inorder Traversal	Easy	DFS

Usage

# 新しい問題を追加
mise run new -- 42

# README を再生成
mise run readme

# テスト実行
mise run test -- 0001-two-sum

# 全テスト実行
mise run test-all

Setup (Neovim)

Telescope で problems/ 配下を live_grep すればタグ・難易度で絞り込めます。

-- キーマップ例
vim.keymap.set("n", "<leader>lc", function()
  require("telescope.builtin").live_grep({ search_dirs = { "problems" } })
end, { desc = "LeetCode grep" })