Tag feed

#counting

13 posts0 followers

Explore Hashnode

Alternatives

Trending tags this week

TIThe Invariantprojectinvariant.hashnode.devJun 12 · 7 min read

You were never just counting, you were remembering.

Sequences are intriguing- for humanity, they always have been. Before the idea of numbers, there was the idea of multiple existences. One stone. Two stones. 29 markings on the LeBombo bone. Sumerian c

0

PNPhương Nguyễnyolo-model-for-human-counting-systems.hashnode.devDec 7, 2025 · 3 min read

Hướng Dẫn Chọn Phiên Bản YOLO Phù Hợp Cho Đếm Người: Từ YOLOv5 Đến YOLO11

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...

0

AHAnni Huanghuanganni.hashnode.devJul 11, 2025 · 7 min read

LeetCode Problem 1356 Sort Integers by The Number of 1 Bits (Easy, Java, O(nlogn))

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 ...

0

AHAnni Huanghuanganni.hashnode.devJul 3, 2025 · 5 min read

LeetCode Daily Challenge-2014. Longest Subsequence Repeated k Times(Hard)

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...

0

AHAnni Huanghuanganni.hashnode.devJun 22, 2025 · 5 min read

LeetCode Daily Challenge-3085. Minimum Deletions to Make String K-Special

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...

0

AHAnni Huanghuanganni.hashnode.devJun 21, 2025 · 2 min read

LeetCode Daily Challenge-3443. Maximum Manhattan Distance After K Changes

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...

0

TBTech Beastztechbeast.hashnode.devApr 11, 2025 · 2 min read

Counting Crows and Connecting with Nature: The Rise of Citizen Science

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...

0

TRTapan Rachchhtapanrachchh.hashnode.devMar 17, 2025 · 1 min read

2206. Divide Array Into Equal Pairs

class Solution: def divideArray(self, nums: List[int]) -> bool: c = Counter(nums) for e in c: if c[e] % 2 != 0: return False return True

0

TRTapan Rachchhtapanrachchh.hashnode.devJan 13, 2025 · 1 min read

3223. Minimum Length of String After Operations

class Solution: def minimumLength(self, s: str) -> int: c = Counter(s) def removals(n): if n >= 3: if n % 2 == 0 : return n - 2 return n - 1 return 0 ...

0

TRTapan Rachchhtapanrachchh.hashnode.devJan 11, 2025 · 1 min read

1400. Construct K Palindrome Strings

class Solution: def canConstruct(self, s: str, k: int) -> bool: l = len(s) if l < k: return False if l == k: return True c = Counter(s) oddCount = 0 for e in c: ...

0

#counting

Search Hashnode

#counting

Explore Hashnode

Trending tags this week

You were never just counting, you were remembering.

Hướng Dẫn Chọn Phiên Bản YOLO Phù Hợp Cho Đếm Người: Từ YOLOv5 Đến YOLO11

LeetCode Problem 1356 Sort Integers by The Number of 1 Bits (Easy, Java, O(nlogn))

LeetCode Daily Challenge-2014. Longest Subsequence Repeated k Times(Hard)

LeetCode Daily Challenge-3085. Minimum Deletions to Make String K-Special

LeetCode Daily Challenge-3443. Maximum Manhattan Distance After K Changes

Counting Crows and Connecting with Nature: The Rise of Citizen Science

2206. Divide Array Into Equal Pairs

3223. Minimum Length of String After Operations

1400. Construct K Palindrome Strings