Dec 7, 2025 · 3 min read · Các Cột Mốc Phát Triển YOLO Phiên bảnNămĐột phá kỹ thuật chínhÝ nghĩaNhóm tác giả YOLOv12016Bộ phát hiện vật thể one-stage đầu tiênMở ra kỷ nguyên one-stage, tốc độ vượt trội so với Faster R-CNNJoseph Redmon YOLOv22017BatchNorm + Anchor Boxes...
Join discussionJul 11, 2025 · 7 min read · Let’s dive into explaining the solution for LeetCode Problem 1356: Sort Integers by The Number of 1 Bits, covering the problem requirements, the provided code’s functionality, a complexity analysis, and verifying the solution’s correctness. The code ...
Join discussion
Jul 3, 2025 · 5 min read · LeetCode Link Topics: String,Backtracking,Greedy,Counting,Enumeration,DFS Date: 27th June 2025 Problem Statement Given a string s and an integer k, return the longest subsequence of s such that the subsequence can be repeated k times as a subsequenc...
Join discussion
Jun 22, 2025 · 5 min read · Problem Description I assume you have read the original problem description in the link above, so I will share some key points about a common mistake in the problem, which is using a greedy approach. A common mistake: greedily delete from the most co...
Join discussion
Jun 21, 2025 · 2 min read · Problem Description Thinking process Let's read the problem description first. It mentioned that we have a list of directions in sequence, given at most k times to change direction at any step. How far can you go from the base point in Manhattan dist...
Join discussion
Apr 11, 2025 · 2 min read · There's something undeniably captivating about watching birds. Whether you're marveling at a hummingbird's iridescent feathers or listening to a robin's cheerful song, these creatures have a unique way of tugging at our heartstrings. But lately, bir...
Join discussionApr 21, 2024 · 1 min read · Given an integer array nums and an integer k, return the number of pairs (i, j) where i < j such that |nums[i] - nums[j]| == k. The value of |x| is defined as: x if x >= 0. -x if x < 0. LeetCode Problem - 2006 class Solution { // Function to ...
Join discussion
