iT 邦幫忙::一起幫忙解決難題，拯救 IT 人的一天

4 Like 0 留言 1425 瀏覽

技術 Leetcode 大神資源總整理與 VS Code 刷題IDE環境配置

前言無論是為了面試、考研，還是單純想精進寫 code 的邏輯，LeetCode 幾乎是避不開的一道坎。尤其對於沒有聽過Leetcode或是無從下手的人，更會對...

xianyu ‧ 2025-12-29

0 Like 0 留言 832 瀏覽

技術 leetcode 1523. Count Odd Numbers in an Interval Range

帳號終於找回 1523. Count Odd Numbers in an Interval Range qustion link [!note]EasyMat...

archie0732 ‧ 2025-12-07

0 Like 0 留言 137 瀏覽

鐵人賽自我挑戰組 DAY 2

深入淺出 Grind 75 系列第 4 篇

技術 383. Ransom Note

題目敘述題目敘述到我們有兩個字串 ransomNote 和 magazine 假設 ransomNote 可以透過 magazine 則回傳 True 否...

whoami ‧ 2025-09-21

0 Like 0 留言 92 瀏覽

鐵人賽自我挑戰組 DAY 2

深入淺出 Grind 75 系列第 3 篇

技術 133. Clone Graph

題目敘述我們必須透過已知的一個 graph 來建立一個一模一樣的 graph 但我們所回傳的 graph 不能是原本的 graph 解題思路當遇到尋...

whoami ‧ 2025-09-18

0 Like 0 留言 122 瀏覽

鐵人賽自我挑戰組 DAY 2

深入淺出 Grind 75 系列第 2 篇

技術 3. Longest Substring Without Repeating Characters

題目敘述給定一個字串 s，請找出其中不包含重複字元的最長子字串的長度。解題思路這題的標籤包含： Hash Table String Slidin...

whoami ‧ 2025-09-16

0 Like 1 留言 134 瀏覽

鐵人賽自我挑戰組 DAY 1

深入淺出 Grind 75 系列第 1 篇

技術 1. Two Sum

題目敘述給定一個整數陣列 nums 和一個整數 target，請找出陣列中兩個數字的索引值，使得這兩個數字加總起來剛好等於 target。每筆測資保證...

whoami ‧ 2025-09-15

0 Like 0 留言 281 瀏覽

鐵人賽 Software Development DAY 11

學習C++必備！30 天演算法入門到進階 + CSES 與 Leetcode 實戰系列第 11 篇

技術 Day 11 — BFS 入門（最短路徑、迷宮遍歷）

一、學習目標了解 BFS（Breadth-First Search）在無權圖求最短邊數路徑的原理與不變量。熟悉四種常見套路：網格 BFS、一般圖 BFS...

lichengen ‧ 2025-09-03

0 Like 0 留言 948 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Edit Distance

Description Edit Distance Given two strings word1 and word2, return the minimu...

xianyu ‧ 2024-11-13

0 Like 0 留言 1070 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Longest Increasing Subsequence

Description Longest Increasing Subsequence Given an integer array nums, return...

xianyu ‧ 2024-11-06

0 Like 0 留言 838 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- House Robber

Descriptoin House Robber You are a professional robber planning to rob houses...

xianyu ‧ 2024-11-02

1 Like 0 留言 1135 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Climbing Stairs

Description Climbing Stairs You are climbing a staircase. It takes n steps to...

xianyu ‧ 2024-11-01

2 Like 0 留言 984 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Find Minimum in Rotated Sorted Array

Description Find Minimum in Rotated Sorted Array Suppose an array of length n...

xianyu ‧ 2024-10-30

0 Like 0 留言 989 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Binary Search

Description 704. Binary Search Easy Topics Companies Given an array of integers...

xianyu ‧ 2024-10-30

0 Like 0 留言 929 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Sort Colors

Description Sort Colors Given an array nums with n objects colored red, white,...

xianyu ‧ 2024-10-29

0 Like 0 留言 857 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Merge Sorted Array

Description Merge Sorted Array You are given two integer arrays nums1 and nums...

xianyu ‧ 2024-10-28

0 Like 0 留言 715 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Pacific Atlantic Water Flow

Description Pacific Atlantic Water Flow There is an m x n rectangular island t...

xianyu ‧ 2024-10-25

0 Like 0 留言 644 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Word Ladder

Description Word Ladder A transformation sequence from word beginWord to word...

xianyu ‧ 2024-10-24

0 Like 0 留言 603 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Course Schedule

Description Course Schedule There are a total of numCourses courses you have t...

xianyu ‧ 2024-10-23

0 Like 0 留言 812 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Number of Islands

Description Number of Islands Given an m x n 2D binary grid grid which represe...

xianyu ‧ 2024-10-22

0 Like 0 留言 794 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Clone Graph

Description Clone Graph Given a reference of a node in a connected undirected...

xianyu ‧ 2024-10-22

0 Like 0 留言 524 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Symmetric Tree

Description Symmetric Tree Given the root of a binary tree, check whether it i...

xianyu ‧ 2024-10-21

0 Like 0 留言 581 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Same Tree

Description Same Tree Given the roots of two binary trees p and q, write a fun...

xianyu ‧ 2024-10-20

0 Like 0 留言 590 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Insert into a Binary Search Tree

Description Insert into a Binary Search Tree You are given the root node of a...

xianyu ‧ 2024-10-19

0 Like 0 留言 672 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Validate Binary Search Tree

Description Validate Binary Search Tree Given the root of a binary tree, deter...

xianyu ‧ 2024-10-18

1 Like 0 留言 464 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Maximum Depth of Binary Tree

Description Maximum Depth of Binary Tree Given the root of a binary tree, retu...

xianyu ‧ 2024-10-18

0 Like 0 留言 515 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Binary Tree Inorder Traversal

Description Binary Tree Inorder Traversal Given the root of a binary tree, ret...

xianyu ‧ 2024-10-18

1 Like 0 留言 476 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Longest Happy String

Description Longest Happy String A string s is called happy if it satisfies th...

xianyu ‧ 2024-10-17

0 Like 0 留言 519 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Group Anagrams

Description Group Anagrams Given an array of strings strs, group theanagrams t...

xianyu ‧ 2024-10-17

0 Like 0 留言 356 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Top K Frequent Elements

Description Top K Frequent Elements Given an integer array nums and an integer...

xianyu ‧ 2024-10-15

0 Like 0 留言 609 瀏覽

技術【LeetCode with C: A Series of Problem-Solving Techniques--LongestSubstringWithoutRepeatingCharacters

Description Longest Substring Without Repeating Characters Given a string s, f...

xianyu ‧ 2024-10-15

技術 Leetcode 大神資源總整理與 VS Code 刷題IDE環境配置

技術 leetcode 1523. Count Odd Numbers in an Interval Range

技術 383. Ransom Note

技術 133. Clone Graph

技術 3. Longest Substring Without Repeating Characters

技術 1. Two Sum

技術 Day 11 — BFS 入門（最短路徑、迷宮遍歷）

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Edit Distance

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Longest Increasing Subsequence

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- House Robber

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Climbing Stairs

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Find Minimum in Rotated Sorted Array

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Binary Search

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Sort Colors

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Merge Sorted Array

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Pacific Atlantic Water Flow

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Word Ladder

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Course Schedule

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Number of Islands

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Clone Graph

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Symmetric Tree

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Same Tree

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Insert into a Binary Search Tree

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Validate Binary Search Tree

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Maximum Depth of Binary Tree

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Binary Tree Inorder Traversal

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Longest Happy String

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Group Anagrams

技術 【LeetCode with C: A Series of Problem-Solving Techniques】-- Top K Frequent Elements

技術 【LeetCode with C: A Series of Problem-Solving Techniques--LongestSubstringWithoutRepeatingCharacters

標記使用者

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Edit Distance

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Longest Increasing Subsequence

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- House Robber

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Climbing Stairs

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Find Minimum in Rotated Sorted Array

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Binary Search

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Sort Colors

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Merge Sorted Array

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Pacific Atlantic Water Flow

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Word Ladder

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Course Schedule

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Number of Islands

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Clone Graph

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Symmetric Tree

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Same Tree

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Insert into a Binary Search Tree

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Validate Binary Search Tree

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Maximum Depth of Binary Tree

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Binary Tree Inorder Traversal

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Longest Happy String

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Group Anagrams

技術【LeetCode with C: A Series of Problem-Solving Techniques】-- Top K Frequent Elements

技術【LeetCode with C: A Series of Problem-Solving Techniques--LongestSubstringWithoutRepeatingCharacters